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).

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.