Sciweavers

201 search results - page 31 / 41
» Algorithms for the On-Line Quota Traveling Salesman Problem
Sort
View
IEAAIE
2005
Springer
14 years 1 months ago
The Coordination of Parallel Search with Common Components
The preservation of common components has been recently isolated as a beneficial feature of genetic algorithms. One interpretation of this benefit is that the preservation of commo...
Stephen Chen, Gregory Pitt
IAT
2008
IEEE
14 years 2 months ago
An Improved Discrete Particle Swarm Optimization Based on Cooperative Swarms
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...
Yiheng Xu, Qiangwei Wang, Jinglu Hu
HM
2009
Springer
145views Optimization» more  HM 2009»
14 years 9 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...
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...
SSD
2007
Springer
132views Database» more  SSD 2007»
14 years 1 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...