60 search results - page 6 / 12 » Ant Colony Optimization for dynamic Traveling Salesman Probl... |
COMPSAC
2004
IEEE
15 years 3 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
110
click to vote
ICUMT
2009
14 years 9 months ago
2009
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
108
click to vote
LION
2009
Springer
15 years 6 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...
101
click to vote
EVOW
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
160
click to vote
EVOW
2009
Springer
14 years 9 months ago
2009
Springer
In recent years, optimization in dynamic environments has attracted a growing interest from the genetic algorithm community due to the importance and practicability in real world a...