The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
Abstract
Car pooling is a transportation service organized by a large company which encourages its employees to pick up colleagues while driving to/from work to minimize the number of private cars travelling to/from the company site. The car pooling problem consists of defining the subsets of employees that will share each car and the paths the drivers should follow, so that sharing is maximized and the sum of the path costs is minimized. The special case of the car pooling problem where all cars are identical can be modeled as a Dial-a-Ride Problem. In this paper, we propose both an exact and a heuristic method for the car pooling problem, based on two integer programming formulations of the problem. The exact method is based on a bounding procedure that combines three lower bounds derived from different relaxations of the problem. A valid upper bound is obtained by the heuristic method, which transforms the solution of a Lagrangean lower bound into a feasible solution. The computational results show the effectiveness of the proposed methods.
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
Cites
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Research works printed but not linked: 23
- 10.1007/BF02085634 · doi:10.1007/bf02085634
- 10.1016/S0305-0548(00)00072-1 · doi:10.1016/s0305-0548(00)00072-1
- 10.1080/10556789408805563 · doi:10.1080/10556789408805563
- Bianco L., 1994, INFOR, 32, 19
- 10.1057/jors.1969.75 · doi:10.1057/jors.1969.75
- Christofides N., 1979, Combinatorial Optimization, 315
- 10.1002/net.3230110207 · DOI
- 10.1137/1.9780898718515.ch7 · doi:10.1137/1.9780898718515.ch7
- 10.1137/1.9780898718515.ch9 · doi:10.1137/1.9780898718515.ch9
- 10.1080/01966324.1986.10737198 · doi:10.1080/01966324.1986.10737198
- 10.1016/0377-2217(91)90319-Q · DOI · Paper page
- 10.1287/opre.37.2.319 · doi:10.1287/opre.37.2.319
- 10.1287/opre.42.4.626 · doi:10.1287/opre.42.4.626
- 10.1287/trsc.33.1.101 · DOI
- 10.1007/s10107-002-0336-8 · doi:10.1007/s10107-002-0336-8
- 10.1007/BF02031946 · DOI
- 10.1287/trsc.33.3.315 · doi:10.1287/trsc.33.3.315
- 10.1287/opre.45.3.365 · doi:10.1287/opre.45.3.365
- 10.1287/opre.47.6.873 · DOI
- 10.1287/trsc.14.2.130 · DOI · Paper page
- 10.1016/0191-2615(83)90041-3 · doi:10.1016/0191-2615(83)90041-3
- 10.1287/opre.46.4.474 · DOI · Paper page
- 10.1287/trsc.31.1.60 · doi:10.1287/trsc.31.1.60
Cited by
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
Crowdsourced Delivery—A Dynamic Pickup and Delivery Problem with Ad Hoc Drivers
Arslan, A. M., Agatz, N., Kroon, L., & Zuidwijk, R. (2019) · Transportation Science · doi:10.1287/trsc.2017.0803 · Cited by 511
Real-Time City-Scale Taxi Ridesharing
Ma, S., Zheng, Y., & Wolfson, O. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2334313 · Cited by 329
The benefits of meeting points in ride-sharing systems
Stiglic, M., Agatz, N., Savelsbergh, M., & Gradisar, M. (2015) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2015.07.025 · Cited by 321
A survey of models and algorithms for optimizing shared mobility
Mourad, A., Puchinger, J., & Chu, C. (2019) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2019.02.003 · Cited by 309
Metadata
- Authors
- Baldacci, R., Maniezzo, V., & Mingozzi, A.
- Venue
- Operations Research
- Published
- 2004-06
- Volume
- 52
- Issue
- 3
- Pages
- 422-439
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2145569785
- Cited by
- 245
- References
- 1
- FWCI
- 7.11
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation. https://app.cochat.ai/papers/10.1287/opre.1030.0106
- The paper
- Baldacci, R., Maniezzo, V., & Mingozzi, A. (2004). An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation. Operations Research. https://doi.org/10.1287/opre.1030.0106
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.