Abstract
Most research about the vehicle routing problem (VRP) does not collectively address many of the constraints that real-world transportation companies have regarding route assignments. Consequently, our primary objective is to explore solutions for real-world VRPs with a heterogeneous fleet of vehicles, multi-depot subcontractors (drivers), and pickup/delivery time window and location constraints. We use a nested bi-criteria genetic algorithm (GA) to minimize the total time to complete all jobs with the fewest number of route drivers. Our model will explore the issue of weighting the objectives (total time vs. number of drivers) and provide Pareto front solutions that can be used to make decisions on a case-by-case basis. Three different real-world data sets were used to compare the results of our GA vs. transportation field experts’ job assignments. For the three data sets, all 21 Pareto efficient solutions yielded improved overall job completion times. In 57 % (12/21) of the cases, the Pareto efficient solutions also utilized fewer drivers than the field experts’ job allocation strategies.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Abounacer R, Rekik M, Renaud J (2012) An exact solution approach for multi-objective location transportation problem for disaster response. CIRRELT 26:1–32
Aneja YP, Nair PK (1979) Bicriteria transportation problem. Manag Sci 25(1):73–78
Baldacci R, Mingozzi A (2009) A unified exact method for solving different classes of vehicle routing problems. Math Program 120(2):347–380
Baldacci R, Bartolini E, Mingozzi A (2011) An exact algorithm for the pickup and delivery problem with time windows. Oper Res 59(2):414–426
Banos R, Ortega J, Gil C, Fernandez A, De Toro F (2013) A simulated annealing-based parallel multi-objective approach to vehicle routing problems with time windows. Expert Syst Appl 40(5):1696–1707
Brandao J (2011) A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Comput Oper Res 38(1):140–151
Chen W, Song J, Shi L, Pi L, Sun P (2012) Data mining-based dispatching system for solving the local pickup and delivery problem. Ann Oper Res 203(1):351–370
Choi E, Tcha D (2007) A column generation approach to the heterogeneous fleet vehicle routing problem. Comput Oper Res 34(7):2080–2095
Coello CA, van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer Academic Publishers, Dordrecht
Cordeau JF, Maichberger M (2011) A parallel iterated tabu search heuristic for vehicle routing problems. Tech rep, CIRRELT
Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80–91
Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur J Oper Res 54(1):7–22
Evans JP, Steuer RP (1973) A revised simplex method for multiple objective programs. Math Program 5:54–72
Gal T (1975) Rim multiparametric linear programming. Manag Sci 21:567–575
Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor
Konak A, Coit D, Smith A (2006) Multi-objective optimization using genetic algorithms: a tutorial. Reliab Eng Syst Saf 91:992–1007
Lau H, Chan T, Tsui W, Pang W (2010) Application of genetic algorithms to solve the multidepot vehicle routing problem. IEEE Trans Autom Sci Eng 7(2):383–392
Lightner-Laws C, Agrawal V, Lightner C, Wagner N (2016) An evolutionary algorithm approach for the constrained multi-depot vehicle routing problem. Int J Intell Comput Cybern 9(1):2–22
Likaj R, Shala A, Bruqi M (2013) Application of graph theory to find optimal paths for the transportation problem. Int J Curr Eng Technol 3(3):1099–1103
Michalewicz Z (1995) A Survey of constraint handling techniques in evolutionary computation methods. In: Proceedings of the 4th annual conference on evolutionary programming. MIT Press, Cambridge, pp 135–155. https://cs.adelaide.edu.au/~zbyszek/Papers/p17.pdf
Miettinen KM (1999) Nonlinear multiobjective optimization. Kluwer Academic Publishers, Dordrecht
Muller J (2010) Approximative solutions to the bicriterion vehicle routing problem with time windows. Eur J Oper Res 202(1):223–231
Ombuki-Berman B, Hanshar T (2009) Using genetic algorithms for multi-depot vehicle routing. In: Pereira AMS, Tavares J (eds) Bio-inspired algorithms for the vehicle routing problem, pp 77–99
Pisinger D, Ropke S (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455–472
Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34:2403–2435
Potvin JY, Rousseau JM (1995) An exchange heuristic for routing problems with time windows. J Oper Res Soc 46:1433–1466
Prakash S, Saluja RK, Singh P (2014) Pareto optimal solutions to the cost-time trade-off bulk transportation problem through a newly evolved efficacious novel algorithm. J Data Inf Process 2(2):13–25
Ropke S, Cordeau JF, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problem with time windows. Networks 49(4):258–272
Ropke S, Cordeau JF (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transp Sci 43(3):267–286
Solomon M (1987) Algorithms for vehicle routing and scheduling problem with time window constraints. Oper Res 35(2):254–265
Tan TC, Chew YH, Lee LH (2006) A hybrid multi-objective evolutionary algorithm for solving vehicle routing problem with time windows. Comput Optim Appl 34:115–151
Vidal T, Crainic T, Gendreau M, Lahrichi N, Rei W (2011a) A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems. Oper Res 60(3):611–624
Vidal T, Crainic T, Gendreau M, Prins C (2011b) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows. Tech Rep 61:CIRRELT
Yu PL, Zeleny M (1974) The techniques of linear multiobjective programming. Revue Francoise d’Automatique, Informatique et Recherche Operationnelle 3:51–71
Zeleny M (1974) Linear multiobjective programming. Springer, New York
Zou S, Li J, Li X (2013) A hybrid particle swarm optimization algorithm for multi-objective pickup and delivery problem with time windows. J Comput 8(10):2585–2589
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Agrawal, V., Lightner, C., Lightner-Laws, C. et al. A bi-criteria evolutionary algorithm for a constrained multi-depot vehicle routing problem. Soft Comput 21, 5159–5178 (2017). https://doi.org/10.1007/s00500-016-2112-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-016-2112-3