Details

Autor(en) / Beteiligte

• Amodeo, Lionel
• Talbi, El-Ghazali
• Yalaoui, Farouk

Titel

Theory Driven Design of Efficient Genetic Algorithms for a Classical Graph Problem

Ist Teil von

• Recent Developments in Metaheuristics, 2018, Vol.62, p.125-140

Ort / Verlag

Switzerland: Springer International Publishing AG

Erscheinungsjahr

2018

Link zum Volltext

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• This paper presents a principled way of designing a Genetic algorithm genetic algorithm which can guarantee a rigorously proven upper bound on its optimization time. The shortest path problem Shortest path problem is selected to demonstrate how level-based analysis, a general purpose analytical tool, can be used as a design guide. We show that level-based analysis can also ease the experimental burden of finding appropriate parameter settings. Apart from providing an example of theory-driven algorithmic design, we also provide the first runtime analysis of a non-elitist population-based evolutionary algorithm for both the single-source and all-pairs shortest path problems.