Sciweavers

472 search results - page 1 / 95
» Design of Iterated Local Search Algorithms
Sort
View
EVOW
2001
Springer
13 years 9 months ago
Design of Iterated Local Search Algorithms
In this article we investigate the application of iterated local search (ILS) to the single machine total weighted tardiness problem. Our research is inspired by the recently propo...
Matthijs den Besten, Thomas Stützle, Marco Do...
CEC
2010
IEEE
13 years 6 months ago
Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
Edmund K. Burke, Timothy Curtois, Matthew R. Hyde,...
SOCO
2010
Springer
13 years 3 months ago
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
Local genetic algorithms have been designed with the aim of providing effective intensiļ¬cation. One of their most outstanding features is that they may help classical local searc...
Carlos García-Martínez, Manuel Lozan...
ICIP
2002
IEEE
14 years 7 months ago
Packet loss protection of embedded data with fast local search
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
PPL
2010
117views more  PPL 2010»
13 years 2 days ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...