Abstract Wake re-categorization (RECAT) has been implemented to improve runway capacity, and consequently, aircraft arrival runway occupancy time has become a crucial factor influencing runway capacity. Accurate prediction of the runway occupancy time can assist controllers in determining aircraft separation, thereby enhancing the operational efficiency of the runway. In this study, the GA–PSO algorithm is utilized to optimize the Back Propagation neural network prediction model using Quick access recorder data from various domestic airports, achieving high-precision prediction. Additionally, the SHapley Additive explanation model is applied to quantify the effect of each characteristic parameter on the arrival runway occupancy time, resulting in the prediction of aircraft arrival runway occupancy time. This model can provide a foundation for improving runway operation efficiency and technical support for the design of airport runway and taxiway structure.
{"title":"Prediction of Aircraft Arrival Runway Occupancy Time Based on Machine Learning","authors":"Haoran Gao, Yubing Xie, Changjiang Yuan, Xin He, Tiantian Niu","doi":"10.1007/s44196-023-00333-3","DOIUrl":"https://doi.org/10.1007/s44196-023-00333-3","url":null,"abstract":"Abstract Wake re-categorization (RECAT) has been implemented to improve runway capacity, and consequently, aircraft arrival runway occupancy time has become a crucial factor influencing runway capacity. Accurate prediction of the runway occupancy time can assist controllers in determining aircraft separation, thereby enhancing the operational efficiency of the runway. In this study, the GA–PSO algorithm is utilized to optimize the Back Propagation neural network prediction model using Quick access recorder data from various domestic airports, achieving high-precision prediction. Additionally, the SHapley Additive explanation model is applied to quantify the effect of each characteristic parameter on the arrival runway occupancy time, resulting in the prediction of aircraft arrival runway occupancy time. This model can provide a foundation for improving runway operation efficiency and technical support for the design of airport runway and taxiway structure.","PeriodicalId":54967,"journal":{"name":"International Journal of Computational Intelligence Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135155319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-14DOI: 10.1007/s44196-023-00327-1
Rizk M. Rizk-Allah, Islam M. Eldesoky, Ekram A. Aboali, Sarah M. Nasr
Abstract In this paper, a heap-based optimizer algorithm with chaotic search has been presented for the global solution of nonlinear programming problems. Heap-based optimizer (HBO) is a modern human social behavior-influenced algorithm that has been presented as an effective method to solve nonlinear programming problems. One of the difficulties that faces HBO is that it falls into locally optimal solutions and does not reach the global solution. To recompense the disadvantages of such modern algorithm, we integrate a heap-based optimizer with a chaotic search to reach the global optimization for nonlinear programming problems. The proposed algorithm displays the advantages of both modern techniques. The robustness of the proposed algorithm is inspected on a wide scale of different 42 problems including unimodal, multi-modal test problems, and CEC-C06 2019 benchmark problems. The comprehensive results have shown that the proposed algorithm effectively deals with nonlinear programming problems compared with 11 highly cited algorithms in addressing the tasks of optimization. As well as the rapid performance of the proposed algorithm in treating nonlinear programming problems has been proved as the proposed algorithm has taken less time to find the global solution.
{"title":"Heap-Based Optimizer Algorithm with Chaotic Search for Nonlinear Programming Problem Global Solution","authors":"Rizk M. Rizk-Allah, Islam M. Eldesoky, Ekram A. Aboali, Sarah M. Nasr","doi":"10.1007/s44196-023-00327-1","DOIUrl":"https://doi.org/10.1007/s44196-023-00327-1","url":null,"abstract":"Abstract In this paper, a heap-based optimizer algorithm with chaotic search has been presented for the global solution of nonlinear programming problems. Heap-based optimizer (HBO) is a modern human social behavior-influenced algorithm that has been presented as an effective method to solve nonlinear programming problems. One of the difficulties that faces HBO is that it falls into locally optimal solutions and does not reach the global solution. To recompense the disadvantages of such modern algorithm, we integrate a heap-based optimizer with a chaotic search to reach the global optimization for nonlinear programming problems. The proposed algorithm displays the advantages of both modern techniques. The robustness of the proposed algorithm is inspected on a wide scale of different 42 problems including unimodal, multi-modal test problems, and CEC-C06 2019 benchmark problems. The comprehensive results have shown that the proposed algorithm effectively deals with nonlinear programming problems compared with 11 highly cited algorithms in addressing the tasks of optimization. As well as the rapid performance of the proposed algorithm in treating nonlinear programming problems has been proved as the proposed algorithm has taken less time to find the global solution.","PeriodicalId":54967,"journal":{"name":"International Journal of Computational Intelligence Systems","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134911740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-14DOI: 10.1007/s44196-023-00330-6
Abdelrahman I. Saad, Fahima A. Maghraby, Osama Badawy
Abstract A deep convolution neural network image segmentation model based on a cost-effective active learning mechanism is proposed and named PolySeg Plus. It is intended to address polyp segmentation with a lack of labeled data and a high false-positive rate of polyp discovery. In addition to applying active learning, which assisted in labeling more image samples, a comprehensive polyp dataset formed of five benchmark datasets was generated to increase the number of images. To enhance the captured image features, the locally shared feature method is used, which utilizes the power of employing neighboring features together with one another to improve the quality of image features and overcome the drawbacks of the Conditional Random Features method. Medical image segmentation was performed using ResUNet++, ResUNet, UNet++, and UNet models. Gaussian noise was removed from the images using a gaussian filter, and the images were then augmented before being fed into the models. In addition to optimizing model performance through hyperparameter tuning, grid search is used to select the optimum parameters to maximize model performance. The results demonstrated a significant improvement and applicability of the proposed method in polyp segmentation when compared to state-of-the-art methods on the datasets CVC-ClinicDB, CVC-ColonDB, ETIS Larib Polyp DB, KVASIR-SEG, and Kvasir-Sessile, with Dice coefficients of 0.9558, 0.8947, 0.7547, 0.9476, and 0.6023, respectively. Not only did the suggested method improve the dice coefficients on the individual datasets, but it also produced better results on the comprehensive dataset, which will contribute to the development of computer-aided diagnosis systems.
{"title":"PolySeg Plus: Polyp Segmentation Using Deep Learning with Cost Effective Active Learning","authors":"Abdelrahman I. Saad, Fahima A. Maghraby, Osama Badawy","doi":"10.1007/s44196-023-00330-6","DOIUrl":"https://doi.org/10.1007/s44196-023-00330-6","url":null,"abstract":"Abstract A deep convolution neural network image segmentation model based on a cost-effective active learning mechanism is proposed and named PolySeg Plus. It is intended to address polyp segmentation with a lack of labeled data and a high false-positive rate of polyp discovery. In addition to applying active learning, which assisted in labeling more image samples, a comprehensive polyp dataset formed of five benchmark datasets was generated to increase the number of images. To enhance the captured image features, the locally shared feature method is used, which utilizes the power of employing neighboring features together with one another to improve the quality of image features and overcome the drawbacks of the Conditional Random Features method. Medical image segmentation was performed using ResUNet++, ResUNet, UNet++, and UNet models. Gaussian noise was removed from the images using a gaussian filter, and the images were then augmented before being fed into the models. In addition to optimizing model performance through hyperparameter tuning, grid search is used to select the optimum parameters to maximize model performance. The results demonstrated a significant improvement and applicability of the proposed method in polyp segmentation when compared to state-of-the-art methods on the datasets CVC-ClinicDB, CVC-ColonDB, ETIS Larib Polyp DB, KVASIR-SEG, and Kvasir-Sessile, with Dice coefficients of 0.9558, 0.8947, 0.7547, 0.9476, and 0.6023, respectively. Not only did the suggested method improve the dice coefficients on the individual datasets, but it also produced better results on the comprehensive dataset, which will contribute to the development of computer-aided diagnosis systems.","PeriodicalId":54967,"journal":{"name":"International Journal of Computational Intelligence Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134912354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-12DOI: 10.1007/s44196-023-00320-8
Sarada Mohapatra, Prabhujit Mohapatra
Abstract Golden Jackal Optimization (GJO) is a recently developed nature-inspired algorithm that is motivated by the collaborative hunting behaviours of the golden jackals in nature. However, the GJO has the disadvantage of poor exploitation ability and is easy to get stuck in an optimal local region. To overcome these disadvantages, in this paper, an enhanced variant of the golden jackal optimization algorithm that incorporates the opposition-based learning (OBL) technique (OGJO) is proposed. The OBL technique is implemented into GJO with a probability rate, which can assist the algorithm in escaping from the local optima. To validate the efficiency of OGJO, several experiments have been performed. The experimental outcomes revealed that the proposed OGJO has more efficiency than GJO and other compared algorithms.
{"title":"An Improved Golden Jackal Optimization Algorithm Using Opposition-Based Learning for Global Optimization and Engineering Problems","authors":"Sarada Mohapatra, Prabhujit Mohapatra","doi":"10.1007/s44196-023-00320-8","DOIUrl":"https://doi.org/10.1007/s44196-023-00320-8","url":null,"abstract":"Abstract Golden Jackal Optimization (GJO) is a recently developed nature-inspired algorithm that is motivated by the collaborative hunting behaviours of the golden jackals in nature. However, the GJO has the disadvantage of poor exploitation ability and is easy to get stuck in an optimal local region. To overcome these disadvantages, in this paper, an enhanced variant of the golden jackal optimization algorithm that incorporates the opposition-based learning (OBL) technique (OGJO) is proposed. The OBL technique is implemented into GJO with a probability rate, which can assist the algorithm in escaping from the local optima. To validate the efficiency of OGJO, several experiments have been performed. The experimental outcomes revealed that the proposed OGJO has more efficiency than GJO and other compared algorithms.","PeriodicalId":54967,"journal":{"name":"International Journal of Computational Intelligence Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135824690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-08DOI: 10.1007/s44196-023-00317-3
Ping Chen
{"title":"Research on Financial Risk Evaluation and Control of Tourism Enterprises Based on Improved GA Algorithm","authors":"Ping Chen","doi":"10.1007/s44196-023-00317-3","DOIUrl":"https://doi.org/10.1007/s44196-023-00317-3","url":null,"abstract":"","PeriodicalId":54967,"journal":{"name":"International Journal of Computational Intelligence Systems","volume":" ","pages":""},"PeriodicalIF":2.9,"publicationDate":"2023-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41990054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-07DOI: 10.1007/s44196-023-00324-4
Binbin Huang, Ciyu Wang
{"title":"Research on Data Analysis of Efficient Innovation and Entrepreneurship Practice Teaching Based on LightGBM Classification Algorithm","authors":"Binbin Huang, Ciyu Wang","doi":"10.1007/s44196-023-00324-4","DOIUrl":"https://doi.org/10.1007/s44196-023-00324-4","url":null,"abstract":"","PeriodicalId":54967,"journal":{"name":"International Journal of Computational Intelligence Systems","volume":" ","pages":""},"PeriodicalIF":2.9,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45903865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-01DOI: 10.1007/s44196-023-00310-w
Jianxia Chen, Liwei Pan, Shi Dong, Tianci Yu, Liang Xiao, Meihan Yao, Shijie Luo
{"title":"Multi-temporal Sequential Recommendation Model Based on the Fused Learning Preferences","authors":"Jianxia Chen, Liwei Pan, Shi Dong, Tianci Yu, Liang Xiao, Meihan Yao, Shijie Luo","doi":"10.1007/s44196-023-00310-w","DOIUrl":"https://doi.org/10.1007/s44196-023-00310-w","url":null,"abstract":"","PeriodicalId":54967,"journal":{"name":"International Journal of Computational Intelligence Systems","volume":" ","pages":""},"PeriodicalIF":2.9,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46699767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-08-31DOI: 10.1007/s44196-023-00321-7
X. Shen
{"title":"E-commerce User Recommendation Algorithm Based on Social Relationship Characteristics and Improved K-Means Algorithm","authors":"X. Shen","doi":"10.1007/s44196-023-00321-7","DOIUrl":"https://doi.org/10.1007/s44196-023-00321-7","url":null,"abstract":"","PeriodicalId":54967,"journal":{"name":"International Journal of Computational Intelligence Systems","volume":" ","pages":""},"PeriodicalIF":2.9,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47889291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-08-30DOI: 10.1007/s44196-023-00322-6
Wenkai Xu, Fengchen Fu, Qingqing Zhang, Lei Wang
{"title":"A Deep Learning-Based Multi-objective Optimization Model for PM2.5 Prediction","authors":"Wenkai Xu, Fengchen Fu, Qingqing Zhang, Lei Wang","doi":"10.1007/s44196-023-00322-6","DOIUrl":"https://doi.org/10.1007/s44196-023-00322-6","url":null,"abstract":"","PeriodicalId":54967,"journal":{"name":"International Journal of Computational Intelligence Systems","volume":" ","pages":""},"PeriodicalIF":2.9,"publicationDate":"2023-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44418069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：