Abstract
The Multi Depot Pickup and Delivery Problem with Time Windows and Heterogeneous Vehicle Fleets is a Rich Vehicle Routing Problem as it combines many real-world problems and is therefore relevant to practice. In this paper a new mathematical two-index model formulation for the MDPDPTWHV is developed as well as a Grouping Genetic Algorithm (GGA), which features a grouping-oriented individual representation. Therefore, each chromosome contains only the assignment of requests to vehicles, i.e., no information about the customer sequence is included. In order to compare different variants of the GGA to each other as well as the best one to solutions calculated by Cplex, 120 MDPDPTWHV datasets are created through a generator implemented by the authors. In a benchmark study, it can be shown that the way in which population management is performed is important to enhance the solution quality of the GGA. On average, the best GGA variant is 2.43% worse than the best known solution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alaia, E.B., et al.: Optimization of the multi-depot & multi-vehicle pickup and delivery problem with time windows using genetic algorithm. In: International Conference on Control, Decision and Information Technologies (CoDIT), Hammamet, Tunisia (2013)
Betriebswirtschaft und Operations Research Homepage. https://www.uni-hildesheim.de/fb4/institute/bwl/betriebswirtschaft-und-operations-research/. Accessed 7 Nov 2019
Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows. Math. Program. Comput. 6(2), 171–197 (2014). https://doi.org/10.1007/s12532-014-0064-0
Caracez-Cruz, J., et al.: Rich vehicle routing problem: survey. ACM Comput. Surv. (CSUR) 47(2), 1–28 (2015)
Schiller, T., et al.: Global Truck Study 2016. Deloitte, New York (2017)
Desaulniers, G., et al.: VRP with pickup and delivery. In: Toth, P., Vido, D. (eds.) The Vehicle Routing Problem, pp. 225–242. SIAM, Philadelphia (2002)
Dondo, R., Cerdà , J.: A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Oper. Res. 176, 1478–1507 (2007)
Elbert, R., Thiel, D., Reinhardt, D.: Delivery time windows for road freight carriers and forwarders—influence of delivery time windows on the costs of road transport services. In: Clausen, U., Friedrich, H., Thaller, C., Geiger, C. (eds.) Commercial Transport. LNL, pp. 255–274. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-21266-1_17
Eurotransport Homepage. https://www.eurotransport.de/artikel/standgeld-anerkannter-ausgleich-6543390.html. Accessed 26 Oct 2019
Falkenauer, E.: Genetic Algorithms and Grouping Problems, 1st edn. Wiley, New York (1998)
Frauenhofer SCS: FĂ¼hrende Logistikdienstleister im Bereich StĂ¼ckgut nach Umsatz in Deutschland im Jahr 2015. Deutsche Verkehrszeitung 82(9) (2017)
Eiben, A.E., Smith, J.E.: Evolutionary robotics. In: Eiben, A.E., Smith, J.E. (eds.) Introduction to Evolutionary Computing. NCS, pp. 245–258. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-44874-8_17
Gansterer, M., Hartl, R.F.: Collaborative vehicle routing: a survey. Eur. J. Oper. Res. 268(1), 1–12 (2018)
Goel, A., Gruhn, V.: Large Neighborhood Search for rich VRP with multiple pickup and delivery locations. In: Proceedings of the 18th Mini EURO Conference on VNS (2005)
Irnich, S.: A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. Eur. J. Oper. Res. 122, 310–328 (2000)
Lahyani, R., et al.: Rich vehicle routing problems: from a taxonomy to a definition. Eur. J. Oper. Res. 241, 1–14 (2015)
Li, Y., et al.: Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur. J. Oper. Res. 252, 27–38 (2016)
Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. Int. J. Artif. Intell. Tools 12(2), 160–167 (2001)
Pankratz, G.: A grouping genetic algorithm for the pickup and delivery problem with time windows. OR Spectr. 27(1), 21–41 (2005). https://doi.org/10.1007/s00291-004-0173-7
Razali, N.M., Geraghty, J.: Genetic algorithm performance with different selection strategies in solving TSP. In: 2011 Proceedings of the World Congress on Engineering, vol. II, pp. 1134–1139. Newswood Limited, London (2011)
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)
Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29(1), 17–29 (1995)
Schwemmer, M.: Top 100 der Logistik - MarktgrĂ¶ĂŸen, Marktsegment, MarktfĂ¼hrer. Frauenhofer IIS (2016)
SINTEF. https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/. Accessed 14 Nov 2019
Sombuntham, P., Kachitvichyanukul, V.: Multi-depot vehicle routing problem with pickup and delivery requests. AIP Conf. Proc. 1285, 71 (2010)
Syswerda, G.: A study of reproduction in generational and steady-state genetic algorithms. Found. Genet. Algorithms 1, 94–101 (1991)
Wen, M.: Rich vehicle routing problems and applications. Ph.D. thesis, DTU Management Engineering (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
RĂ¼ther, C., Rieck, J. (2020). A Grouping Genetic Algorithm for Multi Depot Pickup and Delivery Problems with Time Windows and Heterogeneous Vehicle Fleets. In: Paquete, L., Zarges, C. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2020. Lecture Notes in Computer Science(), vol 12102. Springer, Cham. https://doi.org/10.1007/978-3-030-43680-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-43680-3_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43679-7
Online ISBN: 978-3-030-43680-3
eBook Packages: Computer ScienceComputer Science (R0)