research-article

A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows

Authors:

Teodor Gabriel Crainic,

Michel Gendreau,

Christian PrinsAuthors Info & Claims

Computers and Operations Research, Volume 40, Issue 1

Pages 475 - 489

https://doi.org/10.1016/j.cor.2012.07.018

Published: 01 January 2013 Publication History

Abstract

The paper presents an efficient Hybrid Genetic Search with Advanced Diversity Control for a large class of time-constrained vehicle routing problems, introducing several new features to manage the temporal dimension. New move evaluation techniques are proposed, accounting for penalized infeasible solutions with respect to time-window and duration constraints, and allowing to evaluate moves from any classical neighbourhood based on arc or node exchanges in amortized constant time. Furthermore, geometric and structural problem decompositions are developed to address efficiently large problems. The proposed algorithm outperforms all current state-of-the-art approaches on classical literature benchmark instances for any combination of periodic, multi-depot, site-dependent, and duration-constrained vehicle routing problem with time windows.

References

[1]

. In: Golden, B., Raghavan, S., Wasil, E. (Eds.), The vehicle routing problem: latest advances and new challenges, Springer, New York.

[2]

Bräysy, O. and Gendreau, M., Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transportation Science. v39 i1. 104-118.

Digital Library

[3]

Bräysy, O. and Gendreau, M., Vehicle routing problem with time windows, part II: metaheuristics. Transportation Science. v39 i1. 119-139.

Digital Library

[4]

Francis, P., Smilowitz, K. and Tzur, M., The period vehicle routing problem and its extensions. In: Golden, B., Raghavan, S., Wasil, E. (Eds.), The vehicle routing problem: latest advances and new challenges, Springer. pp. 73-102.

[5]

Gendreau, M., Potvin, J.-Y., Bräysy, O., Hasle, G. and Løkketangen, A., Metaheuristics for the vehicle routing problem and its extensions: a categorized bibliography. In: Golden, B., Raghavan, S., Wasil, E. (Eds.), The vehicle routing problem: latest advances and new challenges, Springer. pp. 143-169.

[6]

Gendreau M, Tarantilis CD. Solving large-scale vehicle routing problems with time windows: the state-of-the-art. Technical report 2010-04, CIRRELT, Montreal, QC, Canada; 2010.

[7]

Crainic TG, Crisan GC, Gendreau M, Lahrichi N, Rei W. Multi-thread integrative cooperative optimization for rich combinatorial problems. In: The 12th international workshop on nature inspired distributed computing-NIDISC'09, 25-29 May, Rome; 2009. CD-ROM.

Digital Library

[8]

Hartl, R.F., Hasle, G. and Janssens, G.K., Special issue on rich vehicle routing problems. Central European Journal of Operations Research. v14 i2. 103-104.

[9]

Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N. and Rei, W., A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems. Operations Research. v60 i3. 611-624.

Digital Library

[10]

Cordeau, J.F., Gendreau, M. and Laporte, G., A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks. v30 i2. 105-119.

[11]

Cordeau, J.F. and Laporte, G., A tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR. v39 i3. 292-298.

[12]

Solomon, M.M., Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research. v35 i2. 254-265.

[13]

Gehring H, Homberger J. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Proceedings of EURO-GEN99, University of Jyväskylä, Finland; 1999. p. 57-64.

[14]

Alvarenga, G.B., Mateus, G.R. and De Tomi, G., A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Computers & Operations Research. v34 i6. 1561-1584.

[15]

Labadi, N., Prins, C. and Reghioui, M., A memetic algorithm for the vehicle routing problem with time windows. RAIRO-Operations Research. v42 i3. 415-431.

[16]

Mester, D. and Bräysy, O., Active guided evolution strategies for large-scale vehicle routing problems with time windows. Computers & Operations Research. v32 i6. 1593-1614.

Digital Library

[17]

Hashimoto, H., Yagiura, M. and Ibaraki, T., An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optimization. v5 i2. 434-456.

Digital Library

[18]

Repoussis, P.P., Tarantilis, C.D. and Ioannou, G., Arc-guided evolutionary algorithm for the vehicle routing problem with time windows. IEEE Transactions on Evolutionary Computation. v13 i3. 624-647.

