2011
DOI: 10.3141/2214-07
|View full text |Cite
|
Sign up to set email alerts
|

Application of Complex Network Theory and Genetic Algorithm in Airline Route Networks

Abstract: To cope with increasing customer demand and market changes, airline companies need to organize and manage their route networks in a more cost-efficient way. In addition, the robustness of flight operations against unpredictable accidents such as terrorist attacks and natural disasters has become more important to airlines. In this study, the concepts and techniques from complex network theory are used to model airline route networks, and then an effective and efficient genetic algorithm is developed to optimiz… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
15
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 28 publications
(15 citation statements)
references
References 18 publications
0
15
0
Order By: Relevance
“…Computation of demand matrices. Compute total demand q l ð Þ rs according to elastic demand function Equation (26) and use the logit-based mode choice model, that is, Equation (22)…”
Section: Solution Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Computation of demand matrices. Compute total demand q l ð Þ rs according to elastic demand function Equation (26) and use the logit-based mode choice model, that is, Equation (22)…”
Section: Solution Algorithmmentioning
confidence: 99%
“…In this paper, however, to solve the sensitivities from the VI program Equation (39) is very difficult in view of the complexity of the formulation. Compared with some other algorithms such as projection-based algorithm, descent algorithm, or penalty function approach, GA would still be a straightforward and effective method to solve the bi-level problem, which has been proven in many existing literatures (Liu et al [26]). Thus, in this paper, the GA is adopted for its simplicity and effectiveness.…”
mentioning
confidence: 99%
“…As large-scale parallel stochastic search and optimization algorithms, genetic algorithms (GAs), if properly designed, have the capability of producing high quality solutions to NP-hard problems in an acceptable period of time [19]. Actually, GAs have already been used to optimize some network structures, for example, the topology optimization of CCS7 network [20], MPLS network [21] and airline route networks [22]. However, in such studies on network topology optimization, search is carried out by directly adding new links or removing existing links between nodes.…”
Section: Optimize Network Topology By Evolving Model Parametersmentioning
confidence: 99%
“…As is well known, permutation representation based GAs are often confronted with feasibility problems, which means random evolutionary operations, such as mutation and crossover, may generate some chromosomes whose associated solutions are invalid or infeasible against the underlying physical meaning of a real-world solution. For example, in the case of airline route network optimization, permutation representation based GA might establish a link between two very close cities, which is economically impracticable [22]. The RSNM makes it possible to discard permutation representation based GA, and to employ the very original binary representation based GA for network topology optimization.…”
Section: Optimize Network Topology By Evolving Model Parametersmentioning
confidence: 99%
“…Other studies have analyzed the robustness of air transport network in order to determine which airports can be considered critical if they were to cease operations. That stream of research considers the regional (Lacasa et al, 2009;Liu et al, 2011) or global (Lordan et al, 2014b) levels of analysis. Finally, Cento (2009); Reggiani et al (2010) and Lordan (2014) have addressed the study of route networks of individual airlines, and Lordan et al (2015) has analyzed the robustness of airline alliance route networks.…”
Section: Introductionmentioning
confidence: 99%