• search hit 1 of 2
Back to Result List

1D Vehicle Scheduling with Conflicts

Please always quote using this URN:urn:nbn:de:0296-matheon-7899
  • Systems of rail-mounted vehicles play a key role in many logistics applications, and the efficiency of their operation frequently has a significant impact on the overall performance of the surrounding production environment. In theory, assigning transport requests to the vehicles of such systems and scheduling their execution amounts to finding k tours on a common line, where tours may never cross each other in time--dynamic collision constraints need to be respected. The goal is to minimize the makespan for a given set of transport requests. We establish a model capturing the core challenges in transport planning problems of this type and relate it to other models in literature. After proving NP-hardness for a basic version of the problem, the large part of the paper is dedicated to devising various fast heuristic algorithms suitable for practice. We present computational results regarding the performance of the algorithms proposed for several classes of problem instances.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Felix G. König, Torsten J. Gellert
URN:urn:nbn:de:0296-matheon-7899
Referee:Rolf H. Möhring
Document Type:Preprint, Research Center Matheon
Language:English
Date of first Publication:2011/03/04
Release Date:2011/03/04
Tag:
Institute:Technische Universität Berlin
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90-06 Proceedings, conferences, collections, etc.
Preprint Number:771
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.