Based on Ant Colony Blurred Time Vehicle Scheduling Algorithm

DOI

10.2991/iccasm.2012.68How to use a DOI?

Keywords

Ant Colony Algorithm,Blurred Time Windows, VSP, VRP, Logistics

Abstract

With the acceleration of global economic integration and the rapid development of e-commerce logistics become more and more important. How to build a logistics distribution mode to meet both Low-cost and client satisfaction become an important and urgent research topics. In this paper we proposed a based on ant colony blurred time vehicle scheduling algorithm (BVSA). Blurred time vehicle scheduling problem is a good extension of traditional vehicle scheduling problem(VSP). In BVSA we studied many problems such as client satisfaction, vehicle waiting time, vehicle traffic time and vehicle distance. We use ant colony algorithm to solve these problems and the experiment show good results.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Baohe Zuo
AU  - Shaozhu Lin
PY  - 2012/08
DA  - 2012/08
TI  - Based on Ant Colony Blurred Time Vehicle Scheduling Algorithm
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 272
EP  - 275
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.68
DO  - 10.2991/iccasm.2012.68
ID  - Zuo2012/08
ER  -