Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms

DOI10.1007/978-3-540-72960-0_9zbMath1211.90216OpenAlexW1584095607MaRDI QIDQ3509425

Vincent Vidal, P. Savéant, Marc Schoenauer

Publication date: 1 July 2008

Published in: Natural Computing Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72960-0_9

zbMATH Keywords

multiobjective optimizationmemetic algorithmPareto fronthybrid algorithmlocal algorithmtemporal planningstate invariant

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational complexity of propositional STRIPS planning
• Evolutionary computing
• Recent advances in memetic algorithms.
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• REF-ARF: A system for solving problems stated as procedures
• Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms
• Introduction to evolutionary computing

This page was built for publication: Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms