50 search results - page 8 / 10 » An Ant Colony Optimization Algorithm for Multiple Travelling... |
ESCIENCE
2006
IEEE
14 years 1 months ago
2006
IEEE
Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a s...
IMCSIT
2010
13 years 5 months ago
2010
Ant Colony Optimization (ACO) is a stochastic search method that mimics the social behavior of real ants colonies, which manage to establish the shortest route to feeding sources a...
CEC
2003
IEEE
14 years 24 days ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Modern vehicles possess an increasing number of software and hardware components that are integrated in electronic control units (ECUs). Finding an optimal allocation for all comp...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...