178 search results - page 19 / 36 » Improving Ant Colony Optimization Algorithms for Solving Tra... |
178
click to vote
EVOW
2009
Springer
16 years 7 days ago
2009
Springer
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...
146
click to vote
COR
2007
15 years 5 months ago
2007
In this paper we present an ant-based algorithm for solving unconstrained multi-level lot-sizing problems called ant system for multi-level lot-sizing algorithm (ASMLLS). We apply...
174
click to vote
HEURISTICS
2006
15 years 5 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
153
click to vote
PG
2007
IEEE
15 years 11 months ago
2007
IEEE
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
148
click to vote
ANTSW
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...