38 search results - page 6 / 8 » Structure and metaheuristics |
ANOR
2010
13 years 10 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
HEURISTICS
2002
13 years 9 months ago
2002
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...
ICANN
2009
Springer
14 years 2 months ago
2009
Springer
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
EOR
2006
13 years 9 months ago
2006
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
EUSFLAT
2009
2009
Ant Colony Optimization for Distributed Routing Path Optimization in Optical Burst-Switched Networks
13 years 7 months ago
This work describes a distributed framework for routing path optimization in Optical Burst-Switched (OBS) networks that loosely mimics the foraging behaviour of ants observed in na...