8 search results - page 1 / 2 » Beam-ACO Based on Stochastic Sampling: A Case Study on the T... |
LION
2009
Springer
13 years 11 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...
SAGA
2005
Springer
13 years 10 months ago
2005
Springer
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization ...
HICSS
2006
IEEE
13 years 10 months ago
2006
IEEE
How soon will firms form alliances with a platform provider? What factors impact the decision and the speed with which firms first move into partnerships with a platform provider ...
CP
2004
Springer
13 years 10 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
ANTSW
2004
Springer
13 years 10 months ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...