Advertisement

Multiobjective memetic algorithm based on adaptive local search chains for vehicle routing problem with time windows

  • Kaikai Zhang
  • Yiqiao CaiEmail author
  • Shunkai Fu
  • Huizhen Zhang
Special Issue
  • 32 Downloads

Abstract

This paper presents a multiobjective memetic algorithm based on adaptive local search chains (MMA-ALSC) for vehicle routing problem with time window (VRPTW) which is an important research area in logistics. As shown in most previous studies, VRPTW is essentially a multiobjective optimization problem and can be solved effectively by the multiobjective algorithms with various local search operators. We have observed, however, that the promising solutions obtained during the process of evolution are not fully utilized to guide the search together with different local search operators. This will lead to the discontinuous and insufficient search in the regions showing promise. To alleviate this drawback, MMA-ALSC is proposed and characterized by combining a multi-directional local search strategy (MD-LS) with an enhanced local search chain technique (eLS-Chain). In MMA-ALSC, on the one hand, with MD-LS, different local search operators are designed to perform the search towards multiple directions with distinct problem-specific knowledge of multiobjective VRPTW (MOVRPTW). On the other hand, with eLS-Chain, the promising solutions obtained during the process of evolution are adaptively selected for the subsequent local search operators. In this way, MMA-ALSC can not only effectively explore the search space in multiple directions, but also fully exploit the promising solutions in a chain-based way. Experimental results on two suites of benchmark instances have demonstrated the competitive performance of MMA-ALSC when compared with other representative algorithms.

Keywords

Vehicle routing problem with time windows Multiobjective optimization Local search chains Multi-directional search strategy Combinatorial optimization 

Notes

Acknowledgements

This work was supported in part by the Natural Science Foundation of Fujian Province of China (2018J01091, 2017J01111, 2015J01258), the Promotion Program for Young and Middle-aged Teacher in Science and Technology Research of Huaqiao University (ZQN-PY410), the Opening Project of Guangdong Province Key Laboratory of Computational Science at the Sun Yat-Sen University, and the Postgraduate Scientific Research Innovation Ability Training Plan Funding Projects of Huaqiao University (17014083024).

