Abstract
A multiobjective optimization problem called a vehicle routing problem with route balancing (VRPRB) is studied. VRPRB extends traditional VRPs by considering two objectives simultaneously. The first objective is the minimization of the total traveling cost and the second one tries to ensure the balance among multiple routes. Different from another commonly used balancing objective, namely, the minimization of the difference between the maximal and minimal route cost, the objective we introduce is the minimization of the maximal route cost. Such setting can effectively avoid the occurrence of distorted solutions. In order to find Pareto-optimal solutions of VRPRB, we develop a multiobjective memetic algorithm (MMA), which integrates a problem-specific local search procedure into a multiobjective evolutionary algorithm. The MMA is further enhanced by using parallel computations on GPU devices. A simple version and a revised version of GPU-based MMAs are proposed and implemented on the CUDA platform. All the algorithms are tested on the benchmark instances to demonstrate their efficacy and effectiveness. Furthermore, the performances of CPU-based and GPU-based algorithms are analyzed.
Similar content being viewed by others
References
Beasley JE (1983) Route firstcluster second methods for vehicle routing. Omega 11(4):403–408
Benaini A, Berrajaa A, Daoudi EM (2016) Solving the vehicle routing problem on gpu. In: Proceedings of the Mediterranean Conference on Information & Communication Technologies 2015. Springer, pp 239–248
Bräysy O, Gendreau M (2005) Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transplant Sci 39(1):104–118
Brodtkorb AR, Hagen TR, Schulz C, Hasle G (2013) Gpu computing in discrete optimization. part i: Introduction to the gpu. EURO J Trans Log 2(1-2):129–157
Coello CAC, Cortés NC (2005) Solving multiobjective optimization problems using an artificial immune system. Genet Program Evolvable Mach 6(2):163–190
Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley, New York
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6(2):182–197
Ermiṡ G, Ċatay B (2017) Accelerating local search algorithms for the travelling salesman problem through the effective use of gpu. Trans Res Procedia 22:409–418
Garcia-Najera A, Bullinaria JA (2009) Bi-objective optimization for the vehicle routing problem with time windows: Using route similarity to enhance performance. In: International Conference on Evolutionary Multi-Criterion Optimization. Springer, pp 275–289
Guide D (2017) Cuda c programming guide. NVIDIA June
Jason S, Edward K (2010) Cuda by example: an introduction to general-purpose gpu programming
Jozefowiez N, Semet F, Talbi EG (2009) An evolutionary algorithm for the vehicle routing problem with route balancing. Eur J Oper Res 195(3):761–769
Kritikos MN, Ioannou G (2010) The balanced cargo vehicle routing problem with time windows. Int J Prod Econ 123(1):42–51
Lacomme P, Prins C, Prodhon C, Ren L (2015) A multi-start split based path relinking (msspr) approach for the vehicle routing problem with route balancing. Eng Appl Artif Intel 38:237–251
Lee TR, Ueng JH (1999) A study of vehicle routing problems with load-balancing. Int J Phys Distrib Logist Manag 29(10):646–657
Mandal SK, Pacciarelli D, Lkketangen A, Hasle G (2015) A memetic nsga-ii for the bi-objective mixed capacitated general routing problem. J Heuristics 21(3):359–390
Melián-Batista B, De Santiago A, AngelBello F, Alvarez A (2014) A bi-objective vehicle routing problem with time windows: A real case in tenerife. Appl Soft Comput 17:140–152
Miller BL, Goldberg DE et al (1995) Genetic algorithms, tournament selection, and the effects of noise. Complex Syst 9(3):193–212
Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J Acm 7(4):326– 329
Moscato P et al (1989) On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech Concur Comput Program, C3P Rep 826:1989
Oyola J, Løkketangen A (2014) Grasp-asp: An algorithm for the cvrp with route balancing. J. Heuristics 20(4):361–382
Pacheco J, Caballero R, Laguna M, Molina J (2013) Bi-objective bus routing: an application to school buses in rural areas. Transp Sci 47(3):397–411
Rios E, Ochi LS, Boeres C, Coelho VN, Coelho IM, Farias R (2018) Exploring parallel multi-gpu local search strategies in a metaheuristic framework. J Parallel Distrib Comput 111:39–55
Schulz C (2013) Efficient local search on the gpuinvestigations on the vehicle routing problem. J Parallel Distrib Comput 73(1):14–31
Schulz C, Hasle G, Brodtkorb AR, Hagen TR (2013) Gpu computing in discrete optimization. part ii: Survey focused on routing problems. EURO J Transp Logist 2(1-2):159–186
Sun Y, Liang Y, Zhang Z, Wang J (2017) M-nsga-ii: A memetic algorithm for vehicle routing problem with route balancing. In: International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems. Springer, pp 61–71
Szymon J, Dominik Ż (2013) Solving multi-criteria vehicle routing problem by parallel tabu search on gpu. Procedia Comput Sci 18:2529–2532
Toth P, Vigo D (2002) The Vehicle Routing Problem. Discrete mathematics and applications. Society for Industrial and Applied Mathematics. https://books.google.com/books?id=ZzOGQgAACAAJ https://books.google.com/books?id=ZzOGQgAACAAJ
Van Luong T, Melab N, Talbi EG (2013) Gpu computing for parallel local search metaheuristic algorithms. IEEE Trans Comput 62(1):173–185
Wodecki M, BoŻejko W, Karpiṅski M, Pacut M Wyrzykowski R, Dongarra J, Karczewski K, Waṡniewski J (eds) (2014) Multi-gpu parallel memetic algorithm for capacitated vehicle routing problem. Springer Berlin Heidelberg, Berlin
Zhou W, Song T, He F, Liu X (2013) Multiobjective vehicle routing problem with route balance based on genetic algorithm Discrete Dynamics in Nature and Society
Zitzler E, Laumanns M, Thiele L et al (2001) Spea2: Improving the strength pareto evolutionary algorithm. In: Eurogen, vol 3242, pp 95–100
Acknowledgements
An earlier version of this paper has been presented at IEA/AIE 2017. The authors would like to thank the anonymous reviewers for their valuable comments. This work was supported by the National Science Foundation of China (No. 71601191, 61673403), Natural Science Foundation of Guangdong Province (No. 2016A030313264), the Opening Project of Guangdong High Performance Computing Society (No. 2017060109) and Guangzhou Science and Technology Project (No. 2016201604030034).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, Z., Sun, Y., Xie, H. et al. GMMA: GPU-based multiobjective memetic algorithms for vehicle routing problem with route balancing. Appl Intell 49, 63–78 (2019). https://doi.org/10.1007/s10489-018-1210-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-018-1210-6