36 search results - page 6 / 8 » Bee Colony Optimization with Local Search for Traveling Sale... |
HM
2009
Springer
14 years 7 days ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
AAAI
2000
13 years 9 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
COMPSAC
2004
IEEE
13 years 11 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
PVM
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....