Sciweavers

1971 search results - page 27 / 395
» Tabu search - Uncharted domains
Sort
View
JAMDS
2002
155views more  JAMDS 2002»
14 years 9 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
2004
Springer
152views Optimization» more  GECCO 2004»
15 years 2 months ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj
CSC
2008
14 years 11 months ago
Multilevel Approaches applied to the Capacitated Clustering Problem
- This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aidin...
Demane Rodney, Alan Soper, Chris Walshaw
COR
2006
80views more  COR 2006»
14 years 9 months ago
Multiple crossdocks with inventory and time windows
Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consid...
Ping Chen, Yunsong Guo, Andrew Lim, Brian Rodrigue...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
15 years 3 months ago
A memetic algorithm for the low autocorrelation binary sequence problem
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
José E. Gallardo, Carlos Cotta, Antonio J. ...