Use of Ant Colony System in Solving Vehicle Routing Problem with Time Window Constraints

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 236)

Abstract

Vehicle routing problem with time window constraints (VRPTW) is an extension of the original vehicle routing problem (VRP). It is a well-known NP-hard problem which has several real-life applications. Meta-heuristics have been often tried to solve VRTPW problem. In this paper, an attempt has been made to develop a suitable version of Ant colony optimization heuristic to efficiently solve VRPTW problem. Experimentation with the developed version of Ant colony optimization has shown that it succeeds in general in obtaining results obtained with earlier version and often even better than the results that are better than the corresponding results available in literature which have been obtained using even previously developed hybridized versions of ACO. In many cases, the obtained results are comparable with the best results available in literature.

Keywords

Vehicle routing problem Ant colony optimization Heuristics  Optimization 

References

  1. 1.
    Andres, F.M.: An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transp. Res. Part B 43, 438–447 (2010)Google Scholar
  2. 2.
    Azi, N., Gendreau, M., Potvin, J.Y.: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3), 756–763 (2010)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Balseiro, S.R., Loiseau, I., Ramone, J.: An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows. Comput. Oper. Res. 38, 954–966 (2011)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Bell, J.E., McMullen, P.R.: Ant colony optimization techniques for the vehicle routing problem. Adv. Eng. Inform. 18, 41–48 (2004)CrossRefGoogle Scholar
  5. 5.
    Best solutions to Solomon problems identified by heuristics. (SINTEF VRP page): http://www.sintef.no/static/am/opti/projects/top/vrp/bknown.html
  6. 6.
    Bianchessi, N., Righini, G.: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput. Oper. Res. 34, 578–594 (2007)CrossRefMATHGoogle Scholar
  7. 7.
    Bräysy, O.: Local search and variable neighborhood search algorithms for the vehicle routing problem with time windows. University of Vaasa, Finland, Doctoral Dissertation (2001)Google Scholar
  8. 8.
    Chabrier, A.: Vehicle routing problem with elementary shortest path based column generation. Comput. Oper. Res. 33(10), 2972–2990 (2006)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Chen, C.-H., et al.: A hybrid ant colony system for vehicle routing problem with time windows. J. East. Asia Soc. Transp. Stud. 6, 2822–2836 (2005)Google Scholar
  10. 10.
    Cook, W., Rich, J.L.: A parallel cutting plane algorithm for the vehicle routing problem with time windows. Working Paper of Computational and Applied Mathematics, Rice University, Houston, TX (1999)Google Scholar
  11. 11.
    Donati, A.V., et al.: Time dependent vehicle routing problem. Eur. J. Oper. Res. (2006). doi: 10.1016/j.ejor.06.047 Google Scholar
  12. 12.
    Dorigo, M., Birattari, M., Stützle, T.: Ant colony optimization: Artificial ants as a computational intelligence technique. IEEE Comput. Intell. Mag. 1, 28–39 (2006)CrossRefGoogle Scholar
  13. 13.
    Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theor. Comput. Sci. 334, 243–278 (2005)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1, 53–66 (1997)CrossRefGoogle Scholar
  15. 15.
    Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B. Cybern. 26, 29–41 (1996)CrossRefGoogle Scholar
  16. 16.
    Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows New Ideas in Optimization. McGraw-Hill, London (1999)Google Scholar
  17. 17.
    Garcia-Najera, A., Bullinaria, J.A.: An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 38(1), 287–300 (2011)CrossRefMATHMathSciNetGoogle Scholar
  18. 18.
    Irnich, S., Villeneuv, D.: The shortest path problem with k-cycle elimination (k \(>\) 3): Improving a branch-and-price algorithm for the VRPTW INFORMS. J. Comput. 18(3), 391–406 (2003)Google Scholar
  19. 19.
    Kallehauge, B., Larsen, J., Madsen, O.B.G.: Lagrangean duality and non-differentiable optimization applied on routing with time windows. Comput. Oper. Res. 33(5), 1464–1487 (2006)CrossRefMATHMathSciNetGoogle Scholar
  20. 20.
    Kohl, N., Desrosiers, J., Madsen, O.B.G., Solomon, M.M., Soumis, F.: 2-path cuts for the vehicle routing problem with time windows. Transp. Sci. 33(1), 101–116 (1999)CrossRefMATHGoogle Scholar
  21. 21.
    Laporate, G.: The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 345–358 (1997)CrossRefGoogle Scholar
  22. 22.
    Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43, 408–416 (2011)CrossRefGoogle Scholar
  23. 23.
    Larsen J.: Parallelization of the vehicle routing problem with time windows. Ph.D. thesis IMM-PHD-1999-62, Department of Mathematical Modelling, Technical University of Enmark, Lyngby, Denmark (1999)Google Scholar
  24. 24.
    Lau, H.C., et al.: Vehicle routing problem with time windows and a limited number of vehicles. Eur. J. Oper. Res. 148, 559–569 (2003)CrossRefMATHGoogle Scholar
  25. 25.
    Ma, X.: Vehicle routing problem with time windows based on improved ant colony algorithm. In Proceedings of IEEE Computer Society Second International Conference on Information Technology and Computer Science, Washington, DC, USA, pp. 94–97 (2010)Google Scholar
  26. 26.
    Masrom, S., Nasir, A.M., Abidin, S.Z., Rahman, A.S.A.: Software framework for vehicle routing problem with hybrid metaheuristic algorithms. In Proceedings of the Applied Computing Conference, Angers, pp. 55–61 (2011)Google Scholar
  27. 27.
    Mester, D.: An evolutionary strategies algorithm for large scale vehicle routing problem with capacitate and time windows restrictions. In Proceedings of the Conference on Mathematical and Population Genetics, University of Haifa, Israel (2002)Google Scholar
  28. 28.
    Qi, C., Sun, Y.: An improved ant colony algorithm for VRPTW. In IEEE International Conference on Computer Science and, Software Engineering (2008)Google Scholar
  29. 29.
    Rizzoli, A.E., Montemanni, R., Lucibello, E., Gambardella, L.M.: Ant colony optimization for real-world vehicle routing problems. Swarm Intell 1(2), 135–151 (2007)CrossRefGoogle Scholar
  30. 30.
    Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147–167 (1995)CrossRefMATHGoogle Scholar
  31. 31.
    Solomon, M.M.: Algorithms for vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254–265 (1987)CrossRefMATHMathSciNetGoogle Scholar
  32. 32.
    Yu, B., Yang, Z.Z., Yao, B.: An improved ant colony optimization for vehicle routing problem. Eur. J. Oper. Res. 196, 171–176 (2009)CrossRefMATHGoogle Scholar
  33. 33.
    Yuichi, N., Olli, B.: A powerful route minimization heuristic for the vehicle routing problem with time windows. Oper. Res. Lett. 37, 333–338 (2009)CrossRefMATHMathSciNetGoogle Scholar
  34. 34.
    Zhang, X., Tang, L.: A new hybrid ant colony optimization algorithm for the vehicle routing problem. Pattern Recogn. Lett. 30, 848–855 (2009)CrossRefGoogle Scholar

Copyright information

© Springer India 2014

Authors and Affiliations

  1. 1.Maharishi Markandeswar UniversityMullanaIndia
  2. 2.Ambala College of Engineering and Applied ResearchAmbalaIndia

Personalised recommendations