The DOI matches its Crossref record.
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Abstract
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a shared service. The problem consists of designing a set of minimum-cost vehicle routes satisfying capacity, duration, time window, pairing, precedence, and ride-time constraints. This paper introduces a mixed-integer programming formulation of the problem and a branch-and-cut algorithm. The algorithm uses new valid inequalities for the dial-a-ride problem as well as known valid inequalities for the traveling salesman, the vehicle routing, and the pick-up and delivery problems. Computational experiments performed on randomly generated instances show that the proposed approach can be used to solve small to medium-size instances.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Shared autonomous vehicle services: A comprehensive review
Narayanan, S., Chaniotakis, E., & Antoniou, C. (2020) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.12.008 · Cited by 691
Congestion-aware system optimal route choice for shared autonomous vehicles
Levin, M. W. (2017) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2017.06.020 · Cited by 152
Multiblock ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
Gambella, C., & Simonetto, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3033139 · Cited by 60
Dynamic shared autonomous taxi system considering on-time arrival reliability
Liu, Z., Miwa, T., Zeng, W., Bell, M. G. H., & Morikawa, T. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.04.018 · Cited by 48
Metadata
- Authors
- Cordeau, J.-F.
- Venue
- Operations Research
- Published
- 2006-06
- Volume
- 54
- Issue
- 3
- Pages
- 573-586
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2051358678
- Cited by
- 695
- References
- 0
- FWCI
- 50.23
- 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.
