VEHICLE ROUTING PROBLEM WITH MULTI-DEPOT AND MULTI-TASK

Haoxiong Yang, Li Jing, Yongsheng Zhou, Mingke He

2011

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.

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