715 search results - page 1 / 143 » Neighborhood structures for genetic local search algorithms |
KES
1998
Springer
13 years 9 months ago
1998
Springer
AAAI
2000
13 years 6 months ago
2000
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
PPL
2010
12 years 11 months ago
2010
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...
SLS
2007
Springer
13 years 11 months ago
2007
Springer
This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to ...
ICTAI
2006
IEEE
13 years 11 months ago
2006
IEEE
Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming eval...