References

  1. 1.
    Toth P, Vigo D (eds) (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, PhiladelphiazbMATHGoogle Scholar
  2. 2.
    Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345–358MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bräysy O, Gendreau M (2005) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp Sci 39(1):104–118CrossRefGoogle Scholar
  4. 4.
    Bräysy O, Gendreau M (2005) Vehicle routing problem with time windows, part II: metaheuristics. Transp Sci 39(1):119–139CrossRefGoogle Scholar
  5. 5.
    Dixit A, Mishra A, Shukla A (2019) Vehicle routing problem with time windows using meta-heuristic algorithms: a survey. In: Harmony search and nature inspired optimization algorithms. Springer, Singapore, pp 539–546Google Scholar
  6. 6.
    Kallehauge B, Larsen J, Madsen OBG et al (2005) Vehicle routing problem with time windows. Column generation. Springer, Boston, pp 67–98zbMATHGoogle Scholar
  7. 7.
    Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur J Oper Res 218(1):1–6MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Goel R, Maini R (2017) Vehicle routing problem and its solution methodologies: a survey. Int J Logist Syst Manag 28(4):419–435CrossRefGoogle Scholar
  9. 9.
    Liu R, Jiang Z, Fung RYK et al (2010) Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration. Comput Oper Res 37(5):950–959CrossRefzbMATHGoogle Scholar
  10. 10.
    Savitri H, Kurniawati DA (2018) Sweep algorithm and mixed integer linear program for vehicle routing problem with time windows. J Adv Manuf Syst 17(04):505–513CrossRefGoogle Scholar
  11. 11.
    Baniamerian A, Bashiri M, Tavakkoli-Moghaddam R (2019) Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking. Appl Soft Comput 75:441–460CrossRefGoogle Scholar
  12. 12.
    Marinakis Y, Marinaki M, Migdalas A (2019) A multi-adaptive particle swarm optimization for the vehicle routing problem with time windows. Inf Sci 481:311–329CrossRefGoogle Scholar
  13. 13.
    Gambardella LM, Taillard É, Agazzi G (1999) Macs-vrptw: a multiple colony system for vehicle routing problems with time windows. In: New ideas in optimization, pp 63–76Google Scholar
  14. 14.
    Yu B, Yang Z (2011) An ant colony optimization model: the period vehicle routing problem with time windows. Transp Res Part E Logist Transp Rev 47(2):166–181CrossRefGoogle Scholar
  15. 15.
    Zhou Y, Wang J (2015) A local search-based multiobjective optimization algorithm for multiobjective vehicle routing problem with time windows. IEEE Syst J 9(3):1100–1113CrossRefGoogle Scholar
  16. 16.
    Kilby P, Prosser P, Shaw P (1999) Guided local search for the vehicle routing problem with time windows. Meta-heuristics. Springer, Boston, pp 473–486zbMATHGoogle Scholar
  17. 17.
    Castro-Gutierrez J, Landa-Silva D, Pérez JM (2011) Nature of real-world multi-objective vehicle routing with evolutionary algorithms. In: 2011 IEEE international conference on systems, man, and cybernetics. IEEE, pp 257–264Google Scholar
  18. 18.
    Garcia-Najera A, Bullinaria JA (2011) An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput Oper Res 38(1):287–300MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Tan KC, Chew YH, Lee LH (2006) A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput Optim Appl 34(1):115–151MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Ghoseiri K, Ghannadpour SF (2010) Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl Soft Comput 10(4):1096–1107CrossRefGoogle Scholar
  21. 21.
    Ong YS, Lim MH, Chen X (2010) Memetic computation—past, present & future. IEEE Comput Intell Mag 5(2):24–31CrossRefGoogle Scholar
  22. 22.
    Brandão J (2018) Iterated local search algorithm with ejection chains for the open vehicle routing problem with time windows. Comput Ind Eng 120:146–159CrossRefGoogle Scholar
  23. 23.
    Caponio A, Cascella GL, Neri F et al (2007) A fast adaptive memetic algorithm for online and offline control design of PMSM drives. IEEE Trans Syst Man Cybern Part B (Cybern) 37(1):28–41CrossRefGoogle Scholar
  24. 24.
    Molina D, Lozano M, García-Martínez C et al (2010) Memetic algorithms for continuous optimisation based on local search chains. Evol Comput 18(1):27–63CrossRefGoogle Scholar
  25. 25.
    Chenghai G (2016) Multiobjective vehicle routing problems with backhauls and time windows: modelling, instances and algorithms. Master’s Thesis, Sun Yat-sen UniversityGoogle Scholar
  26. 26.
    Tarantilis CD, Anagnostopoulou AK, Repoussis PP (2013) Adaptive path relinking for vehicle routing and scheduling problems with product returns. Transp Sci 47(3):356–379CrossRefGoogle Scholar
  27. 27.
    Deb K, Mohan M, Mishra S (2005) Evaluating the ε-domination based multi-objective evolutionary algorithm for a quick computation of Pareto-optimal solutions. Evol Comput 13(4):501–525CrossRefGoogle Scholar
  28. 28.
    Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254–265MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731CrossRefGoogle Scholar
  30. 30.
    Zitzler E, Laumanns M, Thiele L (2002) SPEA2: Improving the strength Pareto evolutionary algorithm. In: Evolutionary methods for design, optimization and control with applications to industrial problems. CIMNE, Barcelona, pp 95–100Google Scholar
  31. 31.
    Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271CrossRefGoogle Scholar
  32. 32.
    García S, Fernández A, Luengo J et al (2009) A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability. Soft Comput 13(10):959–977CrossRefGoogle Scholar
  33. 33.
    Derrac J, García S, Molina D et al (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3–18CrossRefGoogle Scholar
  34. 34.
    Atat R, Liu L, Chen H et al (2017) Enabling cyber-physical communication in 5G cellular networks: challenges, spatial spectrum sensing, and cyber-security. IET Cyber Phys Syst Theory Appl 2(1):49–54Google Scholar
  35. 35.
    Atat R, Liu L, Wu J et al (2018) Big data meet cyber-physical systems: a panoramic survey. IEEE Access 6:73603–73636CrossRefGoogle Scholar
  36. 36.
    Wu J, Bisio I, Gniady C et al (2014) Context-aware networking and communications: part 1. IEEE Commun Mag 52(6):14–15CrossRefGoogle Scholar
  37. 37.
    Li G, Boukhatem L, Wu J (2017) Adaptive quality-of-service-based routing for vehicular ad hoc networks with ant colony optimization. IEEE Trans Veh Technol 66(4):3249–3264CrossRefGoogle Scholar
  38. 38.
    Chaudhary D, Bhushan K, Gupta B (2018) Survey on DDoS attacks and defense mechanisms in cloud and fog computing. Int J E-Serv Mobile Appl 10(3):61–83CrossRefGoogle Scholar
  39. 39.
    Ouf S, Nasr M (2015) Cloud computing: the future of big data management. Int J Cloud Appl Comput 5(2):53–61Google Scholar
  40. 40.
    Bhushan K, Gupta B (2018) A novel approach to defend multimedia flash crowd in cloud environment. Multimed Tools Appl 77(4):4609–4639CrossRefGoogle Scholar
  41. 41.
    Bagui S, Nguyen LT (2015) Database sharding: to provide fault tolerance and scalability of big data on the cloud. Int J Cloud Appl Comput 5(2):36–52Google Scholar
  42. 42.
    Wu J, Guo S, Huang H et al (2018) Information and communications technologies for sustainable development goals: state-of-the-art, needs and perspectives. IEEE Commun Surv Tutor 20(3):2389–2406CrossRefGoogle Scholar
  43. 43.
    Wu J, Guo S, Li J et al (2016) Big data meet green challenges: big data toward green applications. IEEE Syst J 10(3):888–900CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  • Kaikai Zhang
    • 1
  • Yiqiao Cai
    • 1
    Email author
  • Shunkai Fu
    • 1
  • Huizhen Zhang
    • 1
  1. 1.College of Computer Science and TechnologyHuaqiao UniversityXiamenChina

Personalised recommendations