Solving a Freight Railcar Flow Problem Arising in Russia
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | SADYKOV, Ruslan | |
| hal.structure.identifier | Trapeznikov Institute of Control Sciences [ICS RAS] | |
| dc.contributor.author | LAZAREV, Alexander | |
| hal.structure.identifier | JSC Freight One [Moscou] | |
| dc.contributor.author | SHIRYAEV, Vitaliy | |
| hal.structure.identifier | JSC Freight One [Moscou] | |
| dc.contributor.author | STRATONNIKOV, Alexey | |
| dc.date.accessioned | 2024-04-04T02:21:35Z | |
| dc.date.available | 2024-04-04T02:21:35Z | |
| dc.date.issued | 2013 | |
| dc.date.conference | 2013-09-05 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/189587 | |
| dc.description.abstractEn | We consider a variant of the freight railcar flow problem. In this problem, we need 1) to chose a set of transportation demands between stations in a railroad network, and 2) to fulfill these demands by appropriately routing the set of available railcars, while maximizing the total profit. We formulate this problem as a multi-commodity flow problem in a large space-time graph. Three approaches are proposed to solve the Linear Programming relaxation of this formulation: direct solution by an LP solver, a column generation approach based on the path reformulation, and a "column generation for extended formulations" approach. In the latter, the multi-commodity flow formulation is solved iteratively by dynamic generation of arc flow variables. Three approaches have been tested on a set of real-life instances provided by one of the largest freight rail transportation companies in Russia. Instances with up to 10 millions of arc flow variables were solved within minutes of computational time. | |
| dc.language.iso | en | |
| dc.publisher | Dagstuhl Open Access Series in Informatics | |
| dc.title.en | Solving a Freight Railcar Flow Problem Arising in Russia | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.4230/OASIcs.ATMOS.2013.55 | |
| dc.subject.hal | Informatique [cs]/Recherche opérationnelle [cs.RO] | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | ATMOS - 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems - 2013 | |
| bordeaux.country | FR | |
| bordeaux.conference.city | Sophia Antipolis | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00857914 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00857914v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2013&rft.au=SADYKOV,%20Ruslan&LAZAREV,%20Alexander&SHIRYAEV,%20Vitaliy&STRATONNIKOV,%20Alexey&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||