Digital Library

[19]

Nagata, Y., Bräysy, O. and Dullaert, W., A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research. v37 i4. 724-737.

Digital Library

[20]

Pisinger, D. and Ropke, S., A general heuristic for vehicle routing problems. Computers & Operations Research. v34 i8. 2403-2435.

Digital Library

[21]

Prescott-Gagnon, E., Desaulniers, G. and Rousseau, L.M., A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks. v54 i4. 190-204.

Digital Library

[22]

Lim, A. and Zhang, X., A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS Journal on Computing. v19 i3. 443-457.

Digital Library

[23]

Nagata, Y. and Bräysy, O., A powerful route minimization heuristic for the vehicle routing problem with time windows. Operations Research Letters. v37 i5. 333-338.

Digital Library

[24]

Le Bouthillier, A. and Crainic, T.G., A guided cooperative search for the vehicle routing problem with time windows. Intelligent Systems, IEEE. v20 i4. 36-42.

Digital Library

[25]

Le Bouthillier, A. and Crainic, T.G., A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers & Operations Research. v32 i7. 1685-1708.

Digital Library

[26]

Ibaraki, T., Imahori, S., Nonobe, K., Sobue, K., Uno, T. and Yagiura, M., An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Applied Mathematics. v156 i11. 2050-2069.

Digital Library

[27]

Cordeau, J.F., Laporte, G. and Mercier, A., A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society. v52 i8. 928-936.

[28]

Cordeau, J.F., Laporte, G. and Mercier, A., Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. Journal of the Operational Research Society. v55 i5. 542-546.

[29]

Weigel, D. and Cao, B., Applying GIS and OR techniques to solve Sears technician-dispatching and home-delivery problems. Interfaces. v29 i1. 112-130.

Digital Library

[30]

Blakeley, F., Bozkaya, B., Cao, B., Hall, W. and Knolmajer, J., Optimizing periodic maintenance operations for Schindler Elevator Corporation. Interfaces. v33 i1. 67-79.

[31]

Teixeira, J., Antunes, A.P. and De Sousa, J.P., Recyclable waste collection planning-a case study. European Journal of Operational Research. v158 i3. 543-554.

[32]

Routing optimization for waste management. Interfaces. v35 i1. 24-36.

Digital Library

[33]

Golden, B. and Wasil, E., Computerized vehicle routing in the soft drink industry. Operations Research. v35 i1. 6-17.

Digital Library

[34]

Solving a vehicle-routing problem arising in soft-drink distribution. Journal of the Operational Research Society. v57 i9. 1045-1052.

[35]

Jang, W., Lim, H.H., Crowe, T., Raskin, G. and Perkins, T.E., The missouri lottery optimizes its scheduling and routing to improve efficiency and balance. Interfaces. v36 i4. 302-313.

Digital Library

[36]

Chiu, H.N., Lee, Y.S. and Chang, J.H., Two approaches to solving the multi-depot vehicle routing problem with time windows in a time-based logistics environment. Production Planning & Control. v17 i5. 480-493.

[37]

Parthanadee, P. and Logendran, R., Periodic product distribution from multi-depots under limited supplies. IIE Transactions. v38 i11. 1009-1026.

[38]

Cordeau, J.F. and Maischberger, M., A parallel iterated tabu search heuristic for vehicle routing problems. Computers & Operations Research. v39 i9. 2033-2050.

Digital Library

[39]

Pirkwieser S, Raidl GR. A variable neighborhood search for the periodic vehicle routing problem with time windows. In: Proceedings of the 9th EU/meeting on metaheuristics for logistics and vehicle routing, Troyes, France, 2008.

[40]

Pirkwieser S, Raidl GR. A column generation approach for the periodic vehicle routing problem with time windows. In: Proceedings of the international network optimization conference 2009. Pisa, Italy; 2009.

[41]

Pirkwieser S, Raidl GR. Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In: Proceedings of hybrid metaheuristics, HM 2009. Udine, Italy; 2009.

Digital Library

[42]

Pirkwieser S, Raidl GR. Matheuristics for the periodic vehicle routing problem with time windows. In: Proceedings of matheuristics 2010. Vienna, Austria; 2010.

