The Efficient Computation of Aircraft Range Problem

The goal of efficient computation is to determine reasonable computing cost in polynomial time by using data structure of instance, and analyze the computing cost of satisfactory solution which can meet user’s requirements. When faced with NP-hard problem, we usually assess computational performance...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Acta Mathematicae Applicatae Sinica Ročník 35; číslo 4; s. 862 - 872
Hlavní autori: Yu, Fang, Cui, Jin-chuan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2019
Springer Nature B.V
Vydanie:English series
Predmet:
Aircraft
Algorithms
Applications of Mathematics
Clusters
Complexity theory
Computational efficiency
Computing costs
Cost analysis
Data structures
Math Applications in Computer Science
Mathematical and Computational Physics
Mathematics
Mathematics and Statistics
Nonlinear programming
Polynomials
Theoretical
68Q15
cluster
68Q25
aircraft range problem
efficient computation mechanism
68Q17
90C27
05A05
computational complexity
ISSN:0168-9673, 1618-3932
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The goal of efficient computation is to determine reasonable computing cost in polynomial time by using data structure of instance, and analyze the computing cost of satisfactory solution which can meet user’s requirements. When faced with NP-hard problem, we usually assess computational performance in the worst case. Polynomial algorithm cannot handle with NP-hard problem, so we research on NP-hard problem from efficient computation point of view. The work is intended to fill the blank of computational complexity theory. We focus on the cluster structure of instance data of aircraft range problem. By studying the partition and complexity measurement of cluster, we establish a connection between the aircraft range problem and N-vehicle exploration problem, and construct the efficient computation mechanism for aircraft range problem. The last examples show that the effect is significant when we use efficient computation mechanism on aircraft range problem. Decision makers can calculate the computing cost before actually computing.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0168-9673
1618-3932
DOI:10.1007/s10255-019-0858-y