Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/109246
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Industrial and Systems Engineering | - |
dc.creator | Zhang, Q | - |
dc.creator | Chan, FTS | - |
dc.creator | Fu, X | - |
dc.date.accessioned | 2024-10-03T08:17:25Z | - |
dc.date.available | 2024-10-03T08:17:25Z | - |
dc.identifier.issn | 0197-6729 | - |
dc.identifier.uri | http://hdl.handle.net/10397/109246 | - |
dc.language.iso | en | en_US |
dc.publisher | John Wiley & Sons, Inc. | en_US |
dc.rights | Copyright © 2023 Qing Zhang et al. Tis is an open access article distributed under the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. | en_US |
dc.rights | The following publication Zhang, Qing, Chan, Felix T. S., Fu, Xiaowen, Improved Ant Colony Optimization for the Operational Aircraft Maintenance Routing Problem with Cruise Speed Control, Journal of Advanced Transportation, 2023, 8390619, 18 pages, 2023 is available at https://doi.org/10.1155/2023/8390619. | en_US |
dc.title | Improved ant colony optimization for the operational aircraft maintenance routing problem with cruise speed control | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 2023 | - |
dc.identifier.issue | 1 | - |
dc.identifier.doi | 10.1155/2023/8390619 | - |
dcterms.abstract | The operational aircraft maintenance routing problem (OAMRP) plays a critical part in producing considerable cost reductions for airlines, since its solution directly influences the number of operating leased aircraft. To reduce the quantity of required aircraft, adopting cruise speed control in OAMRP is a good strategy. In this paper, we investigate the OAMRP with cruise speed control. The objective is to minimize the required quantity of aircraft by finding the optimal aircraft routes through cruise time optimization. The focus is on solving two issues simultaneously: (i) optimization of cruise times and (ii) determination of aircraft routes. Since the combination of two intricate sets of decisions poses significant methodological challenges, the difficulty lies in how to efficiently solve it. Accordingly, the goal of this study is twofold: (i) to design a preprocessing step to reduce the network size and (ii) to develop an improved ant colony optimization (IACO) algorithm with a new state transition mechanism to provide the guidance for cruise times optimization and a new pheromone updating mechanism to enhance the search efficiency and precision. Using data from the Bureau of Transportation Statistics (BTS), we demonstrate the computational efficiency of the preprocessing step and the IACO algorithm. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Journal of advanced transportation, 2023, v. 2023, no. 1, 8390619 | - |
dcterms.isPartOf | Journal of advanced transportation | - |
dcterms.issued | 2023 | - |
dc.identifier.scopus | 2-s2.0-85160635147 | - |
dc.identifier.eissn | 2042-3195 | - |
dc.identifier.artn | 8390619 | - |
dc.description.validate | 202410 bcch | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_Scopus/WOS | en_US |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | Macau University of Science and Technology Faculty Research Grants (FRG); Te Macau FoundationFund (MFP) | en_US |
dc.description.pubStatus | Published | en_US |
dc.description.oaCategory | CC | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zhang_Improved_Ant_Colony.pdf | 490.42 kB | Adobe PDF | View/Open |
Page views
14
Citations as of Nov 24, 2024
Downloads
7
Citations as of Nov 24, 2024
SCOPUSTM
Citations
3
Citations as of Nov 21, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.