A robust strategy to address the airport gate assignment problem considering operators’ preferences
•Flight activities (arrival, parking, and departure) are assigned to different gates.•A multi-objective integer programming model is proposed.•A robust strategy is developed by considering the airport operators’ preferences.•The Monte Carlo based NSGA-II (TPMC-NSGA II) algorithm is designed. The air...
Uložené v:
| Vydané v: | Computers & industrial engineering Ročník 168; s. 108100 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
01.06.2022
|
| Predmet: | |
| ISSN: | 0360-8352, 1879-0550 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •Flight activities (arrival, parking, and departure) are assigned to different gates.•A multi-objective integer programming model is proposed.•A robust strategy is developed by considering the airport operators’ preferences.•The Monte Carlo based NSGA-II (TPMC-NSGA II) algorithm is designed.
The airport gate assignment problem (AGAP) has been well studied in the field of airport transportation planning and operations management. For airport operators, it is important to assign flight activities to limited gates economically, and the robustness of the assignment is also a key issue. In this paper, we address the problem of assigning a number of flight activities, including arrival, parking, and departure, to different gates during the operating period. A robust strategy is developed by considering the airport operators’ tow-averse attributes. To solve the problem, firstly, a multi-objective integer programming model is proposed. There are two objectives in the model, one is to maximize the operators’ preferences characterized by scores, and the other is to minimize robustness cost caused by the changes of flight schedule. Secondly, a two-phase Monte Carlo based NSGA-II (TPMC-NSGA II) algorithm is designed, which effectively combines the Monte Carlo characters and the NSGA-II algorithm. Furthermore, a set of computational analyses are conducted. The results show that the proposed model and algorithm are capable of solving the airport gate assignment problem with an economical, robust, and preferred output. |
|---|---|
| AbstractList | •Flight activities (arrival, parking, and departure) are assigned to different gates.•A multi-objective integer programming model is proposed.•A robust strategy is developed by considering the airport operators’ preferences.•The Monte Carlo based NSGA-II (TPMC-NSGA II) algorithm is designed.
The airport gate assignment problem (AGAP) has been well studied in the field of airport transportation planning and operations management. For airport operators, it is important to assign flight activities to limited gates economically, and the robustness of the assignment is also a key issue. In this paper, we address the problem of assigning a number of flight activities, including arrival, parking, and departure, to different gates during the operating period. A robust strategy is developed by considering the airport operators’ tow-averse attributes. To solve the problem, firstly, a multi-objective integer programming model is proposed. There are two objectives in the model, one is to maximize the operators’ preferences characterized by scores, and the other is to minimize robustness cost caused by the changes of flight schedule. Secondly, a two-phase Monte Carlo based NSGA-II (TPMC-NSGA II) algorithm is designed, which effectively combines the Monte Carlo characters and the NSGA-II algorithm. Furthermore, a set of computational analyses are conducted. The results show that the proposed model and algorithm are capable of solving the airport gate assignment problem with an economical, robust, and preferred output. |
| ArticleNumber | 108100 |
| Author | She, Yaqian Zhao, Qiuhong Guo, Renyong Yu, Xianrui |
| Author_xml | – sequence: 1 givenname: Yaqian surname: She fullname: She, Yaqian – sequence: 2 givenname: Qiuhong surname: Zhao fullname: Zhao, Qiuhong email: qhzhao@buaa.edu.cn – sequence: 3 givenname: Renyong surname: Guo fullname: Guo, Renyong – sequence: 4 givenname: Xianrui surname: Yu fullname: Yu, Xianrui |
| BookMark | eNp9kM1KAzEQx4NUsFYfwFteYGs-djcNnkrxCwpe9Byyyeya0iZLEoXefA1fzycxpZ489DQM8__NML9LNPHBA0I3lMwpoe3tZm4czBlhrPQLSsgZmtKFkBVpGjJBU8JbUi14wy7QZUobQkjdSDpFsMQxdB8p45SjzjDscQ5YWxshJZzfAWsXxxAzHsoU65Tc4HfgMx4Lt4UdNsEnZyE6P-AwQlkSYvr5-i4B6CGCN5Cu0Hmvtwmu_-oMvT3cv66eqvXL4_Nqua4MkyJXjRCck95Y20FXdz3vpamJNdDWram7VlBWU8vAWiG5IboH2VgujOwk6xuo-QzR414TQ0rlvhqj2-m4V5Sogye1UcWTOnhSR0-FEf8Y47LOLvgixG1PkndHEspLnw6iSiVS_rUugsnKBneC_gXpmohS |
| CitedBy_id | crossref_primary_10_3390_app142311407 crossref_primary_10_1016_j_orp_2025_100338 crossref_primary_10_3390_aerospace9090502 crossref_primary_10_3390_aerospace12050398 crossref_primary_10_1016_j_aei_2025_103551 crossref_primary_10_1016_j_jairtraman_2025_102747 crossref_primary_10_1016_j_cie_2023_109418 crossref_primary_10_1016_j_jairtraman_2024_102555 crossref_primary_10_1016_j_tre_2025_104389 crossref_primary_10_1016_j_tre_2025_103963 crossref_primary_10_1016_j_seta_2023_103237 crossref_primary_10_1016_j_trc_2023_104232 crossref_primary_10_1080_03081060_2024_2428840 crossref_primary_10_1016_j_trc_2024_104866 crossref_primary_10_1155_2023_6440278 crossref_primary_10_1016_j_ins_2023_119892 crossref_primary_10_1016_j_cie_2025_110942 crossref_primary_10_1016_j_cie_2025_111317 crossref_primary_10_3390_biomimetics9010026 crossref_primary_10_3390_futuretransp4020025 crossref_primary_10_1080_21680566_2023_2185497 |
| Cites_doi | 10.1155/2016/1213949 10.1016/j.cie.2017.04.042 10.1080/07408170701416673 10.1109/4235.996017 10.1155/2021/6693127 10.1016/j.trc.2017.03.019 10.1016/j.trb.2016.11.006 10.1016/j.cie.2018.05.038 10.1016/j.omega.2019.102146 10.1016/j.asoc.2017.06.004 10.1007/s11573-010-0396-9 10.1016/j.trpro.2015.09.045 10.1016/j.cie.2012.06.020 10.1109/TCYB.2019.2956974 10.1016/j.eswa.2017.04.050 10.1016/j.jairtraman.2020.101816 10.1016/j.cie.2015.12.013 10.1016/j.trpro.2017.03.061 10.14569/IJACSA.2018.090247 10.1016/j.cie.2016.10.004 10.1080/23311916.2017.1413722 10.1007/s10951-012-0292-y 10.1016/j.omega.2005.07.001 10.1177/0361198118781386 10.1016/j.tre.2011.10.008 10.32604/cmc.2019.05907 10.1007/s00291-016-0443-1 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier Ltd |
| Copyright_xml | – notice: 2022 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cie.2022.108100 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Engineering |
| EISSN | 1879-0550 |
| ExternalDocumentID | 10_1016_j_cie_2022_108100 S036083522200170X |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKG AABNK AACTN AAEDT AAEDW AAFWJ AAIAV AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AARIN AAXUO ABAOU ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ADBBV ADEZE ADGUI ADMUD ADRHT ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LX9 LY1 LY7 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SST SSW SSZ T5K TAE TN5 WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-577330fcddbeb4bf3f9c40dce646c4b671241d2edd793c0afe95d37c9b92f5e43 |
| ISICitedReferencesCount | 22 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000805828400012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0360-8352 |
| IngestDate | Sat Nov 29 07:18:21 EST 2025 Tue Nov 18 22:32:07 EST 2025 Fri Feb 23 02:40:51 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | TPMC-NSGA II algorithm Robustness Operators’ preferences Airport gate assignment problem (AGAP) |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-577330fcddbeb4bf3f9c40dce646c4b671241d2edd793c0afe95d37c9b92f5e43 |
| ParticipantIDs | crossref_primary_10_1016_j_cie_2022_108100 crossref_citationtrail_10_1016_j_cie_2022_108100 elsevier_sciencedirect_doi_10_1016_j_cie_2022_108100 |
| PublicationCentury | 2000 |
| PublicationDate | June 2022 2022-06-00 |
| PublicationDateYYYYMMDD | 2022-06-01 |
| PublicationDate_xml | – month: 06 year: 2022 text: June 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Computers & industrial engineering |
| PublicationYear | 2022 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Maharjan, Matis (b0095) 2012; 63 Ornek, Ozturk, Sugut (b0115) 2020; 1–29 Marinelli, Palmisano, Dell’Orco, Ottomanelli (b0105) 2015; 10 Zhang, Klabjan (b0165) 2017; 95 Dell'Orco, Marinelli, Altieri (b0050) 2017; 80 Drexl, Nikulin (b0075) 2008; 40 Liang, Li, Bi, Ding, Zhao (b0090) 2020; 2020 Behrends, Usher, Guo (b0020) 2017; 4 Jaehn (b0080) 2010; 80 Ascó (b0015) 2016; 2016 Xiao, Chien, Schonfeld, Hu (b0145) 2020; 86 Daş, Gzara, Stützle (b0035) 2020; 92 Dorndorf, Jaehn, Pesch (b0070) 2017; 39 Yu, Zhang, Lau (b0155) 2016; 93 Deb, Pratap, Agarwal, Meyarivan (b0045) 2002; 6 Pternea, Haghani (b0120) 2018; 123 Diepen, van den Akker, Hoogeveen, Smeltink (b0060) 2012; 15 Şeker, Noyan (b0130) 2012; 48 Yu, Zhang, Lau (b0160) 2017; 84 Cai, Sun, Misir, Tan, Li, Xu, Fan (b0030) 2019; 51 Zhang, Wang, Tong (b0170) 2019; 61 Behrends, Usher (b0025) 2016; 102 Daş (b0040) 2017; 109 Aktel, Yagmahan, Özcan, Yenisey, Sansarcı (b0005) 2017; 22 Mokhtarimousavi, Talebi, Asgari (b0110) 2018; 2672 Tan, He (b0135) 2021; 2021 Aoun, Afia (b0010) 2018; 9 Deng, Zhao, Yang, Xiong, Sun, Li (b0055) 2017; 59 Dorndorf, Drexl, Nikulin, Pesch (b0065) 2007; 35 Yan, Huo (b0150) 2001; 35 Yu (10.1016/j.cie.2022.108100_b0160) 2017; 84 Behrends (10.1016/j.cie.2022.108100_b0020) 2017; 4 Maharjan (10.1016/j.cie.2022.108100_b0095) 2012; 63 Cai (10.1016/j.cie.2022.108100_b0030) 2019; 51 Şeker (10.1016/j.cie.2022.108100_b0130) 2012; 48 Aoun (10.1016/j.cie.2022.108100_b0010) 2018; 9 Ascó (10.1016/j.cie.2022.108100_b0015) 2016; 2016 Jaehn (10.1016/j.cie.2022.108100_b0080) 2010; 80 Deng (10.1016/j.cie.2022.108100_b0055) 2017; 59 Dorndorf (10.1016/j.cie.2022.108100_b0070) 2017; 39 Diepen (10.1016/j.cie.2022.108100_b0060) 2012; 15 Pternea (10.1016/j.cie.2022.108100_b0120) 2018; 123 Yan (10.1016/j.cie.2022.108100_b0150) 2001; 35 Yu (10.1016/j.cie.2022.108100_b0155) 2016; 93 Zhang (10.1016/j.cie.2022.108100_b0165) 2017; 95 Zhang (10.1016/j.cie.2022.108100_b0170) 2019; 61 Ornek (10.1016/j.cie.2022.108100_b0115) 2020; 1–29 Mokhtarimousavi (10.1016/j.cie.2022.108100_b0110) 2018; 2672 Drexl (10.1016/j.cie.2022.108100_b0075) 2008; 40 Daş (10.1016/j.cie.2022.108100_b0040) 2017; 109 Dell'Orco (10.1016/j.cie.2022.108100_b0050) 2017; 80 Daş (10.1016/j.cie.2022.108100_b0035) 2020; 92 Aktel (10.1016/j.cie.2022.108100_b0005) 2017; 22 Behrends (10.1016/j.cie.2022.108100_b0025) 2016; 102 Tan (10.1016/j.cie.2022.108100_b0135) 2021; 2021 Liang (10.1016/j.cie.2022.108100_b0090) 2020; 2020 Marinelli (10.1016/j.cie.2022.108100_b0105) 2015; 10 Xiao (10.1016/j.cie.2022.108100_b0145) 2020; 86 Deb (10.1016/j.cie.2022.108100_b0045) 2002; 6 Dorndorf (10.1016/j.cie.2022.108100_b0065) 2007; 35 |
| References_xml | – volume: 6 start-page: 182 year: 2002 end-page: 197 ident: b0045 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Transactions on Evolutionary Computation – volume: 22 start-page: 469 year: 2017 end-page: 478 ident: b0005 article-title: The comparison of the metaheuristic algorithms performances on airport gate assignment problem publication-title: Transportation Research Procedia – volume: 1–29 year: 2020 ident: b0115 article-title: Integer and constraint programming model formulations for flight-gate assignment problem publication-title: Operational Research – volume: 84 start-page: 143 year: 2017 end-page: 154 ident: b0160 article-title: An adaptive large neighborhood search heuristic for solving a robust gate assignment problem publication-title: Expert Systems with Applications – volume: 92 year: 2020 ident: b0035 article-title: A review on airport gate assignment problems: Single versus multi objective approaches publication-title: Omega – volume: 9 start-page: 331 year: 2018 end-page: 340 ident: b0010 article-title: Time-dependence in multi-Agent MDP applied to gate assignment Problem publication-title: International Journal of Advanced Computer Science and Applications – volume: 2016 start-page: 1 year: 2016 end-page: 19 ident: b0015 article-title: An analysis of robustness approaches for the airport baggage sorting station assignment Problem publication-title: Journal of Optimization – volume: 10 start-page: 920 year: 2015 end-page: 930 ident: b0105 article-title: Fusion of two metaheuristic approaches to solve the flight gate assignment problem publication-title: Transportation Research Procedia – volume: 2672 start-page: 59 year: 2018 end-page: 70 ident: b0110 article-title: A non-dominated sorting genetic algorithm approach for optimization of multi-objective airport gate assignment problem publication-title: Transportation Research Record: Journal of the Transportation Research Board – volume: 59 start-page: 288 year: 2017 end-page: 302 ident: b0055 article-title: Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment publication-title: Applied Soft Computing – volume: 15 start-page: 703 year: 2012 end-page: 715 ident: b0060 article-title: Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol publication-title: Journal of Scheduling – volume: 86 year: 2020 ident: b0145 article-title: Optimizing flight sequencing and gate assignment considering terminal configuration and walking time publication-title: Journal of Air Transport Management – volume: 4 start-page: 1413722 year: 2017 ident: b0020 article-title: An integrated solution for the aircraft taxi and gate assignment problems publication-title: Cogent Engineering – volume: 40 start-page: 385 year: 2008 end-page: 397 ident: b0075 article-title: Multicriteria airport gate assignment and Pareto simulated annealing publication-title: IIE Transactions – volume: 39 start-page: 65 year: 2017 end-page: 93 ident: b0070 article-title: Flight gate assignment and recovery strategies with stochastic arrival and departure times publication-title: OR Spectrum – volume: 63 start-page: 1135 year: 2012 end-page: 1144 ident: b0095 article-title: Multi-commodity flow network model of the flight gate assignment problem publication-title: Computers & Industrial Engineering – volume: 93 start-page: 171 year: 2016 end-page: 191 ident: b0155 article-title: MIP-based heuristics for solving robust gate assignment problems publication-title: Computers & Industrial Engineering – volume: 48 start-page: 438 year: 2012 end-page: 459 ident: b0130 article-title: Stochastic optimization models for the airport gate assignment problem publication-title: Transportation Research Part E: Logistics and Transportation Review – volume: 102 start-page: 44 year: 2016 end-page: 57 ident: b0025 article-title: Aircraft gate assignment: Using a deterministic approach for integrating freight movement and aircraft taxiing publication-title: Computers & Industrial Engineering – volume: 2021 start-page: 6693127 year: 2021 ident: b0135 article-title: Robust airport gate assignment based on the analysis of flight arrival time publication-title: Mathematical Problems in Engineering – volume: 2020 start-page: 1 year: 2020 end-page: 17 ident: b0090 article-title: An improved adaptive parallel genetic algorithm for the airport gate assignment problem publication-title: Journal of Advanced Transportation – volume: 80 start-page: 1027 year: 2010 end-page: 1039 ident: b0080 article-title: Solving the flight gate assignment problem using dynamic programming publication-title: Zeitschrift für Betriebswirtschaft – volume: 61 start-page: 1091 year: 2019 end-page: 1104 ident: b0170 article-title: Research on flight first service model and algorithms for the gate assignment problem publication-title: Computers, Materials & Continua – volume: 95 start-page: 260 year: 2017 end-page: 284 ident: b0165 article-title: Optimization for gate re-assignment publication-title: Transportation Research Part B: Methodological – volume: 51 start-page: 4488 year: 2019 end-page: 4500 ident: b0030 article-title: A bi-objective constrained robust gate assignment problem: Formulation, instances and algorithm publication-title: IEEE Transactions on Cybernetics – volume: 123 start-page: 103 year: 2018 end-page: 118 ident: b0120 article-title: Mathematical models for flight-to-gate reassignment with passenger flows: State-of-the-art comparative analysis, formulation improvement, and a new multidimensional assignment model publication-title: Computers & Industrial Engineering – volume: 35 start-page: 413 year: 2001 end-page: 432 ident: b0150 article-title: Optimization of multiple objective gate assignments publication-title: Transportation Research Part A: Policy and Practice – volume: 109 start-page: 347 year: 2017 end-page: 356 ident: b0040 article-title: New multi objective models for the gate assignment problem publication-title: Computers & Industrial Engineering – volume: 35 start-page: 326 year: 2007 end-page: 334 ident: b0065 article-title: Flight gate scheduling: State-of-the-art and recent developments publication-title: Omega – volume: 80 start-page: 424 year: 2017 end-page: 438 ident: b0050 article-title: Solving the gate assignment problem through the Fuzzy Bee Colony Optimization publication-title: Transportation Research Part C: Emerging Technologies – volume: 2016 start-page: 1 year: 2016 ident: 10.1016/j.cie.2022.108100_b0015 article-title: An analysis of robustness approaches for the airport baggage sorting station assignment Problem publication-title: Journal of Optimization doi: 10.1155/2016/1213949 – volume: 1–29 year: 2020 ident: 10.1016/j.cie.2022.108100_b0115 article-title: Integer and constraint programming model formulations for flight-gate assignment problem publication-title: Operational Research – volume: 109 start-page: 347 year: 2017 ident: 10.1016/j.cie.2022.108100_b0040 article-title: New multi objective models for the gate assignment problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2017.04.042 – volume: 40 start-page: 385 issue: 4 year: 2008 ident: 10.1016/j.cie.2022.108100_b0075 article-title: Multicriteria airport gate assignment and Pareto simulated annealing publication-title: IIE Transactions doi: 10.1080/07408170701416673 – volume: 6 start-page: 182 issue: 2 year: 2002 ident: 10.1016/j.cie.2022.108100_b0045 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.996017 – volume: 2021 start-page: 6693127 year: 2021 ident: 10.1016/j.cie.2022.108100_b0135 article-title: Robust airport gate assignment based on the analysis of flight arrival time publication-title: Mathematical Problems in Engineering doi: 10.1155/2021/6693127 – volume: 80 start-page: 424 year: 2017 ident: 10.1016/j.cie.2022.108100_b0050 article-title: Solving the gate assignment problem through the Fuzzy Bee Colony Optimization publication-title: Transportation Research Part C: Emerging Technologies doi: 10.1016/j.trc.2017.03.019 – volume: 95 start-page: 260 year: 2017 ident: 10.1016/j.cie.2022.108100_b0165 article-title: Optimization for gate re-assignment publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2016.11.006 – volume: 123 start-page: 103 year: 2018 ident: 10.1016/j.cie.2022.108100_b0120 article-title: Mathematical models for flight-to-gate reassignment with passenger flows: State-of-the-art comparative analysis, formulation improvement, and a new multidimensional assignment model publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2018.05.038 – volume: 92 year: 2020 ident: 10.1016/j.cie.2022.108100_b0035 article-title: A review on airport gate assignment problems: Single versus multi objective approaches publication-title: Omega doi: 10.1016/j.omega.2019.102146 – volume: 59 start-page: 288 year: 2017 ident: 10.1016/j.cie.2022.108100_b0055 article-title: Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2017.06.004 – volume: 80 start-page: 1027 issue: 10 year: 2010 ident: 10.1016/j.cie.2022.108100_b0080 article-title: Solving the flight gate assignment problem using dynamic programming publication-title: Zeitschrift für Betriebswirtschaft doi: 10.1007/s11573-010-0396-9 – volume: 10 start-page: 920 year: 2015 ident: 10.1016/j.cie.2022.108100_b0105 article-title: Fusion of two metaheuristic approaches to solve the flight gate assignment problem publication-title: Transportation Research Procedia doi: 10.1016/j.trpro.2015.09.045 – volume: 63 start-page: 1135 issue: 4 year: 2012 ident: 10.1016/j.cie.2022.108100_b0095 article-title: Multi-commodity flow network model of the flight gate assignment problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2012.06.020 – volume: 2020 start-page: 1 year: 2020 ident: 10.1016/j.cie.2022.108100_b0090 article-title: An improved adaptive parallel genetic algorithm for the airport gate assignment problem publication-title: Journal of Advanced Transportation – volume: 51 start-page: 4488 issue: 9 year: 2019 ident: 10.1016/j.cie.2022.108100_b0030 article-title: A bi-objective constrained robust gate assignment problem: Formulation, instances and algorithm publication-title: IEEE Transactions on Cybernetics doi: 10.1109/TCYB.2019.2956974 – volume: 84 start-page: 143 year: 2017 ident: 10.1016/j.cie.2022.108100_b0160 article-title: An adaptive large neighborhood search heuristic for solving a robust gate assignment problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2017.04.050 – volume: 86 year: 2020 ident: 10.1016/j.cie.2022.108100_b0145 article-title: Optimizing flight sequencing and gate assignment considering terminal configuration and walking time publication-title: Journal of Air Transport Management doi: 10.1016/j.jairtraman.2020.101816 – volume: 93 start-page: 171 year: 2016 ident: 10.1016/j.cie.2022.108100_b0155 article-title: MIP-based heuristics for solving robust gate assignment problems publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2015.12.013 – volume: 22 start-page: 469 year: 2017 ident: 10.1016/j.cie.2022.108100_b0005 article-title: The comparison of the metaheuristic algorithms performances on airport gate assignment problem publication-title: Transportation Research Procedia doi: 10.1016/j.trpro.2017.03.061 – volume: 35 start-page: 413 issue: 5 year: 2001 ident: 10.1016/j.cie.2022.108100_b0150 article-title: Optimization of multiple objective gate assignments publication-title: Transportation Research Part A: Policy and Practice – volume: 9 start-page: 331 issue: 2 year: 2018 ident: 10.1016/j.cie.2022.108100_b0010 article-title: Time-dependence in multi-Agent MDP applied to gate assignment Problem publication-title: International Journal of Advanced Computer Science and Applications doi: 10.14569/IJACSA.2018.090247 – volume: 102 start-page: 44 year: 2016 ident: 10.1016/j.cie.2022.108100_b0025 article-title: Aircraft gate assignment: Using a deterministic approach for integrating freight movement and aircraft taxiing publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2016.10.004 – volume: 4 start-page: 1413722 issue: 1 year: 2017 ident: 10.1016/j.cie.2022.108100_b0020 article-title: An integrated solution for the aircraft taxi and gate assignment problems publication-title: Cogent Engineering doi: 10.1080/23311916.2017.1413722 – volume: 15 start-page: 703 issue: 6 year: 2012 ident: 10.1016/j.cie.2022.108100_b0060 article-title: Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol publication-title: Journal of Scheduling doi: 10.1007/s10951-012-0292-y – volume: 35 start-page: 326 issue: 3 year: 2007 ident: 10.1016/j.cie.2022.108100_b0065 article-title: Flight gate scheduling: State-of-the-art and recent developments publication-title: Omega doi: 10.1016/j.omega.2005.07.001 – volume: 2672 start-page: 59 issue: 23 year: 2018 ident: 10.1016/j.cie.2022.108100_b0110 article-title: A non-dominated sorting genetic algorithm approach for optimization of multi-objective airport gate assignment problem publication-title: Transportation Research Record: Journal of the Transportation Research Board doi: 10.1177/0361198118781386 – volume: 48 start-page: 438 issue: 2 year: 2012 ident: 10.1016/j.cie.2022.108100_b0130 article-title: Stochastic optimization models for the airport gate assignment problem publication-title: Transportation Research Part E: Logistics and Transportation Review doi: 10.1016/j.tre.2011.10.008 – volume: 61 start-page: 1091 issue: 3 year: 2019 ident: 10.1016/j.cie.2022.108100_b0170 article-title: Research on flight first service model and algorithms for the gate assignment problem publication-title: Computers, Materials & Continua doi: 10.32604/cmc.2019.05907 – volume: 39 start-page: 65 issue: 1 year: 2017 ident: 10.1016/j.cie.2022.108100_b0070 article-title: Flight gate assignment and recovery strategies with stochastic arrival and departure times publication-title: OR Spectrum doi: 10.1007/s00291-016-0443-1 |
| SSID | ssj0004591 |
| Score | 2.4642498 |
| Snippet | •Flight activities (arrival, parking, and departure) are assigned to different gates.•A multi-objective integer programming model is proposed.•A robust... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 108100 |
| SubjectTerms | Airport gate assignment problem (AGAP) Operators’ preferences Robustness TPMC-NSGA II algorithm |
| Title | A robust strategy to address the airport gate assignment problem considering operators’ preferences |
| URI | https://dx.doi.org/10.1016/j.cie.2022.108100 |
| Volume | 168 |
| WOSCitedRecordID | wos000805828400012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-0550 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004591 issn: 0360-8352 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWlgMceBQQ5SUfOLFK5U2ceH1cofISqkAUtOUSJbbTTVUlyyapyo0LP4K_xy9h_EoiXgIkLtHKijcrz7fjz5OZbxB6qFs5KBJnAeVJEVAZwl8qj4tAwH7EeZGI0AjPv3vJDg7myyV_NZl89rUwZ6esqubn53z9X00NY2BsXTr7F-buvxQG4DMYHa5gdrj-keEX002dd007bazwrKGX4F9MTYimmVmpxYvbqQ6gTYE7l8c2I8D1ltGJ6KaHp8mHXivzHr7xSRFcqwq4GsFmzGx9e4jGgKkcOoKoQfGwD-esTBj1KPswAuf7VWbCtq_LblUP9z7taguD6uNo9KjTg0utVtSV48gFHHr7DCsbTvMlNUP-ki3jIoGmhXaDsl55znhAYqtQ27tt247nhy3ARiNO9sA17umn6izKGSHDftdnIb7RzzIMNDQyQssLaDtkMQf_vr14vr98MZKdt60X_W_zr8dNouB3D_o5wRmRlsNr6Io7beCFRcl1NFHVDrrqTh7Y-fVmB10eyVLeQGqBLYSwhxBua-wghAFC2EEIawjhAULYQQiPIIR7CH399AWPwHMTvX2yf_j4WeDacQQi5KwNYsaiiBRCylzlNC-iggtKpFAJTQTNEwZUcSZDJSX4fEGyQvFYRkzwnIdFrGh0C21VdaVuIxzSnIowKyLFJU0kzclMxQlLtJxhPJdyFxG_hqlwWvW6Zcpp6pMST2BcpXrZU7vsu-hRP2VthVp-dzP1hkkd07QMMgUU_XranX-bdhddGuB_D221m07dRxfFWVs2mwcOa98AQYSlPw |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+robust+strategy+to+address+the+airport+gate+assignment+problem+considering+operators%E2%80%99+preferences&rft.jtitle=Computers+%26+industrial+engineering&rft.au=She%2C+Yaqian&rft.au=Zhao%2C+Qiuhong&rft.au=Guo%2C+Renyong&rft.au=Yu%2C+Xianrui&rft.date=2022-06-01&rft.pub=Elsevier+Ltd&rft.issn=0360-8352&rft.eissn=1879-0550&rft.volume=168&rft_id=info:doi/10.1016%2Fj.cie.2022.108100&rft.externalDocID=S036083522200170X |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon |