2007
DOI: 10.1016/j.ejor.2005.12.014
|View full text |Cite
|
Sign up to set email alerts
|

A multi-objective genetic algorithm for robust flight scheduling using simulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
32
0
1

Year Published

2007
2007
2021
2021

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 71 publications
(35 citation statements)
references
References 8 publications
0
32
0
1
Order By: Relevance
“…Therefore, we can obtain a solution set rather than only one solution using GA. Secondly, multi-objective genetic algorithm (MOGA) (see Deb et al, 2002) based on GA is quite suitable to solve NPHard multi-objective optimization problems. The existing research have shown that MOGA is effective in solving multi-objective problems in many fields (Mansouri, 2005;Tan et al, 2006;Lee et al, 2007Lee et al, , 2008Jozefowiez et al, 2009). Additionally, we improve the NSGA-II to enhance its effectiveness and efficiency.…”
Section: Improved Nondominated Sorting Genetic Algorithm II (Insga-ii)mentioning
confidence: 99%
“…Therefore, we can obtain a solution set rather than only one solution using GA. Secondly, multi-objective genetic algorithm (MOGA) (see Deb et al, 2002) based on GA is quite suitable to solve NPHard multi-objective optimization problems. The existing research have shown that MOGA is effective in solving multi-objective problems in many fields (Mansouri, 2005;Tan et al, 2006;Lee et al, 2007Lee et al, , 2008Jozefowiez et al, 2009). Additionally, we improve the NSGA-II to enhance its effectiveness and efficiency.…”
Section: Improved Nondominated Sorting Genetic Algorithm II (Insga-ii)mentioning
confidence: 99%
“…The problem then is solved implementing a branching algorithm. CSP is modeled as a multi-objective problem in Lee et al [4] with the objectives of minimizing the percentage of late arrivals, and flight-timecredit (FTC). The problem then is solved implementing PAES.…”
Section: Introductionmentioning
confidence: 99%
“…In our algorithm, a number of parents were selected using the roulette wheel method [12] [13]. In this method, the probability of selecting an individual was proportional to its fitness.…”
Section: Selection and Crossovermentioning
confidence: 99%
“…In this work, a GA-based method was used because it performs well for largescale problems [12] [13] and could easily be integrated with existing scheduling algorithms. However, one problem of applying GA to the given scenario was the tendency of the algorithm to get trapped in local optima, leading to very suboptimal solutions.…”
Section: Introductionmentioning
confidence: 99%