The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows
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
Lectu re Notes in Economics and Mathematical Systems
Beckmann, M. J., & Künzi, H. P. (1975) · Cited by 2,414
Probabilistic diversification and intensification in local search for vehicle routing
Rochat, Y., & Taillard, É. D. (1995) · Journal of Heuristics · doi:10.1007/bf02430370 · Cited by 914
Kanji, G. (2006) · SAGE Publications Ltd eBooks · doi:10.4135/9781849208499 · Cited by 783
Time Constrained Routing and Scheduling
Desrosiers, J., Solomon, M. M., Soumis, F., & Dumas, Y. (1992) · PolyPublie (École Polytechnique de Montréal) · doi:10.1016/s0927-0507%2805%2980106-9 · Cited by 709
Dynamic vehicle routing problems: Three decades and counting
Psaraftis, H. N., Wen, M., & Kontovas, C. A. (2016) · Networks · doi:10.1002/net.21628 · Cited by 709
A tabu search heuristic for the static multi-vehicle dial-a-ride problem
Cordeau, J.-F., & Laporte, G. (2003) · Transportation Research Part B: Methodological · doi:10.1016/s0191-2615(02)00045-0 · Cited by 702
Self-citationLocal search in routing problems with time windows
Savelsbergh, M. W. P. (1985) · Annals of Operations Research · doi:10.1007/bf02022044 · Cited by 693
The pickup and delivery problem with time windows
Dumas, Y., Desrosiers, J., & Soumis, F. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90319-q · Cited by 667
A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows
Jaw, J.-J., Odoni, A. R., Psaraftis, H. N., & Wilson, N. H. M. (1986) · Transportation Research Part B Methodological · doi:10.1016/0191-2615(86)90020-2 · Cited by 624
Transportation and traffic theory
Mortelmans, J. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90368-j · Cited by 491
Cited by
A review of dynamic vehicle routing problems
Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.08.015 · Cited by 1,253
The multiple traveling salesman problem: an overview of formulations and solution procedures
Bektas, T. (2006) · Omega · doi:10.1016/j.omega.2004.10.004 · Cited by 1,153
Dynamic vehicle routing problems: Three decades and counting
Psaraftis, H. N., Wen, M., & Kontovas, C. A. (2016) · Networks · doi:10.1002/net.21628 · Cited by 709
Dynamic pickup and delivery problems
Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.04.024 · Cited by 679
Self-citationReal-time vehicle routing: Solution concepts, algorithms and parallel computing strategies
Ghiani, G., Guerriero, F., Laporte, G., & Musmanno, R. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00915-3 · Cited by 350
Self-citationMahmoudi, M., & Zhou, X. (2016) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2016.03.009 · Cited by 316
Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
Matai, R., Singh, S., & Lal, M. (2010) · Traveling Salesman Problem, Theory and Applications · doi:10.5772/12909 · Cited by 299
Intelligent freight-transportation systems: Assessment and the contribution of operations research
Crainic, T. G., Gendreau, M., & Potvin, J.-Y. (2009) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2008.07.002 · Cited by 291
Waste collection multi objective model with real time traceability data
Faccio, M., Persona, A., & Zanin, G. (2011) · Waste Management · doi:10.1016/j.wasman.2011.07.005 · Cited by 263
A New Framework of Intelligent Public Transportation System Based on the Internet of Things
Luo, X.-G., Zhang, H.-B., Zhang, Z.-L., Yu, Y., & Li, K. (2019) · IEEE Access · doi:10.1109/access.2019.2913288 · Cited by 85
Hyland, M. F., & Mahmassani, H. S. (2017) · Transportation Research Record: Journal of the Transportation Research Board · doi:10.3141/2653-04 · Cited by 69
Metadata
- Authors
- Mitrović-Minić, S., Krishnamurti, R., & Laporte, G.
- Venue
- Transportation Research Part B: Methodological
- Publisher
- Elsevier BV
- Published
- 2004-09
- Volume
- 38
- Issue
- 8
- Pages
- 669-685
- ISSN
- 0191-2615 (ISSN-L)
- OpenAlex
- W2094091661
- Cited by
- 299
- References
- 23
- FWCI
- 19.02
- 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.