A Travelling Disinfection-Man Problem (TDP) for COVID-19: A Nonlinear Binary Constrained Gaining-Sharing Knowledge-Based Optimization Algorithm

Citation:
Hassan, S. A., P. Agrawal, T. Ganesh, and A. W. Mohamed, "A Travelling Disinfection-Man Problem (TDP) for COVID-19: A Nonlinear Binary Constrained Gaining-Sharing Knowledge-Based Optimization Algorithm", Intelligent Data Analysis for COVID-19 Pandemic, Singapore, Springer Singapore, pp. 291 - 318, 2021.

Abstract:

An improved scheduling the disinfection process of the new coronavirus (COVID-19) is introduced. The scheduling aims at achieving the best utilization of the available day time, which is calculated as the total disinfection time minus the total loss travelling time. In this regard, a new application problem is presented, which is called a travelling disinfection-man problem (TDP). The new problem (TDP) in network optimization resemble somehow the famous travelling salesman problems (TSP) but with basic distinct variations where a disinfection group is likely to select a route to reach a subset of predetermined places to be disinfected with the most utilization of the available day working hours. A nonlinear binary model is introduced with a detailed real application case study involving the improving the scheduling of coronavirus disinfection process for five contaminated faculties in Ain Shams University in Cairo, and the case study is solved using a novel discrete binary gaining-sharing knowledge-based optimization algorithm (DBGSK).

Notes:

n/a

Related External Link

Tourism