Airport Pickup and Delivery Scheduling with Two Kinds of Vehicles

Article Preview

Abstract:

This paper studies the cooperation-based vehicle scheduling problem of two kinds of vehicles with time window for pickup and delivery of customers to airport. Producing isolated-customer points and vehicles cooperation points, we clustering the customer points. Then we choose appropriate vehicle kind to send customers to airport. Finally, we perform the test analysis on study case. Simulation results indicate that our approach is feasible and effective.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 791-793)

Pages:

2211-2215

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] R. Baldacci, A. Mingozzi, R. Roberti. New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem. Operations Research, 2011, 59(5): 1269-1283.

DOI: 10.1287/opre.1110.0975

Google Scholar

[2] V. Pillac, M. Gendreau, C. Guéreta, et al. A review of dynamic vehicle routing problems. European Journal of Operational Research, 2013, 225(1): 1–11.

DOI: 10.1016/j.ejor.2012.08.015

Google Scholar

[3] D. Jiang, G. Hu. GARCH model-based large-scale IP traffic matrix estimation. IEEE Communications Letters. 2009, 13(1): 52-54.

DOI: 10.1109/lcomm.2008.081271

Google Scholar

[4] W. Szeto, Y. Wu, S. Ho. An artificial bee colony algorithm for the capacitated vehicle routing problem. European Journal of Operational Research, 2011, 215(1): 126–135.

DOI: 10.1016/j.ejor.2011.06.006

Google Scholar

[5] L. Hong, An improved LNS algorithm for real-time vehicle routing problem with time windows. Computers and Operations Research, 2012, 39(2): 151–163.

DOI: 10.1016/j.cor.2011.03.006

Google Scholar

[6] M. Drexl. Synchronization in Vehicle Routing—A Survey of VRPs with Multiple Synchronization Constraints. Transportation Science, 2012, 46(3): 297-316.

DOI: 10.1287/trsc.1110.0400

Google Scholar

[7] D. Jiang, G. Hu. An accurate approach to large-scale IP traffic matrix estimation. IEICE Transactions on Communications. 2009, E92B(1): 322-325.

DOI: 10.1587/transcom.e92.b.322

Google Scholar

[8] M. Fisher, K. Jornsten, O. Madsen. Vehicle routing with time windows: Two optimization algorithms. Operations Research, 1997, 45(3): 488-492.

DOI: 10.1287/opre.45.3.488

Google Scholar

[9] G. Ribeiroa, G. Laportea. An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Computers and Operations Research, 2012, 39(3): 728-735.

DOI: 10.1016/j.cor.2011.05.005

Google Scholar

[10] P. Belfiore, H. Yoshizaki. Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries. Computers and Industrial Engineering, 2013, 64(2): 589-601.

DOI: 10.1016/j.cie.2012.11.007

Google Scholar

[11] M. Rancourt, J. Cordeau, G. Laporte. Long-Haul Vehicle Routing and Scheduling with Working Hour Rules. Transportation Science, 2013, 47(1): 81-107.

DOI: 10.1287/trsc.1120.0417

Google Scholar

[12] Z. Xu, J. Tang. A coordination-based two-stage algorithm for pickup and delivery customer to airport service, in Proc. of ICMSEM'13, 2013, pp.1-9.

Google Scholar