A Novel Multi-Objective Nonlinear Discrete Binary Gaining-Sharing Knowledge-Based Optimization Algorithm: Optimum Scheduling of Flights for Residual Stranded Citizens Due to COVID-19

Said Ali Hassan, Prachi Agrawal, Talari Ganesh, Ali Wagdy Mohamed

Source Title: International Journal of Applied Metaheuristic Computing (IJAMC)13(1)

ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781799885405|DOI: 10.4018/IJAMC.290541

MLA

Hassan, Said Ali, et al. "A Novel Multi-Objective Nonlinear Discrete Binary Gaining-Sharing Knowledge-Based Optimization Algorithm: Optimum Scheduling of Flights for Residual Stranded Citizens Due to COVID-19." IJAMC vol.13, no.1 2022: pp.1-25. http://doi.org/10.4018/IJAMC.290541

APA

Hassan, S. A., Agrawal, P., Ganesh, T., & Mohamed, A. W. (2022). A Novel Multi-Objective Nonlinear Discrete Binary Gaining-Sharing Knowledge-Based Optimization Algorithm: Optimum Scheduling of Flights for Residual Stranded Citizens Due to COVID-19. International Journal of Applied Metaheuristic Computing (IJAMC), 13(1), 1-25. http://doi.org/10.4018/IJAMC.290541

Chicago

Hassan, Said Ali, et al. "A Novel Multi-Objective Nonlinear Discrete Binary Gaining-Sharing Knowledge-Based Optimization Algorithm: Optimum Scheduling of Flights for Residual Stranded Citizens Due to COVID-19," International Journal of Applied Metaheuristic Computing (IJAMC) 13, no.1: 1-25. http://doi.org/10.4018/IJAMC.290541

Export Reference

Favorite Full-Issue Download

View Full Text HTML

View Full Text PDF

Abstract

GSK algorithm is based on the concept of how humans acquire and share knowledge through their lifespan. Discrete Binary version of GSK named novel binary Gaining Sharing knowledge-based optimization algorithm (DBGSK) depends on mainly two binary stages: binary junior gaining sharing stage and binary senior gaining sharing stage with knowledge factor 1. These two stages enable BGSK for exploring and exploitation of the search space efficiently and effectively to solve problems in binary space. Besides, one of these practical applications is to optimally schedule the flights for residual stranded citizens due to COVID-19. The problem is defined for a decision maker who wants to schedule a multiple stepped trip for a subset of candidate airports to return the maximum number of residuals of stranded citizens remaining in listed airports while comprising the minimization of the total travelled distances for a carrying airplane. A nonlinear binary mathematical programming model for the problem is introduced with a real application case study, the case study is solved using (DBGSK).