Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space

Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space

Finding the shortest path of the traveling salesman problem (TSP) is a typical NP-hard problem and one of the basic optimization problems. TSP in three-dimensional space (3D-TSP) is an extension of TSP. It plays an important role in the fields of 3D path planning and UAV inspection, such as forest f...

Full description

Saved in:
Bibliographic Details
Main Authors: Hongtai Yang, Xiaoqian Lu, Xinan Zhou, Rong Zheng, Yugang Liu, Siyu Tao
Format: Article
Language:English
Published: Wiley 2022-01-01
Series:Journal of Advanced Transportation
Online Access:http://dx.doi.org/10.1155/2022/4124950
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items