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.
Vehicle routing problem Bi-criteria genetic algorithm Pareto front Multi-depot transportation problem Hard and soft time windows
This is a preview of subscription content, log in to check access.
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
Abounacer R, Rekik M, Renaud J (2012) An exact solution approach for multi-objective location transportation problem for disaster response. CIRRELT 26:1–32MATHGoogle Scholar
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–1707CrossRefGoogle Scholar
Gal T (1975) Rim multiparametric linear programming. Manag Sci 21:567–575Google Scholar
Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann ArborGoogle Scholar
Konak A, Coit D, Smith A (2006) Multi-objective optimization using genetic algorithms: a tutorial. Reliab Eng Syst Saf 91:992–1007CrossRefGoogle Scholar
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–392CrossRefGoogle Scholar
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–22Google Scholar
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–1103Google Scholar
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
Potvin JY, Rousseau JM (1995) An exchange heuristic for routing problems with time windows. J Oper Res Soc 46:1433–1466MATHCrossRefGoogle Scholar
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–25Google Scholar
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–272MathSciNetMATHCrossRefGoogle Scholar
Ropke S, Cordeau JF (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transp Sci 43(3):267–286CrossRefGoogle Scholar
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–151MathSciNetMATHCrossRefGoogle Scholar
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–624MATHCrossRefGoogle Scholar
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:CIRRELTGoogle Scholar
Yu PL, Zeleny M (1974) The techniques of linear multiobjective programming. Revue Francoise d’Automatique, Informatique et Recherche Operationnelle 3:51–71MathSciNetMATHGoogle Scholar