Sciweavers

332 search results - page 29 / 67
» Traveling salesman path problems
Sort
View
WSC
1998
13 years 9 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...
CSC
2009
13 years 9 months ago
An Empirical Analysis of Approximation Algorithms for Euclidean TSP
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
Bárbara Rodeker, M. Virginia Cifuentes, Lil...
CDC
2010
IEEE
145views Control Systems» more  CDC 2010»
12 years 11 months ago
Cooperative mission planning for a class of carrier-vehicle systems
Abstract— In this work we focus on mission planning problems in scenarios in which a carrier vehicle, typically slow but with virtually infinite range, and a carried vehicle, wh...
Emanuele Garone, Roberto Naldi, Alessandro Casavol...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 9 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
FCS
2006
13 years 9 months ago
Sub-Graphs of Complete Graph
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
Bichitra Kalita