Sciweavers

115
Voted
LION
2009
Springer
210views Optimization» more  LION 2009»
15 years 7 months ago
Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows
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...
Manuel López-Ibáñez, Christia...
LION
2009
Springer
203views Optimization» more  LION 2009»
15 years 7 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
113
Voted
LION
2009
Springer
160views Optimization» more  LION 2009»
15 years 7 months ago
Corridor Selection and Fine Tuning for the Corridor Method
In this paper we present a novel hybrid algorithm, in which ideas from the genetic algorithm and the GRASP metaheuristic are cooperatively used and intertwined to dynamically adjus...
Marco Caserta, Stefan Voß
129
Voted
LION
2009
Springer
152views Optimization» more  LION 2009»
15 years 7 months ago
Comparison of Coarsening Schemes for Multilevel Graph Partitioning
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
Cédric Chevalier, Ilya Safro
LION
2009
Springer
145views Optimization» more  LION 2009»
15 years 7 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
Optimization
Top of PageReset Settings