Hybrid Taboo Search Algorithm of Basic Network Planning for Transit Corridor in Air Battlefield
The solution of SUMApHMP model has a certain difficulty while not considering the transit corridor(TC) basic network in air battlefield, so a hybrid taboo search algorithm based on Floyd shortest path algorithm is proposed to control the airspace in battlefield effectively, and ensure the safe, effi...
Main Authors: | Liu Ying, Zhou Yiye, Gan Xusheng, Yang Jie |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Advances in Aeronautical Science and Engineering
2019-12-01
|
Series: | Hangkong gongcheng jinzhan |
Subjects: | |
Online Access: | http://hkgcjz.cnjournals.com/hkgcjz/article/abstract/2018166?st=article_issue |
Similar Items
-
Iterative Algorithm for Finding the Shortest Ways in an Unweighted Undirected Graph
by: Valentin Sysoev
Published: (2021-09-01) -
An Algorithm for the Cycled Shortest Path Problem
by: Asghar Aini, et al.
Published: (2011-06-01) -
Evaluation of Shortest Paths in Road Network
by: Farrukh Shehzad, et al.
Published: (2009-06-01) -
Generalized blocked Floyd – Warshall algorithm
by: Nikolai A. Likhoded
Published: (2019-11-01) -
Military route planning in battlefield simulation: effectiveness problems and potential solutions
by: Zbigniew Tarapata
Published: (2003-12-01)