Sciweavers

51 search results - page 3 / 11
» The Light-Path Less Traveled
Sort
View
PPSN
2010
Springer
13 years 4 months ago
A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...
Darrell Whitley, Doug Hains, Adele E. Howe
EVOW
2004
Springer
13 years 11 months ago
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...
Wouter Boomsma
PERCOM
2011
ACM
12 years 9 months ago
Ranges of human mobility in Los Angeles and New York
—The advent of ubiquitous, mobile, personal devices creates an unprecedented opportunity to improve our understanding of human movement. In this work, we study human mobility in ...
Sibren Isaacman, Richard Becker, Ramón C&aa...
WEA
2009
Springer
103views Algorithms» more  WEA 2009»
14 years 11 days ago
Pareto Paths with SHARC
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
Daniel Delling, Dorothea Wagner
DCOSS
2011
Springer
12 years 5 months ago
STARS: Static relays for multi-robot real-time search and monitoring
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
Yuanteng Pei, Matt W. Mutka