The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations
Open accessOverview
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
WHAT ABOUT PEOPLE IN REGIONAL SCIENCE?
Hägerstraand, T. (1970) · Papers in Regional Science · doi:10.1111/j.1435-5597.1970.tb01464.x · Cited by 3,405
Parallel programming in OpenMP
Chandra, R., Dagum, L., Kohr, D., Maydan, D. E., & McDonald, J. (2001) · Cited by 1,293
Ridesharing: The state-of-the-art and future directions
Furuhata, M., Dessouky, M., Ordóñez, F., Brunet, M.-E., Wang, X., & Koenig, S. (2013) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2013.08.012 · Cited by 885
Dynamic Programming Treatment of the Travelling Salesman Problem
Bellman, R. (1962) · Journal of the ACM · doi:10.1145/321105.321111 · Cited by 808
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Cordeau, J.-F. (2006) · Operations Research · doi:10.1287/opre.1060.0283 · Cited by 695
Modelling accessibility using space-time prism concepts within geographical information systems
MILLER, H. J. (1991) · International journal of geographical information systems · doi:10.1080/02693799108927856 · Cited by 676
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
Psaraftis, H. N. (1980) · Transportation Science · doi:10.1287/trsc.14.2.130 · Cited by 601
Branch 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
Chabini, I. (1998) · Transportation Research Record Journal of the Transportation Research Board · doi:10.3141/1645-21 · Cited by 382
Vehicle routing under time-dependent travel times: The impact of congestion avoidance
Kok, A. L., Hans, E. W., & Schutten, J. M. J. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2011.05.027 · Cited by 367
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
Røpke, S., Cordeau, J., & Gilbert Laporte, A. (2007) · Networks · doi:10.1002/net.20177 · Cited by 353
Drive: Dynamic Routing of Independent Vehicles
Savelsbergh, M., & Sol, M. (1998) · Operations Research · doi:10.1287/opre.46.4.474 · Cited by 334
Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows
Mitrović-Minić, S., Krishnamurti, R., & Laporte, G. (2004) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2003.09.001 · Cited by 299
A Location Based Heuristic for General Routing Problems
Bramel, J., & Simchi‐Levi, D. (1995) · Operations Research · doi:10.1287/opre.43.4.649 · Cited by 280
Ziliaskopoulos, A. K., & Mahmassani, H. S. (1993) · Transportation Research Record Journal of the Transportation Research Board · Cited by 268
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
Baldacci, R., Bartolini, E., & Mingozzi, A. (2011) · Operations Research · doi:10.1287/opre.1100.0881 · Cited by 256
The shared-taxi problem: Formulation and solution methods
Hosni, H. E., Naoum‐Sawaya, J., & Artail, H. A. (2014) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2014.09.011 · Cited by 233
An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
Azi, N., Gendreau, M., & Potvin, J.-Y. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.02.019 · Cited by 206
DTALite: A queue-based mesoscopic traffic simulator for fast model evaluation and calibration
Zhou, X., & Taylor, J. (2014) · Cogent Engineering · doi:10.1080/23311916.2014.961345 · Cited by 174
Self-citationSet partitioning based heuristics for interactive routing
Cullen, F. H., Jarvis, J. J., & Ratliff, H. D. (1981) · Networks · doi:10.1002/net.3230110206 · Cited by 146
Combining multicriteria analysis and tabu search for dial-a-ride problems
Paquette, J., Cordeau, J., Gilbert Laporte, A., et al. (2013) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2013.02.007 · Cited by 119
The load-dependent vehicle routing problem and its pick-up and delivery extension
Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2014) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2014.11.004 · Cited by 91
Swersey, A. J., & Ballard, W. (1984) · Management Science · doi:10.1287/mnsc.30.7.844 · Cited by 81
Large Scale Multi-Vehicle Dial-a-Ride Problems
Desrosiers, J., Soumis, F., & Dumas, Y. (1989) · Les Cahiers du GERAD · Cited by 46
Cited by
Mobility as a Service: A Critical Review of Definitions, Assessments of Schemes, and Key Challenges
Jittrapirom, P., Caiati, V., Feneri, A.-M., Ebrahimigharehbaghi, S., González, M. J. A., & Narayan, J. (2017) · Urban Planning · doi:10.17645/up.v2i2.931 · Cited by 850
Vehicle routing problems with road‐network information: State of the art
Ben Ticha, H., Absi, N., Feillet, D., & Quilliot, A. (2018) · Networks · doi:10.1002/net.21808 · Cited by 51
Metadata
- Authors
- Mahmoudi, M., & Zhou, X.
- Venue
- Transportation Research Part B: Methodological
- Publisher
- Elsevier BV
- Published
- 2016-07
- Volume
- 89
- Pages
- 19-42
- ISSN
- 0191-2615 (ISSN-L)
- OpenAlex
- W2964290823
- Cited by
- 316
- References
- 26
- FWCI
- 38.08
- Type
- journal article
- Language
- en
- Open access
- bronze
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.