Sciweavers

594 search results - page 33 / 119
» Travelling Miser Problem
Sort
View
FPGA
2006
ACM
224views FPGA» more  FPGA 2006»
13 years 11 months ago
Flexible implementation of genetic algorithms on FPGAs
In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture for GA which consist...
Tatsuhiro Tachibana, Yoshihiro Murata, Naoki Shiba...
ICCHP
2004
Springer
14 years 1 months ago
proXimity: Ad-Hoc Networks for Enhanced Mobility
David tries not to use unfamiliar trains and buses, he doesn’t travel to places he doesn’t know, and he doesn’t travel in unusual environments without a companion. David is v...
Simon Harper, Stephen Pettitt, Carole A. Goble
EOR
2006
90views more  EOR 2006»
13 years 7 months ago
A parallelizable dynamic fleet management model with random travel times
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
Huseyin Topaloglu
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
14 years 13 days ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
14 years 1 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz