Sciweavers

1171 search results - page 9 / 235
» Variable neighborhood search
Sort
View
JCO
2007
123views more  JCO 2007»
13 years 7 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
GIS
2008
ACM
14 years 8 months ago
Finding regional co-location patterns for sets of continuous variables in spatial datasets
This paper proposes a novel framework for mining regional colocation patterns with respect to sets of continuous variables in spatial datasets. The goal is to identify regions in ...
Christoph F. Eick, Jean-Philippe Nicot, Rachana Pa...
SOCO
2010
Springer
13 years 5 months ago
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
Local genetic algorithms have been designed with the aim of providing effective intensiļ¬cation. One of their most outstanding features is that they may help classical local searc...
Carlos García-Martínez, Manuel Lozan...
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
14 years 1 months ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
GECCO
2004
Springer
125views Optimization» more  GECCO 2004»
14 years 22 days ago
Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
Dirk Thierens