Sciweavers

715 search results - page 14 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
AAAI
2010
13 years 8 months ago
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
CEC
2007
IEEE
13 years 7 months ago
Designing memetic algorithms for real-world applications using self-imposed constraints
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
Thomas Michelitsch, Tobias Wagner, Dirk Biermann, ...
SLS
2007
Springer
100views Algorithms» more  SLS 2007»
14 years 1 months ago
EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms
Abstract. We present a software tool, called EasySyn++, for the automatic synthesis of the source code for a set of stochastic local search (SLS) algorithms. EasySyn++ uses C++ as ...
Luca Di Gaspero, Andrea Schaerf
COR
2010
177views more  COR 2010»
13 years 7 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
13 years 11 months ago
Overcoming hierarchical difficulty by hill-climbing the building block structure
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
David Iclanzan, Dan Dumitrescu