The Study of Vehicle Routing Model in Emergency Situations

Article Preview

Abstract:

A Vehicle routing model for logistics planning is developed in this paper. The model addresses the dynamic time-dependent transportation problem that needs to be solved repetitively at given time intervals during ongoing aid delivery. The model generates plans incorporating new requests for aid materials, new supplies and transportation means that become available during the current planning time horizon. The plan indicates the optimal mixed pick up and delivery schedules for vehicles within the considered planning time horizon as well as the optimal quantities and types of loads picked up and delivered on these routes. The mathematical model is a hybrid that integrates the multi-commodity network flow problem and the vehicle routing problem. Based on the analysis and calculation of an example, the results indicate that the model is effective and feasible.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 433-440)

Pages:

4807-4812

Citation:

Online since:

January 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Desrochers, M., J.K. Lenstra, M.W.P. Savelsbergh, et al. Vehicle Routing with Time Windows. Vehicle Routing: Methods and Studies. 1988, Amsterdam: Elsevier Science.

Google Scholar

[2] Cristina Bazgan, Refael Hassin, Jérôme Monnot. Approximation algorithms for some vehicle routing problems. Discrete Applied Mathematics , 2005, 146(1): 27-42.

DOI: 10.1016/j.dam.2004.07.003

Google Scholar

[3] Heung-Suk Hwang, Bae-Suk Choi, Ki-Wook Lee, et al. Supply Center Planning Model Using Fuzzy-AHP and VRP. The 3rd International Conference on Innovative Computing Information and Control. 2008, IEEE Computer Society, Washington, DC.

DOI: 10.1109/icicic.2008.529

Google Scholar

[4] Luo Jian-ping, Li Xia Chen, Min-rong. Improved Shuffled Frog Leaping Algorithm for Solving CVRP . Journal of Electronics & Information Technology, 2011, 33(2): 429-434.

DOI: 10.3724/sp.j.1146.2010.00328

Google Scholar