[43]

Yu, B. and Yang, Z.Z., An ant colony optimization model: the period vehicle routing problem with time windows. Transportation Research Part E: logistics and Transportation Review. v47 i2. 166-181.

[44]

Nguyen PK, Crainic TG, Toulouse M. A Hybrid genetic algorithm for the periodic vehicle routing problem with time windows. Technical report 2011-25, CIRRELT, Montreal, QC, Canada; 2011.

[45]

Tamashiro, H., Nakamura, M., Okazaki, T. and Kang, D., A tabu search approach combined with an extended saving method for multi-depot vehicle routing problems with time windows. Soft Computing. v15 i1. 31-39.

[46]

Polacek, M., Hartl, R.F., Doerner, K. and Reimann, M., A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics. v10 i6. 613-627.

Digital Library

[47]

Polacek, M., Benkner, S., Doerner, K.F. and Hartl, R.F., A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. BuR-Business Research. v1 i2. 207-218.

[48]

Ostertag A. Decomposition strategies for large scale multi depot vehicle routing problems. PhD thesis, Universität Wien; 2008.

[49]

Belhaiza S. Hybrid variable neighborhood-tabu search algorithm for the site dependent vehicle routing problem with time windows. Technical report, GERAD, Montreal, Canada; 2010.

[50]

Glover, F. and Hao, J.K., The case for strategic oscillation. Annals of Operations Research. v183 i1. 163-173.

[51]

Nagata Y. Effective memetic algorithm for the vehicle routing problem with time windows: edge assembly crossover for the VRPTW. In: Proceedings of the seventh metaheuristics international conference, Montreal, Canada (on CD-ROM); 2007.

[52]

Prins, C., A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research. v31 i12. 1985-2002.

[53]

Chu, F., Labadi, N. and Prins, C., A Scatter Search for the periodic capacitated arc routing problem. European Journal of Operational Research. v169 i2. 586-605.

[54]

Prins, C., Two memetic algorithms for heterogeneous fleet vehicle routing problems. Engineering Applications of Artificial Intelligence. v22 i6. 916-928.

Digital Library

[55]

Johnson, D.S. and McGeoch, L.A., The traveling salesman problem: a case study in local optimization. . In: Aarts, E.H.L., Lenstra, J.K. (Eds.), Local search in combinatorial optimization, Princeton University Press. pp. 215-310.

[56]

Toth, P. and Vigo, D., The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing. v15 i4. 333-346.

Digital Library

[57]

Ibaraki, T., Imahori, S., Kubo, M., Masuda, T., Uno, T. and Yagiura, M., Effective local search algorithms for routing and scheduling problems with general time-window constraints. Transportation Science. v39 i2. 206-232.

Digital Library

[58]

Kindervater, G.A.P. and Savelsbergh, M.W.P., Vehicle routing: handling edge exchanges. . In: Aarts, E.H.L., Lenstra, J.K. (Eds.), Local search in combinatorial optimization, Princeton University Press. pp. 337-360.

[59]

Irnich, S., A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS Journal on Computing. v20 i2. 270-287.

Digital Library

[60]

Vidal T, Crainic TG, Gendreau M, Prins C. A unifying view on timing problems and algorithms. Technical report 2011-43, CIRRELT, Montreal, QC, Canada; 2011.

[61]

Taillard, E., Parallel iterative search methods for vehicle routing problems. Networks. v23 i8. 661-673.

[62]

Reimann, M., Doerner, K.F. and Hartl, R.F., D-Ants: savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research. v31. 563-591.

Digital Library

[63]

Bent R, Van Hentenryck P. Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows. In: Proceedings of the 16th international conference on principles and practice of constraint programming, CP'10, St. Andrews, Scotland. Springer-Verlag; 2010. p. 99-113.

Digital Library

[64]

Solomon, M.M. and Desrosiers, J., Time window constrained routing and scheduling problems. Transportation Science. v22 i1. 1-13.

Cited By

