The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
An improved Ant System algorithm for theVehicle Routing Problem
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
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
Clarke, G., & Wright, J. W. (1964) · Operations Research · doi:10.1287/opre.12.4.568 · Cited by 3,894
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Optimization, Learning and Natural Algorithms
Dorigo, M. (1992) · Medical Entomology and Zoology · Cited by 3,307
Distributed Optimization by Ant Colonies
Colorni, A., Dorigo, M., Maniezzo, V., Varela, F. J., & Bourgine, P. (1992) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 2,748
A Method for Solving Traveling-Salesman Problems
Croes, G. A. (1958) · Operations Research · doi:10.1287/opre.6.6.791 · Cited by 1,570
A Tabu Search Heuristic for the Vehicle Routing Problem
Michel Gendreau, A., Hertz, A., & Gilbert Laporte, A. (1994) · Management Science · doi:10.1287/mnsc.40.10.1276 · Cited by 1,303
A Heuristic Algorithm for the Vehicle-Dispatch Problem
Gillett, B. E., & Miller, L. R. (1974) · Operations Research · doi:10.1287/opre.22.2.340 · Cited by 1,179
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Osman, I. H. (1993) · Annals of Operations Research · doi:10.1007/bf02023004 · Cited by 1,046
Cited by
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
A new Fruit Fly Optimization Algorithm: Taking the financial distress model as an example
Pan, W.-T. (2012) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.07.001 · Cited by 1,543
A genetic algorithm for the vehicle routing problem
Baker, B. M., & Ayechew, M. A. (2003) · Computers & Operations Research · doi:10.1016/s0305-0548(02)00051-5 · Cited by 883
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
Dorigo, M., & Stützle, T. (2003) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_9 · Cited by 864
Ant colony optimization techniques for the vehicle routing problem
Bell, J. E., & McMullen, P. R. (2004) · Advanced Engineering Informatics · doi:10.1016/j.aei.2004.07.001 · Cited by 712
Review of job shop scheduling research and its new perspectives under Industry 4.0
Zhang, J., Ding, G., Zou, Y., Qin, S., & Fu, J. (2019) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-017-1350-2 · Cited by 558
Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection
Doerner, K., Gutjahr, W. J., Hartl, R. F., Strauss, C., & Stummer, C. (2004) · Annals of Operations Research · doi:10.1023/b:anor.0000039513.99038.c6 · Cited by 446
Self-citationRed deer algorithm (RDA): a new nature-inspired meta-heuristic
Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R. (2020) · Soft Computing · doi:10.1007/s00500-020-04812-z · Cited by 443
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.02.053 · Cited by 430
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
Ai, T. J., & Kachitvichyanukul, V. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2008.04.003 · Cited by 419
D-Ants: Savings Based Ants divide and conquer the vehicle routing problem
Reimann, M., Doerner, K., & Hartl, R. F. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00014-5 · Cited by 387
Self-citationAn Ant Colony Optimization Algorithm for the Redundancy Allocation Problem (RAP)
Liang, Y.-C., & Smith, A. E. (2004) · IEEE Transactions on Reliability · doi:10.1109/tr.2004.832816 · Cited by 374
Artificial Intelligence techniques: An introduction to their use for modelling environmental systems
Chen, S. H., Jakeman, A. J., & Norton, J. P. (2008) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2008.01.028 · Cited by 323
The Social Engineering Optimizer (SEO)
Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R. (2018) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2018.04.009 · Cited by 279
Ant colony optimization combined with taboo search for the job shop scheduling problem
Huang, K.-L., & Liao, C.-J. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2006.07.003 · Cited by 278
Electric vehicle routing problem with recharging stations for minimizing energy consumption
Zhang, S., Gajpal, Y., Appadoo, S. S., & Abdulkader, M. M. S. (2018) · International Journal of Production Economics · doi:10.1016/j.ijpe.2018.07.016 · Cited by 277
Metadata
- Authors
- Bullnheimer, B., Hartl, R. F., & Strauss, C.
- Venue
- Annals of Operations Research
- Published
- 1999-01
- Volume
- 89
- Issue
- 0
- Pages
- 319-328
- ISSN
- 0254-5330 (ISSN-L)
- 1572-9338
- OpenAlex
- W2058569171
- Cited by
- 548
- References
- 20
- FWCI
- 40.78
- 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.