Sciweavers

51 search results - page 7 / 11
» On Random Symmetric Travelling Salesman Problems
Sort
View
WSC
1998
13 years 8 months ago
Reactive Tabu Search in Unmanned Aerial Reconnaissance Simulations
We apply a Reactive Tabu Search (RTS) heuristic within a discrete-event simulation to solve routing problems for Unmanned Aerial Vehicles (UAVs). Our formulation represents this p...
Joel L. Ryan, T. Glenn Bailey, James T. Moore, Wil...
ANTSW
2004
Springer
14 years 3 days ago
S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
Walter J. Gutjahr
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
13 years 5 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
DAM
2006
89views more  DAM 2006»
13 years 6 months ago
First vs. best improvement: An empirical study
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first impr...
Pierre Hansen, Nenad Mladenovic
ICASSP
2011
IEEE
12 years 10 months ago
Short and smooth sampling trajectories for compressed sensing
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...
Rebecca M. Willett