SADYKOV, Ruslan; LAZAREV, Alexander; SHIRYAEV, Vitaliy; STRATONNIKOV, Alexey

doi:10.4230/OASIcs.ATMOS.2013.55

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]

LAZAREV, Alexander
Trapeznikov Institute of Control Sciences [ICS RAS]

SHIRYAEV, Vitaliy
JSC Freight One [Moscou]

Langue

Communication dans un congrès

Ce document a été publié dans

ATMOS - 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems - 2013, 2013-09-05, Sophia Antipolis. 2013

Dagstuhl Open Access Series in Informatics

Résumé en anglais

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.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Solving a Freight Railcar Flow Problem Arising in Russia

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche