Sciweavers

77 search results - page 3 / 16
» Hybrid Metaheuristics
Sort
View
EVOW
2008
Springer
13 years 10 months ago
Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem
The Prize Collecting Traveling Salesman Problem (PCTSP) can be associated to a salesman that collects a prize in each city visited and pays a penalty for each city not visited, wit...
Antonio Augusto Chaves, Luiz Antonio Nogueira Lore...
HM
2009
Springer
145views Optimization» more  HM 2009»
14 years 1 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...
JPDC
2006
133views more  JPDC 2006»
13 years 8 months ago
Grid computing for parallel bioinspired algorithms
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO
Nouredine Melab, Sébastien Cahon, El-Ghazal...
GECCO
2010
Springer
183views Optimization» more  GECCO 2010»
13 years 12 months ago
Benchmarking a MOS-based algorithm on the BBOB-2010 noisy function testbed
In this paper, a hybrid algorithm based on the Multiple Offspring Sampling framework is presented and benchmarked on the BBOB-2010 noisy testbed. MOS allows the seamless combinat...
Antonio LaTorre, Santiago Muelas, José Mar&...
HIS
2008
13 years 10 months ago
Towards a Highly Scalable Hybrid Metaheuristic for Haplotype Inference Under Parsimony
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This ...
Stefano Benedettini, Luca Di Gaspero, Andrea Roli