The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
Open accessAbstract
Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are being applied successfully to complex engineering and combinatorial optimization problems, and it is very important that we understand the computational complexity of these algorithms. This tutorials explains the most important results achieved in this area.The presenters show how runtime behavior can be analyzed in a rigorous way, in particular for combinatorial optimization. They present well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems. Classical single objective optimization is examined first. They then investigate the computational complexity of bioinspired computation applied to multiobjective variants of the considered combinatorial optimization problems, and in particular they show how multiobjective optimization can help to speed up bioinspired computation for single-objective optimization problems.The tutorial is based on a book written by the authors with the same title. Further information about the book can be found at www.bioinspiredcomputation.com.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
Bounds on Multiprocessing Timing Anomalies
Graham, R. L. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117039 · Cited by 2,443
Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution
Rechenberg, I. (1973) · Frommann-Holzboog eBooks · Cited by 2,440
How to Solve It: Modern Heuristics
Michalewicz, Z., & Fogel, D. B. (2000) · Springer eBooks · doi:10.1007/978-3-662-04131-4 · Cited by 2,207
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
Laumanns, M., Thiele, L., Deb, K., & Zitzler, E. (2002) · Evolutionary Computation · doi:10.1162/106365602760234108 · Cited by 1,487
Stochastic Local Search: Foundations & Applications
Hoos, H. H., & St�tzle, T. (2004) · Medical Entomology and Zoology · Cited by 1,227
Raz, R., & Safra, S. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258641 · Cited by 834
Swinscow, T. D. V., & Campbell, M. J. (1976) · Cited by 757
A Survey of Constraint Handling Techniques in Evolutionary Computation Methods
Michalewicz, Z. (1995) · Evolutionary Programming IV · doi:10.7551/mitpress/2887.003.0018 · Cited by 499
Generating random spanning trees more quickly than the cover time
Wilson, D. B. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237880 · Cited by 487
On the approximability of trade-offs and optimal access of Web sources
Papadimitriou, C. H., & Yannakakis, M. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892068 · Cited by 458
A randomized linear-time algorithm to find minimum spanning trees
Karger, D. R., Klein, P. N., & Tarjan, R. E. (1995) · Journal of the ACM · doi:10.1145/201019.201022 · Cited by 406
How Genetic Algorithms Really Work: Mutation and Hillclimbing.
Mühlenbein, H. (1992) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 365
Ant colony optimization for real-world vehicle routing problems: From theory to applications
Rizzoli, A. E., Montemanni, R., Lucibello, E., & Gambardella, L. M. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0005-x · Cited by 202
Engineering Highway Hierarchies
Sanders, P., & Schultes, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11841036_71 · Cited by 172
Jansen, T., & Wegener, I. (2001) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.974841 · Cited by 141
A Better Approximation Ratio for the Vertex Cover Problem
Karakostas, G. (2005) · Lecture notes in computer science · doi:10.1007/11523468_84 · Cited by 112
Neumann, F. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.08.005 · Cited by 101
Self-citationMathematical runtime analysis of ACO algorithms: survey on an emerging issue
Gutjahr, W. J. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0001-1 · Cited by 56
Algorithms and data structures
Sanders, P., & Mehlhorn, K. (1984) · Cited by 55
Running Time Analysis of ACO Systems for Shortest Path Problems
Horoba, C., & Sudholt, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03751-1_6 · Cited by 27
Maximum cardinality matchings on trees by randomized local search
Giel, O., & Wegener, I. (2006) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1143997.1144095 · Cited by 15
Cited by
Bio-inspired computation: Where we stand and what's next
Del Ser, J., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.008 · Cited by 593
Benchmarking in Optimization: Best Practice and Open Issues
Bartz-Beielstein, T., Doerr, C., Berg, D. V. D., Bossek, J., Chandrasekaran, S., Eftimov, T., Fischbach, A., Kerschke, P., La Cava, W., Lopez-Ibanez, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2007.03488 · Cited by 214
Metadata
- Authors
- Neumann, F., & Witt, C.
- Venue
- Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
- Publisher
- ACM
- Published
- 2012-07-07
- Pages
- 1035-1058
- OpenAlex
- W2100137329
- Cited by
- 319
- References
- 31
- FWCI
- 27.21
- 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.