VEHICLE ROUTING PROBLEM WITH MULTI-DEPOT AND MULTI-TASK

Haoxiong Yang, Li Jing, Yongsheng Zhou, Mingke He

Abstract

This paper presents a new mathematical model of the vehicle routing problem in the context of city distribution, which considers multi-depot, multi-model vehicles and multi-task. The objective function includes three parts: transport cost, deadheading cost and time cost. To solve this mathematical model, a self-adaptive and polymorphic ant colony algorithm (APACA) has been introduced. Finally, a case study is presented to compare the results based on APACA with that under stochastic condition. Simulation results show that APACA is an effective and desirable algorithm for solving the mathematical model.

References

  1. Koehler., 1999. City Logistics in Kassel. City Logistics J: Letters, 1, 261-271.
  2. Yamada, T., Taniguchi, E., Itoh, Y., 2001. Co-operative Vehicle Routing Model with Optimal Location of Logistics Terminals. City Logistics J: Letters. 2, 139- 153.
  3. Renaud, J., Laporte, G., Boctor, F., 1996. A Tabu Search Heuristic for the Multi-depot Vehicle Routing Problem, Computers & Operations Research. 23:229- 235.
  4. Yaohuang Guo, Jun li, 1995. A Survey of Logistics Delivery Vehicle Scheduling. Journal of Xi'an Jiaotong University J: Letters. 30(4), 376-382.
  5. Shengce Hang, Huaizu Li, 1997. The Generalized Assignment Model and Its Decomposition Algorithm of Multiple Depot Vehicle Scheduling Problem (MDVSP). Journal of Xi'an Jiaotong University J: Letters. 31(12), 111-116.
  6. Mingshan Zhang, Xiaowo Tang, 2002. Full Load Vehicle Routing with Multiple Depots: New Network Flow Based Algorithm. Joural of Systems Engineering J: Letters. 17(3), 216-220.
  7. Meijun Chen, Zhisheng,Zhang, Jinfei Shi, 2008. Vehicle Routing Problem with Multiple Constraints Using Adaptive and Polymorphic Ant Colony Algorithm. Journal of Southeast University (Natural Science Edition). 38(1), 37-42.
  8. Yuan Ding, Yinzhen Li,2004. Greedy Sweep Algorithm of Conveyance Route Optimization in Logistical Delivery Management Systems. Journal of Lanzhou Jiao Tong University J: Letters. 23(6), 140-142.
  9. Nan Jia, Yongbo Lv, 2007. Mathematical Model and Arithmetic of VRP in Physical Distribution Routing. Logistics Techology J: Letters.26(4), 54-56.
  10. Shiquan Zhong, Guoguang He, 2005. Study on Multidepot Vehicle Scheduling Problem with Time Windows and Multi-type Vehicle Limits and Its Tabu Search Algorithm. OR TRANSACTIONS J: Letters. 9(4), 67-70.
  11. Meijun Chen, Zhisheng Zhang, Jinfei Shi, 2007. Study on Intelligent and Polymorphic Ant Colony Algorithm Based on Multi-depot Vehicle Routing Problem. Proceedings of the 7th China ITS Annual Meeting, C: Letters.
  12. Lei Wen, FanHua Meng, 2008. An Improved PSO for the Multi-depot Vehicle Routing Problem with Time Windows. IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application . 852-856.
  13. Kallehauge, Brian, 2008. Formulations and Exact Algorithms for the Vehicle Routing Problem with Time Windows. Computers and Operations Research M: Letters. 2307-2330.
  14. Nabila Azi, Michel Gendreau, 2007. An Exact Algorithm for a Vehicle Routing Problem with Time Windows and Multiple Use of Vehicles. Computers and Operations Research M: Letters. 223-237.
Download


Paper Citation


in Harvard Style

Yang H., Jing L., Zhou Y. and He M. (2011). VEHICLE ROUTING PROBLEM WITH MULTI-DEPOT AND MULTI-TASK . In Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 4: MMLM, (ICEIS 2011) ISBN 978-989-8425-56-0, pages 650-655. DOI: 10.5220/0003573406500655


in Bibtex Style

@conference{mmlm11,
author={Haoxiong Yang and Li Jing and Yongsheng Zhou and Mingke He},
title={VEHICLE ROUTING PROBLEM WITH MULTI-DEPOT AND MULTI-TASK},
booktitle={Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 4: MMLM, (ICEIS 2011)},
year={2011},
pages={650-655},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003573406500655},
isbn={978-989-8425-56-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 4: MMLM, (ICEIS 2011)
TI - VEHICLE ROUTING PROBLEM WITH MULTI-DEPOT AND MULTI-TASK
SN - 978-989-8425-56-0
AU - Yang H.
AU - Jing L.
AU - Zhou Y.
AU - He M.
PY - 2011
SP - 650
EP - 655
DO - 10.5220/0003573406500655