Sciweavers

285 search results - page 12 / 57
» Intelligent Neighborhood Exploration in Local Search Heurist...
Sort
View
ANOR
2010
102views more  ANOR 2010»
13 years 7 months ago
Ejection chain and filter-and-fan methods in combinatorial optimization
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
César Rego, Fred Glover
AIPS
2008
13 years 10 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
EVOW
2009
Springer
14 years 2 months ago
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse
We consider a real-world problem arising in a warehouse for spare parts. Items ordered by customers shall be collected and for this purpose our task is to determine efficient picku...
Matthias Prandtstetter, Günther R. Raidl, Tho...
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
14 years 1 months ago
Measuring mobility and the performance of global search algorithms
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
Monte Lunacek, L. Darrell Whitley, James N. Knight
CEC
2010
IEEE
13 years 8 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,...