Lan Lvan Doorn JWouda NRijal ABhulai S(2024)An Iterative Sample Scenario Approach for the Dynamic Dispatch Waves ProblemTransportation Science10.1287/trsc.2023.011158:4(726-740)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1287/trsc.2023.0111
Cook WHeld SHelsgaun K(2024)Constrained Local Search for Last-Mile RoutingTransportation Science10.1287/trsc.2022.118558:1(12-26)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1287/trsc.2022.1185
Wouda NLan LKool W(2024)PyVRPINFORMS Journal on Computing10.1287/ijoc.2023.005536:4(943-955)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1287/ijoc.2023.0055
Show More Cited By

A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies

Recommendations

Multi-depot vehicle routing problem with time windows under shared depot resources

A new variant of multi-depot vehicle routing problem with time windows is studied. In the new variant, the depot where the vehicle ends is flexible, namely, it is not entirely the same as the depot that it starts from. An integer programming model is ...
A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows

This paper presents a hybrid evolutionary algorithm (HEA) to solve heterogeneous fleet vehicle routing problems with time windows. There are two main types of such problems, namely the fleet size and mix vehicle routing problem with time windows (F) and ...
Improvement of Genetic Algorithm for Vehicle Routing Problems with Time Windows
ISDEA '13: Proceedings of the 2013 Third International Conference on Intelligent System Design and Engineering Applications

Vehicle routing problem with time windows (VRPTW) is of crucial importance in today's industries, especially in logistics distribution. Improvement of genetic algorithm (GA) using an optimized crossover operator is proposed by a complete undirected ...

Comments

Information & Contributors

Information

Published In

Copyright © Elsevier Ltd.

Publisher

Elsevier Science Ltd.

United Kingdom

Publication History

Published: 01 January 2013

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

111
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lan Lvan Doorn JWouda NRijal ABhulai S(2024)An Iterative Sample Scenario Approach for the Dynamic Dispatch Waves ProblemTransportation Science10.1287/trsc.2023.011158:4(726-740)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1287/trsc.2023.0111
Cook WHeld SHelsgaun K(2024)Constrained Local Search for Last-Mile RoutingTransportation Science10.1287/trsc.2022.118558:1(12-26)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1287/trsc.2022.1185
Wouda NLan LKool W(2024)PyVRPINFORMS Journal on Computing10.1287/ijoc.2023.005536:4(943-955)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1287/ijoc.2023.0055
Jie WPei CXu JYan H(2024)A Branch-and-Price Algorithm for an Integrated Online and Offline Retailing Distribution System with Product ReturnInternational Journal of Intelligent Systems10.1155/2024/88807912024Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1155/2024/8880791
Fu YMa XGao KLi ZDong H(2024)Multi-Objective Home Health Care Routing and Scheduling With Sharing Service via a Problem-Specific Knowledge-Based Artificial Bee Colony AlgorithmIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.331578525:2(1706-1719)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1109/TITS.2023.3315785
Meng WQu R(2024)Automated design of local search algorithmsExpert Systems with Applications: An International Journal10.1016/j.eswa.2023.121431237:PAOnline publication date: 27-Feb-2024
https://dl.acm.org/doi/10.1016/j.eswa.2023.121431
Biswas DAlfandari LArchetti C(2024)A Triple Bottom Line optimization model for assignment and routing of on-demand home servicesComputers and Operations Research10.1016/j.cor.2024.106644167:COnline publication date: 18-Jul-2024
https://dl.acm.org/doi/10.1016/j.cor.2024.106644
Ahmadi Basir SŞahin GÖzbaygın G(2024)A comparative study of alternative formulations for the periodic vehicle routing problemComputers and Operations Research10.1016/j.cor.2024.106583165:COnline publication date: 2-Jul-2024
https://dl.acm.org/doi/10.1016/j.cor.2024.106583
Somar SUrazel BBuruk Sahin Y(2024)A modified metaheuristic algorithm for a home health care routing problem with health team skill levelsApplied Soft Computing10.1016/j.asoc.2023.110912148:COnline publication date: 27-Feb-2024
https://dl.acm.org/doi/10.1016/j.asoc.2023.110912
Legrand CCattaruzza DJourdan LKessaci M(2024)Investigation of the Benefit of Extracting Patterns from Local Optima to Solve a Bi-objective VRPTWMetaheuristics10.1007/978-3-031-62912-9_7(62-77)Online publication date: 4-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-62912-9_7
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents