Freight railcar routing problem in Russia

Ruslan Sadykov 1 Alexander Lazarev 2 Vitaliy Shiryaev 3 Alexey Stratonnikov 3
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : In this problem, we need to 1) chose a profitable set of requests for goods delivery between stations in Russian railroad network, and 2) perform these requests by appropriately routing the set of available railcars. We formulate the problem as a multi-commodity flow problem in a space-time graph, and apply to it the column generation for extended formulations approach, in which columns-routes are disaggregated into arc variables when added to the restricted master problem. Real-life instances with up to 10 millions of arc variables were solved within minutes of computational time.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-00857920
Contributor : Ruslan Sadykov <>
Submitted on : Wednesday, September 4, 2013 - 11:32:07 AM
Last modification on : Thursday, January 11, 2018 - 6:22:12 AM

Identifiers

  • HAL Id : hal-00857920, version 1

Citation

Ruslan Sadykov, Alexander Lazarev, Vitaliy Shiryaev, Alexey Stratonnikov. Freight railcar routing problem in Russia. 26th European Conference on Operational Research, Jul 2013, Rome, Italy. ⟨hal-00857920⟩

Share

Metrics

Record views

256