The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Ant colony optimization for resource-constrained project scheduling
Open accessAbstract
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general are proposed and evaluated. In particular, the use of a combination of two pheromone evaluation methods by the ants to find new solutions, a change of the influence of the heuristic on the decisions of the ants during the run of the algorithm, and the option that an elitist ant forgets the best-found solution are studied. We tested the ACO algorithm on a set of large benchmark problems from the Project Scheduling Library. Compared to several other heuristics for the RCPSP, including genetic algorithms, simulated annealing, tabu search, and different sampling methods, our algorithm performed best on average. For nearly one-third of all benchmark problems, which were not known to be solved optimally before, the algorithm was able to find new best solutions.
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
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
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
Resource-constrained project scheduling: Notation, classification, models, and methods
Brucker, P., Drexl, A., Möhring, R., Neumann, K., & Pesch, E. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00204-5 · Cited by 1,500
The Ant Colony Optimization Metaheuristic
(2004) · Ant Colony Optimization · doi:10.7551/mitpress/1290.003.0004 · Cited by 1,406
Kolisch, R. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00357-6 · Cited by 705
Ant system for Job-shop Scheduling
Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1994) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 617
A competitive genetic algorithm for resource-constrained project scheduling
Hartmann, S. (1998) · Naval Research Logistics · doi:10.1002/(sici)1520-6750(199810)45:7<733::aid-nav5>3.0.co;2-c · Cited by 568
A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling
Davis, E. W., & Patterson, J. H. (1975) · Management Science · doi:10.1287/mnsc.21.8.944 · Cited by 454
Ant Colony Optimization for the Total Weighted Tardiness Problem
den Besten, M., Stützle, T., & Dorigo, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_60 · Cited by 219
Project Scheduling under Resource Constraints
Kolisch, R. (1995) · Physica-Verlag eBooks · doi:10.1007/978-3-642-50296-5 · Cited by 168
An ant colony optimization approach for the single machine total tardiness problem
Bauer, A., Bullnheimer, B., Hartl, R. F., & Strauß, C. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.782653 · Cited by 129
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Merkle, D., & Middendorf, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45561-2_28 · Cited by 125
Self-citationResource-constrained project scheduling: A critical activity reordering heuristic
Valls, V., Quintanilla, S., & Ballestín, F. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00768-3 · Cited by 120
ANT COLONY OPTIMISATION FOR JOB SHOP SCHEDULING
Zwaan, S. V., & Marques, C. K. D. M. (1998) · Cited by 47
Cited by
Ant colony optimization: Introduction and recent trends
Blum, C. (2005) · Physics of Life Reviews · doi:10.1016/j.plrev.2005.10.001 · Cited by 1,308
Ant Colony Optimization: Overview and Recent Advances
Dorigo, M., & Stützle, T. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_10 · Cited by 722
Chemical-Reaction-Inspired Metaheuristic for Optimization
Lam, A. Y. S., & Li, V. O. K. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033580 · Cited by 587
Ant Colony Optimization: Overview and Recent Advances
Dorigo, M., & Stützle, T. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_8 · Cited by 579
A Multiple Agile Satellite Staring Observation Mission Planning Method for Dense Regions
Huang, W., Wang, H., Yi, D., Wang, S., Zhang, B., & Cui, J. (2023) · Remote Sensing · doi:10.3390/rs15225317 · Cited by 19
Metadata
- Authors
- Merkle, D., Middendorf, M., & Schmeck, H.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2002-08
- Volume
- 6
- Issue
- 4
- Pages
- 333-346
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W118692873
- Cited by
- 759
- References
- 15
- FWCI
- 41.69
- Type
- journal article
- Language
- en
- Open access
- green
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.