The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Mitigating Traffic Congestion: Solving the Ride-Matching Problem by Bee Colony Optimization
Open accessAbstract
Urban road networks in many countries are severely congested. Expanding traffic network capacities by building more roads is very costly as well as environmentally damaging. Researchers, planners, and transportation professionals have developed various Travel Demand Management (TDM) techniques, i.e. strategies that increase travel choices to travelers. Ride sharing is one of the widely used TDM techniques that assumes the participation of two or more persons that together share a vehicle when traveling from few origins to few destinations. In ride-matching systems, commuters wishing to participate in ride sharing are matched by where they live and work, and by their work schedule. There is no standard method in the open literature to determine the best ride-matching method. In this paper, an attempt has been made to develop the methodology capable to solve the ride-matching problem. The proposed Bee Colony Optimization Metaheuristic is sufficiently general and could be applied to various combinatorial optimization problems.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Finally Teodorovic and Dell'Orco (2008) propose a bee colony optimization metaheuristic and test it in a real case with 97 traveler in Trani, a small attractive city in the south-east of Italy, to Bari, the regional capital of Puglia.”
From PoliUniPool: a carpooling system for universities (2011) · cites this paper as Teodorovic and Dell'Orco (2008)
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
Zadeh, L. A. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90241-x · Cited by 67,855
Zadeh, L. A. (1996) · Cited by 46,846
Outline of a New Approach to the Analysis of Complex Systems and Decision Processes
Zadeh, L. A. (1973) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1973.5408575 · Cited by 8,789
Bonabeau, E. W., Dorigo, M., & Théraulaz, G. (1999) · Oxford University Press eBooks · doi:10.1093/oso/9780195131581.001.0001 · Cited by 6,668
CONGESTION THEORY AND TRANSPORT INVESTMENT
Vickrey, W. S. (1969) · American Economic Review · Cited by 2,007
Transportation Research: Proceedings of CTRG 2017
(2019) · Lecture notes in civil engineering · doi:10.1007/978-981-32-9042-6 · Cited by 854
A model of collective nectar source selection by honey bees: Self-organization through simple rules
Camazine, S. M., & Sneyd, J. (1991) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(05)80098-0 · Cited by 251
The concept of cellular robotic system
Beni, G. (2003) · The proceedings of the IEEE Conference on Control Applications/The proceedings of the ... IEEE Conference on Control Applications · doi:10.1109/isic.1988.65405 · Cited by 233
Computing with Bees: Attacking Complex Transportation Engineering Problems
Lučić, P., & Teodorović, D. (2003) · International Journal of Artificial Intelligence Tools · doi:10.1142/s0218213003001289 · Cited by 189
Self-citationThe tremble dance of the honey bee: message and meanings
Seeley, T. D. (1992) · Behavioral Ecology and Sociobiology · doi:10.1007/bf00170604 · Cited by 167
Research works printed but not linked: 5
- Beni G., 1989, Proceedings Seventh Annual Meeting of the Robotics Society of Japan, 425
- Lučić P., 2001, The Preprints of the TRISTAN IV Triennial Symposium on Transportation Analysis, 441
- Phang S. Y., 2004, Transportation, 43, 16
- Vickrey W., 1969, American Economic Review (Papers and Proceedings), 59, 251
- Yang H., 1999, Transportation Research, 33, 139
Cited by
PoliUniPool: a carpooling system for universities
Bruglieri, M., Ciccarelli, D., Colorni, A., & Luè, A. (2011) · Procedia - Social and Behavioral Sciences · doi:10.1016/j.sbspro.2011.08.062 · Cited by 66
Hansen, E. G., Gomm, M. L., Bullinger, A. C., & Moslein, K. M. (2010) · International Journal of Innovation and Sustainable Development · doi:10.1504/ijisd.2010.034559 · Cited by 35
Metadata
- Authors
- Teodorović, D., & Dell’ Orco, M.
- Affiliations
- University of Belgrade (RS)
- Corresponding author
- Teodorović, Dušan
- ORCID
- Teodorović, Dušan
- Venue
- Transportation Planning and Technology
- Publisher
- Informa UK Limited
- Published
- 2008-04
- Volume
- 31
- Issue
- 2
- Pages
- 135-152
- ISSN
- 0308-1060 (ISSN-L)
- 1029-0354
- OpenAlex
- W2008305447
- Cited by
- 91
- References
- 25
- Citations by year
- 2024: 3 · 2023: 3 · 2022: 2 · 2021: 7 · 2020: 7 · 2019: 4 · 2018: 4 · 2017: 5 · 2016: 4 · 2015: 7 · 2014: 7 · 2013: 12 · 2012: 5
- FWCI
- 17.23
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Transportation Planning and Technology (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Topics
- Social Sciences › Transportation › Transportation and Mobility Innovations
- Social Sciences › Transportation › Transportation Planning and Optimization
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
- Keywords
- ride matching, ride-sharing, traffic congestion, travel demand management, bee colony optimization, metaheuristic optimization, combinatorial optimization, urban road networks, vehicle sharing
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.
