Approximation Algorithms and Heuristics for a Heterogeneous Traveling Salesman Problem
Unmanned Vehicles (UVs) are developed for several civil and military applications. For these applications, there is a need for multiple vehicles with different capabilities to visit and monitor a set of given targets. In such scenarios, routing problems arise naturally where there is a need to plan...
Main Author: | Rangarajan, Rahul |
---|---|
Other Authors: | Rathinam, Sivakumar |
Format: | Others |
Language: | en_US |
Published: |
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9100 |
Similar Items
-
Implementasi Algoritma Cheapest Insertion Heuristic (CIH) dalam Penyelesaian Travelling Salesman Problem (TSP)
by: Rio Guntur Utomo, et al.
Published: (2018-06-01) -
A Survey of Recent Extended Variants of the Traveling Salesman and Vehicle Routing Problems for Unmanned Aerial Vehicles
by: Ines Khoufi, et al.
Published: (2019-08-01) -
Solving Traveling Salesman Problem With a non-complete Graph
by: Emami Taba, Mahsa Sadat
Published: (2010) -
Solving Traveling Salesman Problem With a non-complete Graph
by: Emami Taba, Mahsa Sadat
Published: (2010) -
PENYELESAIAN TRAVELLING SALESMAN PROBLEM DENGAN ALGORITMA CHEAPEST INSERTION HEURISTICS DAN BASIS DATA
by: Kusrini Kusrini, et al.
Published: (2007-01-01)