275 search results - page 40 / 55 » The Attractive Traveling Salesman Problem |
IAT
2008
IEEE
15 years 4 months ago
2008
IEEE
The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an i...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Ant colony optimization (ACO) is a well known metaheuristic. In the literature it has been used for tackling many optimization problems. Often, ACO is hybridized with a local sear...
HM
2009
Springer
15 years 2 months ago
2009
Springer
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++ )....
WOB
2004
14 years 11 months ago
2004
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...
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Search (PGLS) framework for dealing with difficult combinatorial optimization problem...