Sciweavers

332 search results - page 27 / 67
» Traveling salesman path problems
Sort
View
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 8 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
CPAIOR
2004
Springer
14 years 1 months ago
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
Christian Artigues, Sana Belmokhtar, Dominique Fei...
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...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 2 months ago
A genetic algorithm for privacy preserving combinatorial optimization
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
Jun Sakuma, Shigenobu Kobayashi
MDM
2009
Springer
125views Communications» more  MDM 2009»
14 years 2 months ago
Data Gathering by Mobile Mules in a Spatially Separated Wireless Sensor Network
While wireless sensor networks (WSNs) are typically targeted at large-scale deployment, due to many practical or inevitable reasons, a WSN may not always remain connected. In this...
Fang-Jing Wu, Chi-Fu Huang, Yu-Chee Tseng