206 search results - page 6 / 42 » Ant colony optimization and the minimum cut problem |
82
Voted
IAT
2003
IEEE
15 years 3 months 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 ...
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...
GECCO
2006
Springer
15 years 1 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...
ASIAN
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
99
Voted
KES
2007
Springer
15 years 3 months ago
2007
Springer
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...