Sciweavers

715 search results - page 7 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
HEURISTICS
2008
153views more  HEURISTICS 2008»
13 years 7 months ago
Bringing order into the neighborhoods: relaxation guided variable neighborhood search
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
Jakob Puchinger, Günther R. Raidl
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 7 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
IAT
2007
IEEE
14 years 1 months ago
A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
Adrian Petcu, Boi Faltings
IEICET
2010
96views more  IEICET 2010»
13 years 5 months ago
An Unsupervised Optimization of Structuring Elements for Noise Removal Using GA
—To recover texture images from impulse noise by the opening operation which is one of morphological operations, an suitable structuring element (SE) has to be estimated. Hithert...
Hiroyuki Okuno, Yoshiko Hanada, Mitsuji Muneyasu, ...
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 7 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...