Solving the Flight Frequency Programming Problem with Particle Swarm Optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhan, Zhi-hui | - |
dc.contributor.author | Feng, Xin-ling | - |
dc.contributor.author | Gong, Yue-Jiao | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2023-12-08T09:33:44Z | - |
dc.date.available | 2023-12-08T09:33:44Z | - |
dc.date.issued | 2009-05 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115963 | - |
dc.description.abstract | This paper proposes a PSO-FFPP algorithm based on the particle swarm optimization (PSO) framework to solve the flight frequency programming problem (FFPP). The FFPP is to determine the flight frequency for each type of aircraft on each flight route. This problem is fundamental to an airline's operational planning because it affects the airline's profit and market share greatly. The FFPP can be formulated as an integer programming problem with constraints that is very suitable to be solved by the PSO algorithm. The proposed PSO-FFPP algorithm codes the decision variables of the FFPP with real number to represent the potential solutions and defines the optimization objective as a maximization problem for the airlines profit. A constraints handling method that combines the ideas of feasible solution preserving and infeasible solution rejection is developed. This method avoids the expense of infeasibility repair or penalty, making the algorithm simple to use and easy to extend. An integer handing process is also devised to round the real number to the nearest valid integer before feasibility check and function evaluation. This process maintains the search tendency of the PSO algorithm and can help to search in a promising region for the global optimum. The feasibility of the proposed algorithm is demonstrated and compared with the Monte Carlo method and the enumeration method on a simulation case with promising results. Experiments are also conducted to investigate the factors that affect the solution quality and computational time. | - |
dc.format.extent | 8 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE | - |
dc.title | Solving the Flight Frequency Programming Problem with Particle Swarm Optimization | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/CEC.2009.4983105 | - |
dc.identifier.scopusid | 2-s2.0-70449805379 | - |
dc.identifier.wosid | 000274803100183 | - |
dc.identifier.bibliographicCitation | 2009 IEEE Congress on Evolutionary Computation, pp 1383 - 1390 | - |
dc.citation.title | 2009 IEEE Congress on Evolutionary Computation | - |
dc.citation.startPage | 1383 | - |
dc.citation.endPage | 1390 | - |
dc.type.docType | Proceedings Paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Multidisciplinary | - |
dc.subject.keywordPlus | MULTIOBJECTIVE GENETIC ALGORITHM | - |
dc.subject.keywordPlus | MONTE-CARLO | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordPlus | POWER | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/4983105 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.