Clausen, Tommy

Pisinger, David

We consider a variant of the Vehicle Routing Problem that arises in airports when transporting baggage for passengers with connecting flights. Each bag can be delivered in two locations with disjunctive time windows. The task is to define multiple trips for the vehicles in order to deliver bags that arrive continuously during the day. We present an IP model of the problem and describe the problem as a case study from a real life setting. We present a weighted greedy algorithm for dispatching vehicles that works in an dynamic context, meaning that it only considers bags available at the time of dispatch. Computational results are presented for real-life passenger data with stochastic bag arrival times and travel times. The results indicate that the algorithm is able to dispatch the baggage considerably better than the manual delivery plans reported in the case study, and due to its fast running times, the algorithm is suitable for dynamic dispatching. Investigations on the impact of uncertainty and fleet size make it possible to support a trade-off between fleet size and expected service level

Online Research Database In Technology

                       General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.  • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal   If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.     Downloaded from orbit.dtu.dk on: Dec 17, 2017Dynamic Routing of Short Transfer BaggageClausen, Tommy; Pisinger, DavidPublication date:2010Document VersionPublisher's PDF, also known as Version of recordLink back to DTU OrbitCitation (APA):Clausen, T., & Pisinger, D. (2010). Dynamic Routing of Short Transfer Baggage. Kgs. Lyngby: DTUManagement.  (DTU Management 2010; No. 15).Tommy ClausenDavid PisingerAugust 2010Report 15.2010DTU Management EngineeringDynamic Routing of Short Transfer BaggageWe consider a variant of the Vehicle Routing Problem that arises in airports when transporting baggage for passengers with connecting flights. Each bag can be delivered in two locations with disjunctive time windows. The task is to define multiple trips for the vehicles in order to deliver bags that arrive continuously during the day. We present an IP model of the problem and describe the problem as a case study from a real life setting. We present a weighted greedy algorithm for dis-patching vehicles that works in an dynamic context, meaning that it only considers bags available at the time of dispatch. Computational results are presented for real-life passenger data with stochas-tic bag arrival times and travel times.The results indicate that the algorithm is able to dispatch the baggage considerably better than the manual delivery plans reported in the case study, and due to its fast running times, the algorithm is suitable for dynamic dispatching. Investigations on the impact of uncertainty and fleet size make it possible to support a trade-off between fleet size and expected service level.ISBN 978-87-90855-92-5DTU Management EngineeringDepartment of Management EngineeringTechnical University of DenmarkProduktionstorvetBuilding 424DK-2800 Kongens LyngbyDenmarkTel. +45 45 25 48 00Fax +45 45 93 34 35www.man.dtu.dk

Dynamic Routing of Short Transfer Baggage

http://orbit.dtu.dk/ws/files/4650085/2010_15.pdf

Dynamic Routing of Short Transfer Baggage

Abstract

Similar works

Full text

Available Versions

Online Research Database In Technology