research-article

An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

Authors:

Glaydston Mattos Ribeiro,

Gilbert LaporteAuthors Info & Claims

Computers and Operations Research, Volume 39, Issue 3

Pages 728 - 735

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

Published: 01 March 2012 Publication History

Abstract

The cumulative capacitated vehicle routing problem (CCVRP) is a variation of the classical capacitated vehicle routing problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compared with two recently published memetic algorithms.

References

[1]

Lucena, A., Time-dependent traveling salesman problem: the deliveryman case. Networks. v20. 753-763.

[2]

Fischetti, M., Laporte, G. and Martello, S., The delivery man problem and cumulative matroids. Operations Research. v41. 1055-1064.

[3]

Picard, J.-C. and Queyranne, M., The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Operations Research. v26. 86-110.

Digital Library

[4]

Stecco, G., Cordeau, J.-F. and Moretti, E., A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine. Journal of Scheduling. v12. 3-16.

Digital Library

[5]

Heilporn, G., Cordeau, J.-F. and Laporte, G., The delivery man problem with time windows. Discrete Optimization. v7. 269-282.

Digital Library

[6]

Park, J. and Kim, B.-I., The school bus routing problem: a review. European Journal of Operational Research. v202. 311-319.

[7]

Ogryczak, W., Inequality measures and equitable approaches to location problems. European Journal of Operational Research. v122. 374-391.

[8]

Campbell, A.M., Vandenbussche, D. and Hermann, W., Routing for relief efforts. Transportation Science. v42. 127-145.

Digital Library

[9]

Ngueveu, S.U., Prins, C. and Wolfler-Calvo, R., An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers & Operations Research. v37. 1877-1885.

Digital Library

[10]

Nolz, P.C., Doerner, K.F., Gutjahr, W.J. and Hartl, R.F., A bi-objective metaheuristic for disaster relief operation planning. In: Coello, C.A.C., Dhaenens, C., Jourdan, L. (Eds.), Advances in multi-objective nature inspired computing, Springer-Verlag, Berlin. pp. 167-187.

[11]

Augerat P, Belenguer J, Benavent E, Corberán A, Naddef D, Rinaldi G. Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report 949-M, Université Joseph Fourier, Grenoble; 1995.

[12]

Golden, B.L., Wasil, E.A., Kelly, J.P. and Chao, I.-M., Metaheuristics in vehicle routing. In: Crainic, T.G., Laporte, G. (Eds.), Fleet management and logistics, Kluwer, Boston. pp. 33-56.

[13]

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

[14]

Ropke, S. and Pisinger, D., An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science. v40. 455-472.

Digital Library

[15]

Shaw P. A new local search algorithm providing high quality solutions to vehicle routing problems. Technical Report, University of Strathclyde, Glasgow; 1997.

[16]

Pisinger, D. and Ropke, S., Large neighborhood search. In: Gendreau, M., Potvin, J.-Y. (Eds.), Handbook of Metaheuristics of International Series in Operations Research & Management Science, vol. 146. Springer, Boston. pp. 399-419.

[17]

Ropke, S. and Pisinger, D., A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research. v171. 750-775.

[18]

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

Digital Library

[19]

Azi N, Gendreau M, Potvin J.-Y. An adaptive large neighborhood search for a vehicle routing problem with multiple trips. Technical Report 2010-08, CIRRELT, Montréal, Available at {https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2010-08.pdf}; 2010.

[20]

Pepin, A.-S., Desaulniers, G., Hertz, A. and Huisman, D., A comparison of five heuristics for the multiple depot vehicle scheduling problem. Journal of Scheduling. v12. 17-30.

Digital Library

[21]

Kruskal JB. On the shortest spanning subtree of a graph and the traveling salesman problem. In: Proceedings of the American Mathematical Society, vol. 7. American Mathematical Society; 1956. p. 48-50.

[22]

Potvin, J.-Y. and Rousseau, J.-M., A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research. v66. 331-340.

[23]

Christofides, N., Mingozzi, A. and Toth, P., The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (Eds.), Combinatorial optimization, Wiley, Chichester. pp. 315-338.

Cited By

