tutorial

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity

Authors:

Frank Neumann,

Carsten WittAuthors Info & Claims

GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

Pages 567 - 590

https://doi.org/10.1145/2464576.2466738

Published: 06 July 2013 Publication History

Get Access

References

[1]

F. Neumann and C. Witt (2010): Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity. Springer.

Digital Library

Google Scholar

[2]

A. Auger and B. Doerr (2011): Theory of Randomized Search Heuristics -- Foundations and Recent Developments. World Scientific Publishing

Digital Library

Google Scholar

[3]

F. Neumann and I. Wegener (2007): Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science 378(1):32--40.

Digital Library

Google Scholar

[4]

O. Giel and I. Wegener (2003): Evolutionary algorithms and the maximum matching problem. Proc. of STACS '03, LNCS 2607, 415--426, Springer

Digital Library

Google Scholar

[5]

B. Doerr, E. Happ and C. Klein (2012): Crossover can provably be useful in evolutionary computation. Theoretical Computer Science 425:17--33.

Digital Library

Google Scholar

[6]

C. Witt (2005): Worst-case and average-case approximations by simple randomized search heuristics. Proc. of STACS 2005, LNCS 3404, 44--56, Springer.

Digital Library

Google Scholar

[7]

T. Friedrich, J. He, N. Hebbinghaus, F. Neumann and C. Witt (2010): Approximating covering problems by randomized search heuristics using multi-objective models. Evolutionary Computation 18(4):617--633.

Digital Library

Google Scholar

[8]

S. Kratsch and F. Neumann (2009): Fixed-parameter evolutionary algorithms and the vertex cover problem. In Proc. of GECCO 2009, 293--300. ACM.

Digital Library

Google Scholar

[9]

A. M. Sutton and F. Neumann (2012): A parameterized runtime analysis of evolutionary algorithms for the Euclidean traveling salesperson problem. Proc. of AAAI 2012.

Google Scholar

Cited By

View all

Lv ZQian CSun Y(2024)Benchmarking Analysis of Evolutionary Neural Architecture SearchIEEE Transactions on Evolutionary Computation10.1109/TEVC.2023.332485228:6(1659-1673)Online publication date: Dec-2024
https://doi.org/10.1109/TEVC.2023.3324852
Kumar KJoseph CShafi S(2024)A Comprehensive Survey on Bio-Inspired Optimization Routing Algorithms for Vehicular Ad-hoc Networks2024 8th International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)10.1109/I-SMAC61858.2024.10714651(694-699)Online publication date: 3-Oct-2024
https://doi.org/10.1109/I-SMAC61858.2024.10714651
Gadea Harder JNeumann ANeumann F(2024)Analysis of Evolutionary Diversity Optimisation for the Maximum Matching ProblemParallel Problem Solving from Nature – PPSN XVIII10.1007/978-3-031-70071-2_10(149-165)Online publication date: 14-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-70071-2_10
Show More Cited By

Index Terms

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
GECCO Comp '14: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
GECCO '12: Proceedings of the 14th annual conference companion on Genetic and evolutionary computation

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 ...
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

July 2013

1798 pages

ISBN:9781450319645

DOI:10.1145/2464576

Editor:
Christian Blum
IKERBASQUE and University of the Basque Country UPV/EHU, Spain
,
General Chair:
Enrique Alba
University of Malaga, Spain

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 July 2013

Check for updates

Author Tags

Qualifiers

Tutorial

Conference

GECCO '13

Sponsor:

SIGEVO

GECCO '13: Genetic and Evolutionary Computation Conference

July 6 - 10, 2013

Amsterdam, The Netherlands

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
579
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)6

Reflects downloads up to 18 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lv ZQian CSun Y(2024)Benchmarking Analysis of Evolutionary Neural Architecture SearchIEEE Transactions on Evolutionary Computation10.1109/TEVC.2023.332485228:6(1659-1673)Online publication date: Dec-2024
https://doi.org/10.1109/TEVC.2023.3324852
Kumar KJoseph CShafi S(2024)A Comprehensive Survey on Bio-Inspired Optimization Routing Algorithms for Vehicular Ad-hoc Networks2024 8th International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)10.1109/I-SMAC61858.2024.10714651(694-699)Online publication date: 3-Oct-2024
https://doi.org/10.1109/I-SMAC61858.2024.10714651
Gadea Harder JNeumann ANeumann F(2024)Analysis of Evolutionary Diversity Optimisation for the Maximum Matching ProblemParallel Problem Solving from Nature – PPSN XVIII10.1007/978-3-031-70071-2_10(149-165)Online publication date: 14-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-70071-2_10
Zhang YXu XZhang NZhang KDong WLi X(2023)Adaptive Aquila Optimizer Combining Niche Thought with Dispersed Chaotic SwarmSensors10.3390/s2302075523:2(755)Online publication date: 9-Jan-2023
https://doi.org/10.3390/s23020755
Zou MZhu XTian YWang JChen H(2023)PRETTYInformation Sciences: an International Journal10.1016/j.ins.2022.12.020623:C(748-766)Online publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1016/j.ins.2022.12.020
Bernardes W(2023)Optimizing TOC and IOC units of directional overcurrent relays in mutually coupled circuits using evolutionary PSOEngineering Applications of Artificial Intelligence10.1016/j.engappai.2023.106389125:COnline publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1016/j.engappai.2023.106389
Ma BLiu SHeidari A(2022)Multi-strategy ensemble binary hunger games search for feature selectionKnowledge-Based Systems10.1016/j.knosys.2022.108787248:COnline publication date: 19-Jul-2022
https://dl.acm.org/doi/10.1016/j.knosys.2022.108787
Rahman MSokkalingam ROthman MBiswas KAbdullah LAbdul Kadir E(2021)Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent AdvancesMathematics10.3390/math92026339:20(2633)Online publication date: 19-Oct-2021
https://doi.org/10.3390/math9202633
Tawhid MIbrahim A(2021)Solving nonlinear systems and unconstrained optimization problems by hybridizing whale optimization algorithm and flower pollination algorithmMathematics and Computers in Simulation10.1016/j.matcom.2021.07.010Online publication date: Jul-2021
https://doi.org/10.1016/j.matcom.2021.07.010
Tripathi DReddy BShukla A(2021)CFR: collaborative feature ranking for improving the performance of credit scoring data classificationComputing10.1007/s00607-021-01005-w104:4(893-923)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1007/s00607-021-01005-w
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity

Metaheuristics in combinatorial optimization: Overview and conceptual comparison