Skip to main content
SpringerLink
Log in

An Evolutionary Discrete Firefly Algorithm with Novel Operators for Solving the Vehicle Routing Problem with Time Windows

  • Chapter
  • First Online:
Nature-Inspired Computation in Engineering

Part of the book series: Studies in Computational Intelligence ((SCI,volume 637))

Abstract

An evolutionary discrete version of the Firefly Algorithm (EDFA) is presented in this chapter for solving the well-known Vehicle Routing Problem with Time Windows (VRPTW). The contribution of this work is not only the adaptation of the EDFA to the VRPTW, but also with some novel route optimization operators. These operators incorporate the process of minimizing the number of routes for a solution in the search process where node selective extractions and subsequent reinsertion are performed. The new operators analyze all routes of the current solution and thus increase the diversification capacity of the search process (in contrast with the traditional node and arc exchange based operators). With the aim of proving that the proposed EDFA and operators are effective, some different versions of the EDFA are compared. The present work includes the experimentation with all the 56 instances of the well-known VRPTW set. In order to obtain rigorous and fair conclusions, two different statistical tests have been conducted.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.sintef.no/projectweb/top/vrptw/homberger-benchmark/.

References

  1. Soonpracha, K., Mungwattana, A., Manisri, T.: A re-constructed meta-heuristic algorithm for robust fleet size and mix vehicle routing problem with time windows under uncertain demands. In: Proceedings of the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems, pp. 347–361, Springer (2015)

    Google Scholar 

  2. Wen, Z., Dong, X., Han, S.: An iterated local search for the split delivery vehicle routing problem. In: International Conference on Computer Information Systems and Industrial Applications, Atlantis Press (2015)

    Google Scholar 

  3. Escobar, J.W., Linfati, R., Toth, P., Baldoquin, M.G.: A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. J. Heuristics 20(5), 483–509 (2014)

    Article  Google Scholar 

  4. Lin, C., Choy, K.L., Ho, G.T., Chung, S., Lam, H.: Survey of green vehicle routing problem: past and future trends. Expert Syst. Appl. 41(4), 1118–1138 (2014)

    Article  Google Scholar 

  5. Reed, M., Yiannakou, A., Evering, R.: An ant colony algorithm for the multi-compartment vehicle routing problem. Appl. Soft Comput. 15, 169–176 (2014)

    Article  Google Scholar 

  6. Coelho, L.C., Renaud, J., Laporte, G.: Road-based goods transportation: a survey of real-world applications from 2000 to 2015. Technical report, Technical Report FSA-2015-007, Québec, Canada (2015)

    Google Scholar 

  7. Toth, P., Vigo, D.: The vehicle routing problem. Soc. Ind. Appl. Math. (2015)

    Google Scholar 

  8. Laporte, G., Ropke, S., Vidal, T.: Heuristics for the vehicle routing problem. Veh. Routing Prob. Methods Appl. 18, 87 (2014)

    Article  Google Scholar 

  9. Lenstra, J.K., Kan, A.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221–227 (1981)

    Article  Google Scholar 

  10. Lawler, E.L.: The traveling salesman problem: a guided tour of combinatorial optimization. Wiley-interscience series in discrete mathematics (1985)

    Google Scholar 

  11. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80–91 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  12. Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231–247 (1992)

    Article  MATH  Google Scholar 

  13. Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345–358 (1992)

    Article  MATH  Google Scholar 

  14. Glover, F.: Tabu search, part i. ORSA J. Comput. 1(3), 190–206 (1989)

    Article  MATH  Google Scholar 

  15. Kirkpatrick, S., Gellat, C., Vecchi, M.: Optimization by simmulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  16. Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theoret. Comput. Sci. 344(2), 243–278 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Goldberg, D.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Professional (1989)

    Google Scholar 

  18. De Jong, K.: Analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan, Michigan, USA (1975)

    Google Scholar 

  19. Kennedy, J., Eberhart, R., et al.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, Perth, Australia (1995)

    Google Scholar 

  20. Rodriguez, A., Gutierrez, A., Rivera, L., Ramirez, L.: Rwa: Comparison of genetic algorithms and simulated annealing in dynamic traffic. In: Advanced Computer and Communication Engineering Technology, pp. 3–14, Springer (2015)

    Google Scholar 

  21. Cao, B., Glover, F., Rego, C.: A tabu search algorithm for cohesive clustering problems. J. Heuristics 1–21 (2015)

    Google Scholar 

  22. İnkaya, T., Kayalıgil, S., Özdemirel, N.E.: Ant colony optimization based clustering methodology. Appl. Soft Comput. 28, 301–311 (2015)

    Article  Google Scholar 

  23. Geem, Z.W., Kim, J.H., Loganathan, G.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)

    Article  Google Scholar 

  24. Yang, X.S., Deb, S.: Cuckoo search via lévy flights. In: IEEE World Congress on Nature & Biologically Inspired Computing, pp. 210–214 (2009)

    Google Scholar 

  25. Yang, X.S., Deb, S.: Engineering optimisation by cuckoo search. Int. J. Math. Model. Numer. Optim. 1(4), 330–343 (2010)

    MATH  Google Scholar 

  26. Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: Gsa: a gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009)

    Article  MATH  Google Scholar 

  27. Yang, X.S.: Nature-inspired metaheuristic algorithms. Luniver press, Bristol (2008)

    Google Scholar 

  28. Fister, I., Yang, X.S., Fister, D., Fister Jr, I.: Firefly algorithm: a brief review of the expanding literature. In: Cuckoo Search and Firefly Algorithm, pp. 347–360, Springer (2014)

    Google Scholar 

  29. Fister, I., Fister Jr, I., Yang, X.S., Brest, J.: A comprehensive review of firefly algorithms. Swarm Evol. Comput. (2013)

    Google Scholar 

  30. Ma, Y., Zhao, Y., Wu, L., He, Y., Yang, X.S.: Navigability analysis of magnetic map with projecting pursuit-based selection method by using firefly algorithm. Neurocomputing (2015)

    Google Scholar 

  31. Liang, R.H., Wang, J.C., Chen, Y.T., Tseng, W.T.: An enhanced firefly algorithm to multi-objective optimal active/reactive power dispatch with uncertainties consideration. Int. J. Electr. Power Energy Syst. 64, 1088–1097 (2015)

    Article  Google Scholar 

  32. Zouache, D., Nouioua, F., Moussaoui, A.: Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems. Soft Comput. 1–19 (2015)

    Google Scholar 

  33. Yang, X.S.: Metaheuristic optimization: algorithm analysis and open problems. In: Experimental Algorithms, pp. 21–32, Springer (2011)

    Google Scholar 

  34. Yang, X.S.: Efficiency analysis of swarm intelligence and randomization techniques. J. Comput. Theoret. Nanosci. 9(2), 189–198 (2012)

    Article  Google Scholar 

  35. Das, S., Maity, S., Qu, B.Y., Suganthan, P.N.: Real-parameter evolutionary multimodal optimizationa survey of the state-of-the-art. Swarm Evol. Comput. 1(2), 71–88 (2011)

    Article  Google Scholar 

  36. Yang, X.S.: Firefly algorithms for multimodal optimization. In: Stochastic algorithms: foundations and applications, pp. 169–178, Springer (2009)

    Google Scholar 

  37. Sayadi, M., Ramezanian, R., Ghaffari-Nasab, N.: A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. Int. J. Ind. Eng. Comput. 1(1), 1–10 (2010)

    Google Scholar 

  38. Abedinia, O., Amjady, N., Naderi, M.S.: Multi-objective environmental/economic dispatch using firefly technique. In: IEEE International Conference on Environment and Electrical Engineering, pp. 461–466 (2012)

    Google Scholar 

  39. Zhang, Y., Wu, L.: A novel method for rigid image registration based on firefly algorithm. Int. J. Res. Rev. Soft Intell. Comput. (IJRRSIC) 2(2), 141–146 (2012)

    Google Scholar 

  40. Basu, B., Mahanti, G.K.: Fire fly and artificial bees colony algorithm for synthesis of scanned and broadside linear array antenna. Prog. Electromagnet. Res. B 32, 169–190 (2011)

    Article  Google Scholar 

  41. Talatahari, S., Gandomi, A.H., Yun, G.J.: Optimum design of tower structures using firefly algorithm. Struct. Des. Tall Spec. Buildings 23(5), 350–361 (2014)

    Article  Google Scholar 

  42. Jakimovski, B., Meyer, B., Maehle, E.: Firefly flashing synchronization as inspiration for self-synchronization of walking robot gait patterns using a decentralized robot control architecture. In: Architecture of Computing Systems-ARCS 2010, pp. 61–72, Springer (2010)

    Google Scholar 

  43. Pop, C.B., Rozina Chifu, V., Salomie, I., Baico, R.B., Dinsoreanu, M., Copil, G.: A hybrid firefly-inspired approach for optimal semantic web service composition. Scalable Comput. Pract. Exp. 12(3), 363–370 (2011)

    Google Scholar 

  44. Fateen, S.E.K., Bonilla-Petriciolet, A., Rangaiah, G.P.: Evaluation of covariance matrix adaptation evolution strategy, shuffled complex evolution and firefly algorithms for phase stability, phase equilibrium and chemical equilibrium problems. Chem. Eng. Res. Des. 90(12), 2051–2071 (2012)

    Article  Google Scholar 

  45. Santos, A.F., Campos Velho, H.F., Luz, E.F., Freitas, S.R., Grell, G., Gan, M.A.: Firefly optimization to determine the precipitation field on south america. Inverse Prob. Sci. Eng. 21(3), 451–466 (2013)

    Google Scholar 

  46. Tilahun, S.L., Ong, H.C.: Modified firefly algorithm. J. Appl. Math. 2012, 1–12 (2012)

    Google Scholar 

  47. Gandomi, A., Yang, X.S., Talatahari, S., Alavi, A.: Firefly algorithm with chaos. Commun. Nonlinear Sci. Numer. Simul. 18(1), 89–98 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  48. Coelho, L.D.S., de Andrade Bernert, D.L., Mariani, V.C.: A chaotic firefly algorithm applied to reliability-redundancy optimization. In: IEEE Congress on Evolutionary Computation, IEEE, pp. 517–521 (2011)

    Google Scholar 

  49. Subutic, M., Tuba, M., Stanarevic, N.: Parallelization of the firefly algorithm for unconstrained optimization problems. Latest Adv. Inf. Sci. Appl. 22, 264–269 (2012)

    Google Scholar 

  50. Husselmann, A.V., Hawick, K.: Parallel parametric optimisation with firefly algorithms on graphical processing units. In: Proceedings International Conference on Genetic and Evolutionary Methods, pp. 77–83 (2012)

    Google Scholar 

  51. Farahani, S.M., Abshouri, A.A., Nasiri, B., Meybodi, M.: Some hybrid models to improve firefly algorithm performance. Int. J. Artif. Intell. 8(S12), 97–117 (2012)

    Google Scholar 

  52. Luthra, J., Pal, S.K.: A hybrid firefly algorithm using genetic operators for the cryptanalysis of a monoalphabetic substitution cipher. In: IEEE World Congress on Information and Communication Technologies, pp. 202–206 (2011)

    Google Scholar 

  53. Aruchamy, R., Vasantha, K.: A comparative performance study on hybrid swarm model for micro array data. Int. J. Comput. Appl. 30(6), 10–14 (2011)

    Google Scholar 

  54. Hassanzadeh, T., Faez, K., Seyfi, G.: A speech recognition system based on structure equivalent fuzzy neural network trained by firefly algorithm. In: IEEE International Conference on Biomedical Engineering, pp. 63–67 (2012)

    Google Scholar 

  55. Durkota, K.: Implementation of a discrete firefly algorithm for the qap problem within the sage framework. BSc thesis, Czech Technical University (2011)

    Google Scholar 

  56. Marichelvam, M.K., Prabaharan, T., Yang, X.S.: A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems. EEE Trans. Evol. Comput. 18(2), 301–305 (2014)

    Article  Google Scholar 

  57. Jati, G.K., et al.: Evolutionary discrete firefly algorithm for travelling salesman problem. In: Adaptive and Intelligent Systems (2011)

    Google Scholar 

  58. Zhou, L., Ding, L., Qiang, X.: A multi-population discrete firefly algorithm to solve tsp. In: Bio-Inspired Computing-Theories and Applications, pp. 648–653, Springer (2014)

    Google Scholar 

  59. Desaulniers, G., Errico, F., Irnich, S., Schneider, M.: Exact algorithms for electric vehicle-routing problems with time windows. Les Cahiers du GERAD G-2014-110, GERAD, Montréal, Canada (2014)

    Google Scholar 

  60. Belhaiza, S., Hansen, P., Laporte, G.: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput. Oper. Res. 52, 269–281 (2014)

    Article  Google Scholar 

  61. Toklu, N.E., Gambardella, L.M., Montemanni, R.: A multiple ant colony system for a vehicle routing problem with time windows and uncertain travel times. J. Traffic Logist. Eng. 2(1), 5–8 (2014)

    Google Scholar 

  62. Nguyen, P.K., Crainic, T.G., Toulouse, M.: A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows. J. Heuristics 20(4), 383–416 (2014)

    Article  Google Scholar 

  63. Kallehauge, B., Larsen, J., Madsen, O.B., Solomon, M.M.: Vehicle Routing Problem with Time Windows. Springer, New York (2005)

    Google Scholar 

  64. Gendreau, M., Tarantilis, C.D.: Solving large-scale vehicle routing problems with time windows: The state-of-the-art, Cirrelt (2010)

    Google Scholar 

  65. Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows part ii: genetic search. INFORMS J. Comput. 8(2), 165–172 (1996)

    Article  MATH  Google Scholar 

  66. Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part i: route construction and local search algorithms. Transp. Sci. 39(1), 104–118 (2005)

    Article  Google Scholar 

  67. Afifi, S., Guibadj, R.N., Moukrim, A.: New lower bounds on the number of vehicles for the vehicle routing problem with time windows. In: Integration of AI and OR Techniques in Constraint Programming, pp. 422–437, Springer (2014)

    Google Scholar 

  68. Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L.M., Poss, M., Requejo, C.: The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3), 856–866 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  69. Azi, N., Gendreau, M., Potvin, J.Y.: An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur. J. Oper. Res. 178(3), 755–766 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  70. Bräysy, O., Gendreau, M.: Tabu search heuristics for the vehicle routing problem with time windows. Top 10(2), 211–237 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  71. Cordeau, J.F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: Vrp with time windows. Veh. Routing Prob. 9, 157–193 (2001)

    MathSciNet  MATH  Google Scholar 

  72. Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp. Sci. 39(1), 104–118 (2005)

    Article  Google Scholar 

  73. Rego, C.: Node-ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Comput. 27(3), 201–222 (2001)

    Article  MATH  Google Scholar 

  74. Nagata, Y., Brysy, O.: A powerful route minimization heuristic for the vehicle routing problem with time windows. Oper. Res. Lett. 37(5), 333–338 (2009)

    Google Scholar 

  75. Irnich, S.: A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS J. Comput. 20(2), 270–287 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  76. Campbell, A.M., Savelsbergh, M.: Efficient insertion Heuristics for vehicle routing and scheduling problems. Transp. Sci. 38(3), 369–378 (2004)

    Article  Google Scholar 

  77. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  78. Derrac, J., García, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3–18 (2011)

    Article  Google Scholar 

  79. Osaba, E., Diaz, F., Onieva, E.: Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts. Appl. Intell. 41(1), 145–166 (2014)

    Article  Google Scholar 

