178 search results - page 10 / 36 » Improving Ant Colony Optimization Algorithms for Solving Tra... |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
In order to maintain a reliable and economic electric power supply, the maintenance of power plants is becoming increasingly important. In this paper, a formulation that enables a...
IJON
2008
13 years 7 months ago
2008
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
EVOW
2011
Springer
2011
Springer
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
12 years 11 months ago
The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of th...
CCE
2004
13 years 7 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
LION
2009
Springer
14 years 2 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...