52 search results - page 10 / 11 » Parallel Ant Colony Optimization for the Traveling Salesman ... |
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Search (PGLS) framework for dealing with difficult combinatorial optimization problem...
PVM
2004
Springer
14 years 25 days 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....
KES
2007
Springer
14 years 1 months ago
2007
Springer
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...
DCOSS
2011
Springer
12 years 7 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
WAOA
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...