A Feasibility-Preserving Crossover and Mutation Operator for Constrained Combinatorial Problems

Beitrag bei einer Tagung


Details zur Publikation

Autorinnen und Autoren: Glaß M, Lukasiewycz M, Teich J
Titel Sammelwerk: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Verlag: Springer-verlag
Verlagsort: Berlin, Heidelberg
Jahr der Veröffentlichung: 2008
Titel der Reihe: Lecture Notes in Computer Science (LNCS)
Band: 5199
Heftnummer: 2008
Tagungsband: Proceedings of the 10th International Conference on Parallel Problem Solving from Nature
Seitenbereich: 919-928
ISBN: 978-3-540-87699-1
ISSN: 0302-9743


Abstract


This paper presents a feasibility-preserving crossover and mutation operator for evolutionary algorithms for constrained combinatorial problems. This novel operator is driven by an adapted Pseudo-Boolean solver that guarantees feasible offspring solutions. Hence, this allows the evolutionary algorithm to focus on the optimization of the objectives instead of searching for feasible solutions. Based on a proposed scalable testsuite, six specific testcases are introduced that allow a sound comparison of the feasibility-preserving operator to known methods. The experimental results show that the introduced approach is superior to common methods and competitive to a recent state-of-the-art decoding technique. © 2008 Springer-Verlag Berlin Heidelberg.



FAU-Autorinnen und Autoren / FAU-Herausgeberinnen und Herausgeber

Glaß, Michael Prof. Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)
Teich, Jürgen Prof. Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)


Zitierweisen

APA:
Glaß, M., Lukasiewycz, M., & Teich, J. (2008). A Feasibility-Preserving Crossover and Mutation Operator for Constrained Combinatorial Problems. In Proceedings of the 10th International Conference on Parallel Problem Solving from Nature (pp. 919-928). Dortmund, DE: Berlin, Heidelberg: Springer-verlag.

MLA:
Glaß, Michael, Martin Lukasiewycz, and Jürgen Teich. "A Feasibility-Preserving Crossover and Mutation Operator for Constrained Combinatorial Problems." Proceedings of the 10th International Conference on Parallel Problem Solving from Nature (PPSN08), Dortmund Berlin, Heidelberg: Springer-verlag, 2008. 919-928.

BibTeX: 

Zuletzt aktualisiert 2018-09-08 um 22:24