Download references

Acknowledgments

This project was supported by the European Unions Horizon 2020 research and innovation programme through the TIMON: Enhanced real time services for optimized multimodal mobility relying on cooperative networks and open data project (636220); as well as by the projects TEC2013-45585-C2-2-R from the Spanish Ministry of Economy and Competitiveness, and PC2013-71A from the Basque Government.

Author information

Authors and Affiliations

  1. Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, 48007, Bilbao, Spain

    Eneko Osaba, Roberto Carballedo & Fernando Diaz

  2. School of Science and Technology, Middlesex University, Hendon Campus, London, NW4 4BT, UK

    Xin-She Yang

Authors
  1. Eneko Osaba
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roberto Carballedo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xin-She Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fernando Diaz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eneko Osaba .

Editor information

Editors and Affiliations

  1. School of Science and Technology, Middlesex University, London, United Kingdom

    Xin-She Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Osaba, E., Carballedo, R., Yang, XS., Diaz, F. (2016). An Evolutionary Discrete Firefly Algorithm with Novel Operators for Solving the Vehicle Routing Problem with Time Windows. In: Yang, XS. (eds) Nature-Inspired Computation in Engineering. Studies in Computational Intelligence, vol 637. Springer, Cham. https://doi.org/10.1007/978-3-319-30235-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30235-5_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30233-1

  • Online ISBN: 978-3-319-30235-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation