EVOLUTIVE AND ACO STRATEGIES FOR SOLVING THE MULTI-DEPOT VEHICLE ROUTING PROBLEM

H. I. Calvete, C. Galé, M. J. Oliveros

Abstract

This paper addresses the multi-depot vehicle routing problem. This problem involves designing a set of routes in order to deliver goods from several depots to a set of geographically dispersed customers. For solving this problem, we propose two different approaches. Both have in common the use of an Ant Colony Optimization algorithm to construct the routes from each depot. The approaches differ in the manner in which depots are dealt with in terms of how customers are assigned to depots. In the first method, called ACO-MDVRP, the customer assignment process is controlled by the ant colony by adding a super-depot which is connected with each depot by arcs with zero unit cost. The second method, called GA-MDVRP, is a hybrid algorithm in the sense that an Ant Colony Optimization algorithm is embedded in a genetic algorithm. In order to construct a feasible solution, the procedure uses a genetic algorithm to assign customers to depots. Then, under the given data on each depot, the corresponding vehicle routing problems are solved by using Ant Colony Optimization.

References

  1. Bräysy, O. and Gendreau, M. (2005). Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Science, 39(1):104-118.
  2. Calvete, H., Galé, C., and Oliveros, M. (2011). Bilevel model for production-distribution planning solved by using ant colony optimization. Computers and Operations Research, 38(1):320-327.
  3. Cordeau, J., Gendreau, M., and Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30:105-119.
  4. Crevier, B., Cordeau, J., and Laporte, G. (2007). The multidepot vehicle routing problem with inter-depot routes. European Journal of Operational Research, 176:756- 773.
  5. Dorigo, M. and Stützle, T. (2004). Ant Colony Optimization. MIT Press, Cambrigde, MA.
  6. Dorigo, M. and Stützle, T. (2010). Ant colony optimization: Overview and recent advances. In Gendreau, M. and Potvin, J., editors, Handbook of Metaheuristics, pages 227-263. Springer, 2 edition.
  7. Giosa, I., Tansini, I., and Viera, I. (2002). New assignment algorithms for the multi-depot vehicle routing problem. Journal of the Operational Research Society, 53(9):997-984.
  8. Holland, J. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI.
  9. Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43(4):408-416.
  10. Pisinger, D. and Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers and Operations Research, 34(8):2403-2435.
  11. Renaud, J., Laporte, G., and Boctor, F. (1996). A tabusearch heuristic for the multi-depot vehicle routing problem. Computers and Operations Research, 23(3):229-235.
  12. Tansini, L. and Viera, O. (2006). New measures of proximity for the assignment algorithms in the mdvrptw. Journal of the Operational Research Society, 57:241- 249.
  13. Yu, B., Yang, Z., and Xie, J. (2011). A parallel improved ant colony optimization for multi-depot vehicle routing problem. Journal of the Operational Research Society, 62(1):183-188.
Download


Paper Citation


in Harvard Style

I. Calvete H., Galé C. and J. Oliveros M. (2011). EVOLUTIVE AND ACO STRATEGIES FOR SOLVING THE MULTI-DEPOT VEHICLE ROUTING PROBLEM . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 73-79. DOI: 10.5220/0003673400730079


in Bibtex Style

@conference{ecta11,
author={H. I. Calvete and C. Galé and M. J. Oliveros},
title={EVOLUTIVE AND ACO STRATEGIES FOR SOLVING THE MULTI-DEPOT VEHICLE ROUTING PROBLEM},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)},
year={2011},
pages={73-79},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003673400730079},
isbn={978-989-8425-83-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)
TI - EVOLUTIVE AND ACO STRATEGIES FOR SOLVING THE MULTI-DEPOT VEHICLE ROUTING PROBLEM
SN - 978-989-8425-83-6
AU - I. Calvete H.
AU - Galé C.
AU - J. Oliveros M.
PY - 2011
SP - 73
EP - 79
DO - 10.5220/0003673400730079