The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
A general heuristic for vehicle routing problems
Abstract
We present a unified heuristic which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacitated vehicle routing problem (CVRP), the multi-depot vehicle routing problem (MDVRP), the site-dependent vehicle routing problem (SDVRP) and the open vehicle routing problem (OVRP). All problem variants are transformed into a rich pickup and delivery model and solved using the adaptive large neighborhood search (ALNS) framework presented in Ropke and Pisinger [An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, to appear]. The ALNS framework is an extension of the large neighborhood search framework by Shaw [Using constraint programming and local search methods to solve vehicle routing problems. In: CP-98, Fourth international conference on principles and practice of constraint programming, Lecture notes in computer science, vol. 1520, 1998. p. 417-31] with an adaptive layer. This layer adaptively chooses among a number of insertion and removal heuristics to intensify and diversify the search. The presented approach has a number of advantages: it provides solutions of very high quality, the algorithm is robust, and to some extent self-calibrating. Moreover, the unified model allows the dispatcher to mix various variants of VRP problems for individual customers or vehicles. As we believe that the ALNS framework can be applied to a large number of tightly constrained optimization problems, a general description of the framework is given, and it is discussed how the various components can be designed in a particular setting. The paper is concluded with a computational study, in which the five different variants of the vehicle routing problem are considered on standard benchmark tests from the literature. The outcome of the tests is promising as the algorithm is able to improve 183 best known solutions out of 486 benchmark tests. The heuristic has also shown promising results for a large class of vehicle routing problems with backhauls as demonstrated in Ropke and Pisinger [A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research, 2004, to appear].
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
Issues in Supply Chain Management
Lambert, D. M., & Cooper, M. C. (2000) · Industrial Marketing Management · doi:10.1016/s0019-8501(99)00113-3 · Cited by 3,099
Ropke, S., & Pisinger, D. (2006) · Transportation Science · doi:10.1287/trsc.1050.0135 · Cited by 2,580
Self-citationUsing Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
Shaw, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49481-2_30 · Cited by 1,366
A simple and effective evolutionary algorithm for the vehicle routing problem
Prins, C. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00158-8 · Cited by 1,058
A unified tabu search heuristic for vehicle routing problems with time windows
Cordeau, J.-F., Laporte, G., & Mercier, A. (2001) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601163 · Cited by 897
A tabu search heuristic for periodic and multi-depot vehicle routing problems
Cordeau, J.-F., Gendreau, M., & Laporte, G. (1997) · Networks · doi:10.1002/(sici)1097-0037(199709)30:2<105::aid-net5>3.0.co;2-g · Cited by 864
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Bräysy, O., & Gendreau, M. (2005) · Transportation Science · doi:10.1287/trsc.1030.0057 · Cited by 844
Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004) · Networks · doi:10.1002/net.20033 · Cited by 693
Cited by
Ropke, S., & Pisinger, D. (2006) · Transportation Science · doi:10.1287/trsc.1050.0135 · Cited by 2,580
Self-citationHyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
Fifty Years of Vehicle Routing
Laporte, G. (2009) · Transportation Science · doi:10.1287/trsc.1090.0301 · Cited by 1,022
An adaptive large neighborhood search heuristic for the Pollution-Routing Problem
Demir, E., Bektaş, T., & Laporte, G. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.06.044 · Cited by 726
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012) · Operations Research · doi:10.1287/opre.1120.1048 · Cited by 709
Partial recharge strategies for the electric vehicle routing problem with time windows
Keskin, M., & Çatay, B. (2016) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2016.01.013 · Cited by 600
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.01.038 · Cited by 584
Self-citationA Classification of Hyper-heuristic Approaches
Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Woodward, J. R. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_15 · Cited by 563
An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones
Sacramento, D., Pisinger, D., & Ropke, S. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.02.018 · Cited by 563
Self-citationNew Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
Baldacci, R., Mingozzi, A., & Roberti, R. (2011) · Operations Research · doi:10.1287/opre.1110.0975 · Cited by 506
Felipe, Á., Ortuño, M. T., Righini, G., & Tirado, G. (2014) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2014.09.003 · Cited by 491
Battery swap station location-routing problem with capacitated electric vehicles
Yang, J., & Sun, H. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2014.07.003 · Cited by 434
A unified solution framework for multi-attribute vehicle routing problems
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.09.045 · Cited by 433
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.02.053 · Cited by 430
Pisinger, D., & Ropke, S. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_4 · Cited by 395
Self-citationRecent advances in selection hyper-heuristics
Drake, J. H., Kheiri, A., Özcan, E., & Burke, E. K. (2020) · European Journal of Operational Research · doi:10.1016/j.ejor.2019.07.073 · Cited by 365
Hof, J., Schneider, M., & Goeke, D. (2017) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2016.11.009 · Cited by 284
Ghoseiri, K., & Ghannadpour, S. F. (2010) · Applied Soft Computing · doi:10.1016/j.asoc.2010.04.001 · Cited by 282
Rich Vehicle Routing Problem: Survey
Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. A. (2015) · ACM Computing Surveys · doi:10.1145/2666003 · Cited by 280
A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches
Erdelić, T., & Carić, T. (2019) · Journal of Advanced Transportation · doi:10.1155/2019/5075671 · Cited by 270
Jie, W., Yang, J., Zhang, M., & Huang, Y. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.07.002 · Cited by 256
A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
Keskin, M., & Çatay, B. (2018) · Computers & Operations Research · doi:10.1016/j.cor.2018.06.019 · Cited by 256
Liu, X., Laporte, G., Chen, Y., & He, R. (2017) · Computers & Operations Research · doi:10.1016/j.cor.2017.04.006 · Cited by 250
DRL-Based Dynamic Destroy Approaches for Agile-Satellite Mission Planning
Huang, W., Li, Z., He, X., Xiang, J., Du, X., & Liang, X. (2023) · Remote Sensing · doi:10.3390/rs15184503 · Cited by 11
Metadata
- Authors
- Pisinger, D., & Ropke, S.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2007-08
- Volume
- 34
- Issue
- 8
- Pages
- 2403-2435
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2109101401
- Cited by
- 1,443
- References
- 32
- FWCI
- 73.77
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.