Advertisement

An Ant Colony System Algorithm to Solve Routing Problems Applied to the Delivery of Bottled Products

  • Laura Cruz Reyes
  • José F. Delgado Orta
  • Juan J. González Barbosa
  • José Torres Jimenez
  • Héctor J. Fraire Huacuja
  • Bárbara A. Arrañaga Cruz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4994)

Abstract

This work presents a methodology of solution for the well-known vehicle routing problem (VRP) based on an ant colony system heuristic algorithm (ACS), which is applied to optimize the delivery  process of RoSLoP (Routing-Scheduling-Loading Problem) identified in the company case of study. A first version of this algorithm models six variants of VRP and its solution satisfies the 100% of demands of the customers. The new version of the algorithm can solve 11 variants of VRP as a rich VRP. Experiments were carried out with real instances. The new algorithm shows a saving of two vehicles with regard to the first version, reducing the operation costs of the company. These results prove the viability of using heuristic methods and optimization techniques to develop new software applications.

Keywords

Optimization Routing-Scheduling-Loading Problem (RoSLoP) Vehicle Routing Problem (VRP) Ant Colony System (ACS) 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Toth, P., Vigo, D. (eds.): The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications. Philadelphia: Society for Industrial and Applied Mathematics (2001)Google Scholar
  2. 2.
    Cruz, L., et al.: A Distributed Metaheuristic for Solving a Real-World Scheduling-Routing-Loading Problem. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds.) ISPA 2007. LNCS, vol. 4742, pp. 68–77. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  4. 4.
    Jong, C., Kant, G., Vliet, A.V.: On Finding Minimal Route Duration in the Vehicle Routing Problem with Multiple Time Windows, tech. report, Dept. of Computer Science, Utrecht Univ. (1996)Google Scholar
  5. 5.
    Mingozzi, A.: An exact Algorithm for Period and Multi-Depot Vehicle Routing Problems. Department of Mathematics, University of Bologna, Bologna, Italy (2003)Google Scholar
  6. 6.
    Archetti, C., Mansini, R., Speranza, M.G.: The Vehicle Routing Problem with capacity 2 and 3, General Distances and Multiple Customer Visits. Operational Research in Land and Resources Manangement, p. 102 (2001)Google Scholar
  7. 7.
    Thangiah, S.: A Site Dependent Vehicle Routing Problem with Complex Road Constraints. Artificial Intelligence and Robotics Laboratory, Slippery Rock University, U.S.A (2003)Google Scholar
  8. 8.
    Dorronsoro, B.: The VRP Web. AUREN. Language and Computation Sciences of the University of Mlaga (2005), http://neo.lcc.uma.es/radi-aeb/WebVRP
  9. 9.
    Leonora, B.: Notes on Dynamic Vehicle Routing. Technical Report IDSIA-05-01. IDSIA - Istituto Dalle Molle di Studi sull’Intelligenza Artificiale, Switzerland (2000)Google Scholar
  10. 10.
    Blescha, J., Goetshalckx, M.: The Vehicle Routing Problem with Backhauls: Properties and Solution Algorithms. Techincal report MHRC-TR-88-13, Georgia Institute of Technology (1993)Google Scholar
  11. 11.
    Fleischmann, B.: The Vehicle routing problem with multiple use of vehicles. Working paper, Fachbereigh Wirtschaftswissenschaften, Universitt Hamburg (1990)Google Scholar
  12. 12.
    Taillard, E.: A Heuristic Column Generation Method For the Heterogeneous Fleet VRP. Istituto Dalle Moli di Studi sull Inteligenza Artificiale, Switzerland. CRI-96-03 (1996)Google Scholar
  13. 13.
    Cruz, R., et al.: DiPro: An Algorithm for the Packing in Product Transportation Problems with Multiple Loading and Routing Variants. In: Gelbukh, A., Kuri Morales, Á.F. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 1078–1088. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  14. 14.
    Pisinger, D., Ropke, S.: A General Heuristic for Vehicle Routing Problems, tech. report, Dept. of Computer Science, Univ. Copenhagen (2005)Google Scholar
  15. 15.
    Reimann, M., Doerner, K., Hartl, R.: Analyzing a Unified Ant System for the VRP and some of Its Variants. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 300–310. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  16. 16.
    OR/MS Today: Vehicle Routing Software Survey. United States. Institute for Operations Research and the Management Sciences (2006)Google Scholar
  17. 17.
    Dorigo, L., Gambardella, M.: Ant Colony System: A Cooperative Learning A-pproach to the Traveling Salesman Problem. In: Proc. IEEE Transactions on Evolutionary Computation, Belgica, vol. 1(1) (1997)Google Scholar
  18. 18.
    Bock, F.: An algorithm for solving traveling salesman and related network optimization problems. In: Fourteenth National Meeting of the Operational Research Society of America, St. Louis, MO, USA (1958)Google Scholar
  19. 19.
    Taillard, E., Badeau, P., Gendreu, M., Guertin, F., Potvin, J.Y.: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science 31, 170–186 (1997)zbMATHCrossRefGoogle Scholar
  20. 20.
    Croes, G.: A method for solving traveling salesman problems. Proc. Operations Research 5, 791–812 (1958)Google Scholar
  21. 21.
    Potvin, J., Rousseau, J.M.: An Exchange Heuristic for Routing Problems with Time Windows. Proc. Journal of the Operational Research Society 46, 1433–1446 (1995)zbMATHGoogle Scholar
  22. 22.
    Prosser, P., Shaw, P.: Study of Greedy Search with Multiple Improvement Heuristics for Vehicle Routing Problems, tech. report, University of Strathclyde, Glasgow, Scotland (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Laura Cruz Reyes
    • 1
  • José F. Delgado Orta
    • 1
  • Juan J. González Barbosa
    • 1
  • José Torres Jimenez
    • 1
  • Héctor J. Fraire Huacuja
    • 1
  • Bárbara A. Arrañaga Cruz
    • 1
  1. 1.Instituto Tecnológico de Ciudad MaderoMéxico

Personalised recommendations