178 search results - page 27 / 36 » Improving Ant Colony Optimization Algorithms for Solving Tra... |
PVM
2004
Springer
14 years 2 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....
NETWORKS
2007
13 years 8 months ago
2007
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
ANTSW
2006
Springer
14 years 11 days ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
WSC
2008
13 years 11 months ago
2008
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...