A Binary Quadratic Programming Approach to the Vehicle Positioning Problem

Ralf Borndörfer () and Carlos Cardonha ()
Additional contact information
Ralf Borndörfer: Zuse Institute Berlin
Carlos Cardonha: Zuse Institute Berlin

A chapter in Modeling, Simulation and Optimization of Complex Processes, 2012, pp 41-51 from Springer

Abstract: Abstract The Vehicle Positioning Problem (VPP) is a classical combinatorial optimization problem that has a natural formulation as a Mixed Integer Quadratically Constrained Program. This MIQCP is closely related to the Quadratic Assignment Problem and, as far as we know, has not received any attention yet. We show in this article that such a formulation has interesting theoretical properties. Its QP relaxation produces, in particular, the first known nontrivial lower bound on the number of shuntings. In our experiments, it also outperformed alternative integer linear models computationally. The strengthening technique that raises the lower bound might also be useful for other combinatorial optimization problems.

Keywords: Quadratic Assignment Problem; Mixed Integer Nonlinear Programming; Integer Quadratic Programming; Parking Position; Integer Linear Model (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-25707-0_4

Ordering information: This item can be ordered from
http://www.springer.com/9783642257070

DOI: 10.1007/978-3-642-25707-0_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().