178 search results - page 11 / 36 » Improving Ant Colony Optimization Algorithms for Solving Tra... |
EVOW
2010
Springer
13 years 11 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
IAT
2003
IEEE
14 years 24 days ago
2003
IEEE
—Ant-based algorithms or ant colony optimization (ACO) algorithms have been applied successfully to combinatorial optimization problems. More recently, Parpinelli and colleagues ...
PPSN
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper deals with transport user equilibrium. A modified version of the ant colony system is proposed where the ant colony heuristic is adapted in order to take into account a...
AI
2003
Springer
14 years 22 days ago
2003
Springer
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...