Publikationsdatum:
2020-08-05
Beschreibung:
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.
Schlagwort(e):
ddc:510
Sprache:
Englisch
Materialart:
reportzib
,
doc-type:preprint
Format:
application/pdf
Format:
application/postscript