The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
Abstract
The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods from a pickup location to a delivery location. Our task is to construct routes that visit all locations such that corresponding pickups and deliveries are placed on the same route, and such that a pickup is performed before the corresponding delivery. The routes must also satisfy time window and capacity constraints. This paper presents a heuristic for the problem based on an extension of the large neighborhood search heuristic previously suggested for solving the vehicle routing problem with time windows. The proposed heuristic is composed of a number of competing subheuristics that are used with a frequency corresponding to their historic performance. This general framework is denoted adaptive large neighborhood search. The heuristic is tested on more than 350 benchmark instances with up to 500 requests. It is able to improve the best known solutions from the literature for more than 50% of the problems. The computational experiments indicate that it is advantageous to use several competing subheuristics instead of just one. We believe that the proposed heuristic is very robust and is able to adapt to various instance characteristics.
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
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
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
Introduction to Algorithms, Second Edition
Rivest, R. L., Leiserson, C. E., Cormen, T. H., & Stein, C. (2001) · Cited by 1,984
Introduction to algorithms [2nd ed.]
Cormen, T. H. (2001) · Cited by 1,911
O’Regan, G. (2023) · Texts in Computer Science · doi:10.1007/978-3-031-26212-8_4 · Cited by 1,614
A general heuristic for vehicle routing problems
Pisinger, D., & Ropke, S. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.09.012 · Cited by 1,443
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 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
Cited by
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
A general heuristic for vehicle routing problems
Pisinger, D., & Ropke, S. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.09.012 · Cited by 1,443
Self-citationThe Electric Vehicle-Routing Problem with Time Windows and Recharging Stations
Schneider, M., Stenger, A., & Goeke, D. (2014) · Transportation Science · doi:10.1287/trsc.2013.0490 · Cited by 1,312
A review of recent research on green road freight transportation
Demir, E., Bektaş, T., & Laporte, G. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.12.033 · Cited by 772
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
Routing a mixed fleet of electric and conventional vehicles
Goeke, D., & Schneider, M. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.01.049 · Cited by 607
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-citationAn 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-citationBranch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Ropke, S., & Cordeau, J.-F. (2009) · Transportation Science · doi:10.1287/trsc.1090.0272 · Cited by 487
Self-citationThe bi-objective Pollution-Routing Problem
Demir, E., Bektaş, T., & Laporte, G. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.08.002 · Cited by 460
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-citationTransport poverty meets the digital divide: accessibility and connectivity in rural communities
Velaga, N. R., Beecroft, M., Nelson, J. D., Corsar, D., & Edwards, P. (2012) · Journal of Transport Geography · doi:10.1016/j.jtrangeo.2011.12.005 · Cited by 352
Learning Improvement Heuristics for Solving Routing Problems
Wu, Y., Song, W., Cao, Z., Zhang, J., & Lim, A. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3068828 · Cited by 344
Two echelon vehicle routing problem with drones in last mile delivery
Kitjacharoenchai, P., Min, B.-C., & Lee, S. (2020) · International Journal of Production Economics · doi:10.1016/j.ijpe.2019.107598 · Cited by 332
Single-line rail rapid transit timetabling under dynamic passenger demand
Barrena, E., Canca, D., Coelho, L. C., & Laporte, G. (2014) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2014.08.013 · 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
Electric vehicle routing problem with recharging stations for minimizing energy consumption
Zhang, S., Gajpal, Y., Appadoo, S. S., & Abdulkader, M. M. S. (2018) · International Journal of Production Economics · doi:10.1016/j.ijpe.2018.07.016 · Cited by 277
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
The electric vehicle routing problem with energy consumption uncertainty
Pelletier, S., Jabali, O., & Laporte, G. (2019) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2019.06.006 · Cited by 260
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
Holland, C., Levis, J., Nuggehalli, R., Santilli, B., & Winters, J. (2017) · Interfaces · doi:10.1287/inte.2016.0875 · Cited by 95
Cost-effective electric bus resource assignment based on optimized charging and decision robustness
Chen, Q., Niu, C., Tu, R., Li, T., Wang, A., & He, D. (2023) · Transportation Research Part D: Transport and Environment · doi:10.1016/j.trd.2023.103724 · Cited by 29
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
- Ropke, S., & Pisinger, D.
- Venue
- Transportation Science
- Published
- 2006-11
- Volume
- 40
- Issue
- 4
- Pages
- 455-472
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2105002757
- Cited by
- 2,580
- References
- 18
- FWCI
- 61.99
- 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.