Sciweavers

Share
IJAMCIGI
2010
94views more  IJAMCIGI 2010»
8 years 5 months ago
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
Jean-Philippe Hamiez, Jin-Kao Hao, Fred W. Glover
COR
2011
8 years 5 months ago
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
Kerem Bülbül
ANOR
2011
158views more  ANOR 2011»
8 years 5 months ago
Hybrid scatter tabu search for unconstrained global optimization
Abstract The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances ...
Abraham Duarte, Rafael Martí, Fred Glover, ...
IEAAIE
2010
Springer
8 years 8 months ago
Tabu Search with Consistent Neighbourhood for Strip Packing
This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistent neighborhood, a fitness function including problem k...
Giglia Gómez-Villouta, Jean-Philippe Hamiez...
ATMOS
2010
162views Optimization» more  ATMOS 2010»
8 years 8 months ago
Heuristics for the Traveling Repairman Problem with Profits
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits ...
SAT
2010
Springer
172views Hardware» more  SAT 2010»
8 years 8 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
PRL
2010
159views more  PRL 2010»
8 years 8 months ago
Creating diverse nearest-neighbour ensembles using simultaneous metaheuristic feature selection
The nearest-neighbour (1NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good res...
Muhammad Atif Tahir, Jim E. Smith
TSMC
2002
137views more  TSMC 2002»
8 years 10 months ago
An evolutionary tabu search for cell image segmentation
Many problems in practically all fields of science, engineering and technology involve global optimization. It becomes more and more important to develop the efficient global opti...
Tianzi Jiang, Faguo Yang
HEURISTICS
2002
155views more  HEURISTICS 2002»
8 years 10 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
HEURISTICS
2002
122views more  HEURISTICS 2002»
8 years 10 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
books