Kritikos MMetzidakis TIoannou G(2024)The cumulative vehicle routing problem with arc time windowsExpert Systems with Applications: An International Journal10.1016/j.eswa.2023.122447240:COnline publication date: 15-Apr-2024
https://dl.acm.org/doi/10.1016/j.eswa.2023.122447
Johnn SDarvariu VHandl JKalcsics J(2024)A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood SearchComputers and Operations Research10.1016/j.cor.2024.106791172:COnline publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1016/j.cor.2024.106791
Cunha CMassarotto DFornazza SMendes A(2024)An ALNS metaheuristic for the family multiple traveling salesman problemComputers and Operations Research10.1016/j.cor.2024.106750169:COnline publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1016/j.cor.2024.106750
Show More Cited By

An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

Recommendations

Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
Abstract
This article considers three variants of the vehicle routing problem (VRP). These variants determine the respective depot locations from which customers are supplied, i.e., the two-echelon VRP (2E-VRP), the location routing problem (...
Highlights
- We consider the two-echelon VRP (2E-VRP), the location routing problem (LRP), and the multi-depot VRP (MDVRP).
An adaptive large neighborhood search heuristic for the share-a-ride problem

The Share-a-Ride Problem (SARP) aims at maximizing the profit of serving a set of passengers and parcels using a set of homogeneous vehicles. We propose an adaptive large neighborhood search (ALNS) heuristic to address the SARP. Furthermore, we study ...
Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem

We aim at developing a new hybrid large neighbourhood search algorithm for CVRP.Our algorithm incorporates solution construction heuristic of ACO into LNS.The proposed hybrid LNS-ACO algorithm is tested on a set of CVRP instances.Computational results ...

Comments

Information & Contributors

Information

Published In

cover image Computers and Operations Research

Computers and Operations Research Volume 39, Issue 3

March, 2012

280 pages

ISSN:0305-0548

Issue’s Table of Contents

Copyright © Elsevier Ltd.

Publisher

Elsevier Science Ltd.

United Kingdom

Publication History

Published: 01 March 2012

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

48
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kritikos MMetzidakis TIoannou G(2024)The cumulative vehicle routing problem with arc time windowsExpert Systems with Applications: An International Journal10.1016/j.eswa.2023.122447240:COnline publication date: 15-Apr-2024
https://dl.acm.org/doi/10.1016/j.eswa.2023.122447
Johnn SDarvariu VHandl JKalcsics J(2024)A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood SearchComputers and Operations Research10.1016/j.cor.2024.106791172:COnline publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1016/j.cor.2024.106791
Cunha CMassarotto DFornazza SMendes A(2024)An ALNS metaheuristic for the family multiple traveling salesman problemComputers and Operations Research10.1016/j.cor.2024.106750169:COnline publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1016/j.cor.2024.106750
Kucukoglu IVansteenwegen PCattrysse D(2024)The traveling purchaser problem for perishable foodsComputers and Industrial Engineering10.1016/j.cie.2024.110424195:COnline publication date: 18-Nov-2024
https://dl.acm.org/doi/10.1016/j.cie.2024.110424
Li HWang FXiong HWang Z(2024)Two-echelon van-robot routing problem with sharing-curbside satellitesJournal of Heuristics10.1007/s10732-024-09541-231:1Online publication date: 22-Nov-2024
https://dl.acm.org/doi/10.1007/s10732-024-09541-2
Zhou JWu YCao ZSong WZhang JChen Z(2023)Learning Large Neighborhood Search for Vehicle Routing in Airport Ground HandlingIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.324979935:9(9769-9782)Online publication date: 1-Sep-2023
https://dl.acm.org/doi/10.1109/TKDE.2023.3249799
Shi YLiu WZhou Y(2023)An adaptive large neighborhood search based approach for the vehicle routing problem with zone-based pricingEngineering Applications of Artificial Intelligence10.1016/j.engappai.2023.106506124:COnline publication date: 1-Sep-2023
https://dl.acm.org/doi/10.1016/j.engappai.2023.106506
Osorio-Mora AEscobar JToth P(2023)An iterated local search algorithm for latency vehicle routing problems with multiple depotsComputers and Operations Research10.1016/j.cor.2023.106293158:COnline publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1016/j.cor.2023.106293
Srivastava GSingh A(2023)Two evolutionary approaches with objective-specific variation operators for vehicle routing problem with time windows and quality of service objectivesApplied Soft Computing10.1016/j.asoc.2022.109964134:COnline publication date: 1-Feb-2023
https://dl.acm.org/doi/10.1016/j.asoc.2022.109964
Schaap HSchiffer MSchneider MWalther G(2022)A Large Neighborhood Search for the Vehicle Routing Problem with Multiple Time WindowsTransportation Science10.1287/trsc.2021.112056:5(1369-1392)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1287/trsc.2021.1120
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents