Sciweavers

599 search results - page 40 / 120
» The traveling salesman problem
Sort
View
HM
2009
Springer
145views Optimization» more  HM 2009»
14 years 15 days 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...
WOB
2004
134views Bioinformatics» more  WOB 2004»
13 years 9 months ago
Reconstruction of Phylogenetic Trees using the Ant Colony Optimization Paradigm
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
Heitor S. Lopes, Mauricio Perretto
CEC
2010
IEEE
13 years 9 months ago
Population-Based Guided Local Search: Some preliminary experimental results
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Search (PGLS) framework for dealing with difficult combinatorial optimization problem...
Nasser Tairan, Qingfu Zhang
SSD
2007
Springer
132views Database» more  SSD 2007»
14 years 2 months ago
Computing a k -Route over Uncertain Geographical Data
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...
Eliyahu Safra, Yaron Kanza, Nir Dolev, Yehoshua Sa...
LION
2009
Springer
210views Optimization» more  LION 2009»
14 years 2 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...