A Set Partitioning Approach to Shunting
Please always quote using this URN: urn:nbn:de:0297-zib-11326
- The Vehicle Positioning Problem (VPP) is a classical combinatorial optimization problem in public transport planning. A number of models and approaches have been suggested in the literature, which work for small problems, but not for large ones. We propose in this article a novel set partitioning model and an associated column generation solution approach for the VPP. The model provides a tight linear description of the problem. The pricing problem, and hence the LP relaxation itself, can be solved in polynomial resp. pseudo-polynomial time for some versions of the problems.
Author: | Ralf BorndörferORCiD, Carlos Cardonha |
---|---|
Document Type: | ZIB-Report |
Tag: | combinatorial packing; integer programming; set partitioning; vehicle positioning |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C06 Large-scale problems |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming | |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization | |
Contributing Corporation: | CNPq (Sponsor) |
Date of first Publication: | 2009/06/03 |
Series (Serial Number): | ZIB-Report (09-18) |
ISSN: | 1438-0064 |
ZIB-Reportnumber: | 09-18 |