The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Real-Time Multivehicle Truckload Pickup and Delivery Problems
Abstract
In this paper we formally introduce a generic real-time multivehicle truckload pickup and delivery problem. The problem includes the consideration of various costs associated with trucks' empty travel distances, jobs' delayed completion times, and job rejections. Although very simple, the problem captures most features of the operational problem of a real-world trucking fleet that dynamically moves truckloads between different sites according to customer requests that arrive continuously. We propose a mixed-integer programming formulation for the offline version of the problem. We then consider and compare five rolling horizon strategies for the real-time version. Two of the policies are based on a repeated reoptimization of various instances of the offline problem, while the others use simpler local (heuristic) rules. One of the reoptimization strategies is new, while the other strategies have recently been tested for similar real-time fleet management problems. The comparison of the policies is done under a general simulation framework. The analysis is systematic and considers varying traffic intensities, varying degrees of advance information, and varying degrees of flexibility for job-rejection decisions. The new reoptimization policy is shown to systematically outperform the others under all these conditions.
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
Online Computation and Competitive Analysis
Borodin, A., & El‐Yaniv, R. (1998) · Cited by 2,333
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
(1986) · Journal of the Operational Research Society · doi:10.1057/jors.1986.93 · Cited by 1,679
Stochastic models in operations research
Heyman, D. P., & Sobel, M. J. (1982) · Medical Entomology and Zoology · Cited by 1,041
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
VEHICLE ROUTING: METHODS AND STUDIES
Golden, B., & Assad, A. A. (1988) · North-Holland eBooks · Cited by 691
Transportation and traffic theory
Mortelmans, J. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90368-j · Cited by 491
A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
Bertsimas, D. J., & van Ryzin, G. (1991) · Operations Research · doi:10.1287/opre.39.4.601 · Cited by 437
Chapter 3 Stochastic and dynamic networks and routing
Powell, W. B., Jaillet, P., & Odoni, A. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80107-0 · Cited by 334
Self-citationVehicle Routing with Time Windows
Kolen, A. W. J., Kan, A. H. G. R., & Trienekens, H. W. J. M. (1987) · Operations Research · doi:10.1287/opre.35.2.266 · Cited by 304
Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
Dror, M., Laporte, G., & Trudeau, P. (1989) · Transportation Science · doi:10.1287/trsc.23.3.166 · Cited by 286
Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
Bertsimas, D. J., & van Ryzin, G. (1993) · Operations Research · doi:10.1287/opre.41.1.60 · Cited by 274
The Multiple Terminal Delivery Problem with Probabilistic Demands
Tillman, F. A. (1969) · Transportation Science · doi:10.1287/trsc.3.3.192 · Cited by 248
Diversion Issues in Real-Time Vehicle Dispatching
Ichoua, S., Michel Gendreau, A., & Potvin, J. (2000) · Transportation Science · doi:10.1287/trsc.34.4.426.12325 · Cited by 243
Probabilistic Analysis of Algorithms
Hofri, M. (1987) · Springer eBooks · doi:10.1007/978-1-4612-4800-2 · Cited by 171
Powell, W. B. (1996) · Transportation Science · doi:10.1287/trsc.30.3.195 · Cited by 166
A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
Frantzeskakis, L. F., & Powell, W. B. (1990) · Transportation Science · doi:10.1287/trsc.24.1.40 · Cited by 145
On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
Bramel, J., & Simchi‐Levi, D. (1997) · Operations Research · doi:10.1287/opre.45.2.295 · Cited by 93
Dynamic Decision Making for Commercial Fleet Operations Using Real-Time Information
Regan, A., Mahmassani, H. S., & Jaillet, P. (1996) · Transportation Research Record Journal of the Transportation Research Board · doi:10.1177/0361198196153700113 · Cited by 92
Self-citationEvaluation of Dynamic Fleet Management Systems: Simulation Framework
Regan, A., Mahmassani, H. S., & Jaillet, P. (1998) · Transportation Research Record Journal of the Transportation Research Board · doi:10.3141/1645-22 · Cited by 88
Self-citationOn-Line Algorithms for Truck Fleet Assignment and Scheduling Under Real-Time Information
Yang, J., Jaillet, P., & Mahmassani, H. S. (1999) · Transportation Research Record Journal of the Transportation Research Board · doi:10.3141/1667-13 · Cited by 77
Self-citationA SIMULATION AND STATISTICAL ANALYSIS OF STOCHASTIC VEHICLE ROUTING WITH TIMING CONSTRAINTS
Cook, T. M., & Russell, R. A. (1978) · Decision Sciences · doi:10.1111/j.1540-5915.1978.tb00753.x · Cited by 69
Regan, A., Mahmassani, H. S., & Jaillet, P. (1995) · Transportation Research Record Journal of the Transportation Research Board · Cited by 67
Self-citationDYNAMIC DISPATCHING STRATEGIES UNDER REAL-TIME INFORMATION FOR CARRIER FLEET MANAGEMENT
Regan, A., Mahmassani, H. S., & Jaillet, P. (1996) · Cited by 17
Self-citation
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
Optimization for dynamic ride-sharing: A review
Agatz, N., Erera, A., Savelsbergh, M., & Wang, X. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.05.028 · Cited by 1,008
Quantifying the benefits of vehicle pooling with shareability networks
Santi, P., Resta, G., Szell, M., Sobolevsky, S., Strogatz, S. H., & Ratti, C. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1403657111 · Cited by 745
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
Metadata
- Authors
- Yang, J., Jaillet, P., & Mahmassani, H.
- Venue
- Transportation Science
- Published
- 2004-05
- Volume
- 38
- Issue
- 2
- Pages
- 135-148
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2164674071
- Cited by
- 280
- References
- 24
- FWCI
- 48.41
- 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.