Heuristics for Two Depot Heterogeneous Unmanned Vehicle Path Planning to Minimize Maximum Travel Cost
A solution to the multiple depot heterogeneous traveling salesman problem with a min-max objective is in great demand with many potential applications of unmanned vehicles, as it is highly related to a reduction in the job completion time. As an initial idea for solving the min-max multiple depot he...
Main Authors: | Jungyun Bae, Woojin Chung |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-05-01
|
Series: | Sensors |
Subjects: | |
Online Access: | https://www.mdpi.com/1424-8220/19/11/2461 |
Similar Items
-
A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM
by: F. NURIYEVA, et al.
Published: (2017-06-01) -
Ant Colony Hyper-heuristics for Travelling Salesman Problem
by: Abd Aziz, Z
Published: (2015) -
Application of Fuzzy Sets for the Improvement of Routing Optimization Heuristic Algorithms
by: Mattas Konstantinos, et al.
Published: (2016-12-01) -
On Sequential Heuristic Methods for the Maximum Independent Set Problem
by: Lê Ngoc C., et al.
Published: (2017-05-01) -
Ant Colony Hyper-heuristics for Travelling Salesman Problem
by: Aziz, Z.A, et al.
Published: (2015)