Sciweavers

440 search results - page 3 / 88
» Local Search Heuristics for the Multidimensional Assignment ...
Sort
View
JAMDS
2002
155views more  JAMDS 2002»
13 years 5 months ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
14 years 11 days ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
OL
2011
190views Neural Networks» more  OL 2011»
13 years 1 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 6 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
TSMC
2002
142views more  TSMC 2002»
13 years 5 months ago
Dynamics of local search heuristics for the traveling salesman problem
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...
Weiqi Li, Bahram Alidaee