A Binary Quadratic Programming Approach to the Vehicle Positioning Problem
- The Vehicle Positioning Problem (VPP) consists of the assignment of vehicles (buses, trams or trains) of a public transport or railway company to parking positions in a depot and to timetabled trips. Such companies have many different types of vehicles, and each trip can be performed only by vehicles of some of these types. These assignments are non-trivial due to the topology of depots. The parking positions are organized in tracks, which work as one- or two-sided stacks or queues. If a required type of vehicle is not available in the front of any track, shunting movements must be performed in order to change vehicles' positions, which is undesirable and should be avoided. In this text we present integer linear and non-linear programming formulations for some versions of the problem and compare them from a theoretical and a computational point of view.
| Author: | Ralf BorndörferORCiD, Carlos Cardonha |
|---|---|
| Document Type: | In Proceedings |
| Parent Title (English): | Modeling, Simulation and Optimization of Complex Processes -- Proceedings of the Fourth International Conference on High Performance Scientific Computing, March 2-6, 2009 |
| First Page: | 41 |
| Last Page: | 52 |
| Year of first publication: | 2012 |
| Preprint: | urn:nbn:de:0297-zib-11242 |
| DOI: | https://doi.org/10.1007/978-3-642-25707-0 |
