Computers, Materials & Continua DOI:10.32604/cmc.2021.015494
Article

Managing Delivery of Safeguarding Substances as a Mitigation Against Outbreaks of Pandemics

Said Ali Hassan1, Khalid Alnowibet2,3, Prachi Agrawal4 and Ali Wagdy Mohamed5,6,*

1Department of Operations Research and Decision Support, Faculty of Computers and Artificial Intelligence, Cairo University, Giza, 12613, Egypt
2Department of Statistics and Operations Research, College of Science, King Saud University, Riyadh, Saudi Arabia
3Traffic Safety Technologies Chair, Vice Deanship of Scientific Research, King Saud University, Riyadh, Saudi Arabia
4Department of Mathematics and Scientific Computing, National Institute of Technology, Hamirpur, 177005, India
5Operations Research Department, Faculty of Graduate Studies for Statistical Research, Cairo University, Giza, 12613, Egypt
6School of Engineering and Applied Sciences, Wireless Intelligent Networks Center (WINC), Nile University, Giza, Egypt
*Corresponding Author: Ali Wagdy Mohamed. Email: aliwagdy@gmail.com
Received: 24 November 2020; Accepted: 23 January 2021

Abstract: The optimum delivery of safeguarding substances is a major part of supply chain management and a crucial issue in the mitigation against the outbreak of pandemics. A problem arises for a decision maker who wants to optimally choose a subset of candidate consumers to maximize the distributed quantities of the needed safeguarding substances within a specific time period. A nonlinear binary mathematical programming model for the problem is formulated. The decision variables are binary ones that represent whether to choose a specific consumer, and design constraints are formulated to keep track of the chosen route. To better illustrate the problem, objective, and problem constraints, a real application case study is presented. The case study involves the optimum delivery of safeguarding substances to several hospitals in the Al-Gharbia Governorate in Egypt. The hospitals are selected to represent the consumers of safeguarding substances, as they are the first crucial frontline for mitigation against a pandemic outbreak. A distribution truck is used to distribute the substances from the main store to the hospitals in specified required quantities during a given working shift. The objective function is formulated in order to maximize the total amount of delivered quantities during the specified time period. The case study is solved using a novel Discrete Binary Gaining Sharing Knowledge-based Optimization algorithm (DBGSK), which involves two main stages: discrete binary junior and senior gaining and sharing stages. DBGSK has the ability of finding the solutions of the introduced problem, and the obtained results demonstrate robustness and convergence toward the optimal solutions.

Keywords: Safeguarding substances; mitigation against pandemic outbreaks; supply chain management; metaheuristic optimization

1  Introduction

Reference [1] indicates that the entire world is suffering from a global epidemic that has infected thousands of people in almost all countries. In December 2019, Wuhan in China was the origin of a pneumonia of unknown cause. Cases of the outbreak did not remain limited to this city, and by January 2020, confirmed cases were detected outside Wuhan. Reference [2] indicates that the number of confirmed infected cases across the world shows that this is a vast and evolving situation, and new changes may happen by the hour. Reference [3] indicates that numbers are expected to increase exponentially as new cases are discovered. Reference [4] declared that the outbreak of the COVID-19 pandemic has put humans in all countries facing grave danger. The pandemic has spread across the world, and total number of cases was greater than 67 million as of December 2020. Reference [5] indicates that the growth factor of daily new cases is greater than 1 in many countries, suggesting exponential growth. Reference [6] indicates that the rate of spread of the virus was estimated in the early stages of the disease to be 2.2.

References [7,8] indicate that because the major symptoms of the new pandemic are known, any individual can assess whether they have the symptoms. To safeguard against the disease, many precautions are recommended, such as stay at home except in cases of necessity; clean hands thoroughly and regularly with soap and water or with an alcoholic hand rub solution; regularly clean surfaces; and wear protective masks and gloves.

It is worthwhile to determine the importance of safeguarding substances such as cleaning materials, alcohol, respirator masks, medical gloves, and disinfection fluids both to hospital crews and to patients, especially those suspected to have caught the virus. Countries that have succeeded in slowing the prevalence of the virus have forced their citizens to wear masks in public places. Most of the infected people have contracted the infection in closed environments and in poorly ventilated spaces, such as public places, transportation means, restaurants, cinemas, stores, hospitals, and homes. Therefore, it is essential to provide such places with necessary safeguarding substances.

Reference [9] indicates that the concept of supply chain has gained popularity in the past several years. Many different definitions for it have been presented. The supply chain—a term increasingly used by logistics professionals—encompasses every effort involved in producing and delivering a final product, from the supplier’s supplier to the consumer’s consumer.

References [10,11] state that the general definition of supply chain is the science and art of obtaining, producing, and delivering materials and products in proper quantities, in the proper place, and at the proper time. So, four basic processes, namely plan, source, make, and deliver, broadly define these efforts. In light of the utmost importance of delivering the safeguarding substances, it is worth noting that the importance of meeting most of the ultimate consumer’s demands and improving responsiveness are now considered strategic capabilities. A very significant part of the supply chain management for the safeguarding substances for the pandemic is the optimum delivery phase. With some planning, utilization of the available time for delivering the safeguarding substances can be optimized so that maximum possible quantities can be delivered.

The optimum delivery of the safeguarding substances for mitigating an outbreak in network optimization is defined for scheduling the distribution system with a limited load capacity to a list of consumers with known demanded quantities. The objective is to identify the most effective route for the distribution system as measured by maximizing the total delivered quantities in a certain limited time period. The route starts from a predetermined main store location and proceeds to each chosen consumer exactly once and then returns to the main store.

The rest of this article is organized as follows. Section 2 is devoted to demonstrating the importance of providing hospitals with safeguarding substances to protect medical personnel, patients, and visitors. This section describes the problem under consideration to distribute safeguarding substances to a group of consumers in an optimal way in order to meet the needs of each consumer while increasing the total distributed safeguarding substances during a specified time period.

The mathematical model of the problem is developed in Section 3. The proposed formulation is a nonlinear binary mathematical model with a dimension depending on the number of candidate consumers to be visited. The steps of the solution procedure are also explained.

A real application case study for the optimum delivery of safeguarding substances among candidate hospitals representing an essential type of consumers for such preventive materials is presented in Section 4. In Section 5, a novel discrete binary version of a recently developed Gaining Sharing Knowledge-based Optimization Technique (GSK) is introduced for solving the problem. GSK cannot solve the problem in binary space; therefore, a Discrete Binary GSK Optimization Algorithm (DBGSK) is proposed with two new junior and senior stages. These stages allow DBGSK to inspect the problem search space efficiently.

Section 6 presents the experimental results of the problem obtained by DBGSK, and Section 7 summarizes the conclusions and the suggested points for future research.

2  Delivery of Safeguarding Substances

Safeguarding substances can disinfect contaminated places and limit the quantities of viruses that travel through respiratory droplets. They also contribute to limiting transmission of infection between people in gatherings, especially in public transport and crowded places. Frontline workers in medical institutions who wore the “N95” respirator mask did not catch the virus despite closely taking care of the infected patients. That is why it is very important to provide public places and hospitals with adequate amounts of these safeguarding substances regularly.

The importance of safeguarding substances and wearing masks in public places becomes clear considering that between 6% and 18% of infected people may not show any symptoms of the disease despite being able to spread the infection. The incubation period of the virus may be up to 14 days before symptoms appear. If everyone, especially the asymptomatic, wears masks, the number of viruses circulating in the air will decrease, and the risk of transmission will be reduced.

About 3,000 drops of spray may come out of the mouth of a person during one sneeze, and some fear that the virus can spread through the spray that comes out of the mouth while speaking. Once the spray comes out of the mouth, the larger droplets settle on surfaces, while the smaller droplets remain suspended in the air for hours, which may be inhaled by a healthy person. After the virus enters the body and multiplies, viral particles exit from the cells and enter the body fluids in the lungs, mouth, and nose. When the person coughs, the tiny droplets that are filled with viruses disperse in the air.

Reference [12] studied the transmission of 2019-nCoV infection from an asymptomatic contact. Reference [13] studied the SARS-CoV-2 viral load in upper respiratory specimens of patients. Reference [14] studied the pre-symptomatic transmission of SARS-CoV-2.

Reference [15] indicates that masks are recommended for people when they are in areas of widespread transmission and they cannot guarantee a distance of at least one meter from others. Reference [16] concluded that masks remarkably reduced the number of microorganisms expelled by volunteers. Reference [17] studied the efficiency of aerosol filtration fabrics in cloth masks. Reference [18] performed a quantitative mechanistic study of home-made masks against spread of respiratory infection. Reference [19] demonstrated the possible benefits of wearing masks and hand hygiene in defending against SARS-CoV-2. References [20,21] discussed the significance of masks for respiratory virus shedding.

The conclusion is that if a virus is given favorable opportunities, it may remain suspended in the air for several hours and still be able to transmit to people who inhale the droplets. The virus appears to be able to circulate through the air particularly in closed environments.

Hospitals and health centers are at the top of the list of public places that need safeguarding substances, and attention should be paid to continuous and timely supply to them of the required amounts. Medical employees are the first line of defense in the fight against the pandemic because they are exposed to patients and visitors who may be infected with the virus.

The problem under consideration is how to distribute safeguarding substances to a group of hospitals—as a good example of public places—in an optimal way. A transport vehicle carrying an amount of these safeguarding substances moves from one store and distributes them to the selected hospitals to meet the needs of each one while maximizing the total distributed quantities. The needed amount for a hospital is determined according to the number of medical crews, attending patients, and number of visitors. The distribution process takes place within a limited time window, namely the shift of the driver and their companions. The problem begins by considering several hospitals to be supplied. Then, the problem is to determine the optimal choice between these hospitals during the limited time shift so that the largest amount of these safeguarding substances is distributed. With the addition of a new list of hospitals including those that were not provided with safeguarding substances in the first round, the process is repeated in the same way until the provision to all hospitals. Fig. 1 represents an essential activity in the supply chain process, which is the delivery of safeguarding substances to the set of chosen consumers in the optimum delivery route. The chosen consumers are a subset or a proper subset of the candidate end consumers.

Figure 1: The delivery of safeguarding substances as a part of the supply chain management

3  Formulation of the Mathematical Model

The distribution of safeguarding substances problem is mapped to a graph G with a set V of (n + 1) nodes representing n consumers and one additional node denoting the main store location where the distribution system starts the job along with a set of arcs representing the transportation times between each distinct pair of nodes. The required quantity of safeguarding substances for each consumer, the delivery system capacity, the time for delivery of safeguarding substances to each consumer, and the transportation time between each two consumers are specified.

The problem is then defined as:

Each consumer is visited only once to deliver the required safeguarding substances.

The route starts and ends at the main store location from where the safeguarding substances are supplied.

The overall goal of the problem is the best utilization of the available time, calculated as maximizing the total amount of distributed safeguarding substances during the predetermined time interval.

3.1 Decision Variables

Let:

xim={ 1, if consumer i is approached by the distribution system on position m, i andm=1,2,…,n.0,otherwise. where n=number of candidate consumers.

3.2 Constraints

(i) Avoid the Trivial Solution:

In order to avoid the trivial solution that the distribution system will be saturated by supplying one consumer only, the following condition should hold: The quantity of safeguarding substances to be supplied to any candidate consumer should fill up completely the maximum carrying capacity of the used distribution system. In case of violation, the used system will travel to that consumer, deliver its total capacity, and obviate the need to perform the scheduling process.

In order to avoid the solution that the distribution system can deliver the needed safeguarding substances to all consumers, the problem in this case will be to minimize the total transportation distances or times (the well-known Travelling Salesman Problem). The following condition should hold: The total quantities of safeguarding substances to be delivered to all the candidate consumers should be greater than the maximum carrying capacity of the used distribution system.

These two conditions should be checked before designing the appropriate mathematical model.

(ii) Positions Constraints:

Each position m in the optimum truck route has at most one consumer; see Eq. (1):

∑i=1nxim≤1,m=1,2,…,n.(1)

(iii) Consumer Constraints:

Each consumer i can be in one position of the optimum truck route or not visited; see Eq. (2):

∑m=1nxim≤1,i=1,2,…,n.(2)

(iv) Consecutive Positions Constraints:

A position (m + 1) cannot exist in the distribution route unless the preceding position m exists. This is achieved by the following set of constraints; see Eq. (3):

∑i=1nxim+1≤∑i=1nxim,m=1,2,…,n-1(3)

If ∑i=1nxim+1=1, then ∑i=1nxim=1, m=1,2,…,n-1,

If ∑i=1nxim+1=0, then there is no restriction on the value of ∑i=1nxim, m=1,2,…,n-1.

(v) Shift Hours Constraint:

The total time T spent in the whole optimum route by the distribution system is equal to four parts:

T=T1+T2+T3+T4, where:

T1=Time of transportation from the main store to the first consumer in the route;

T2=Total intermediate transportation times between two adjacent consumers in the route;

T3=Transportation time spent from the last visited consumer to the main store;

T4=Total time for delivery of items (counting and inspection) to the visited consumers.

These four parts are calculated as follows: T1=∑i=1nt0,ixi1, where t0i=transportation time between the main store and consumer i, ∀i∈V. T2=∑i=1n∑j=1j≠inti,j. (∑m=1n-1xim⋅xjm+1), where ti,j=transportation time between the two adjacent consumers i and j, ∀i, j∈V.

The last visited position in the optimum route is characterized by a unique particularity that it does not have any adjacent subsequent positions. The expression (xim). (1-∑i=1nxim+1)=1 holds only for the last position in the distribution route and equals 0 for all other positions. Then, we have the following expression for T3:

T3=∑m=1n-1∑i=1n(ti,0.xim). (1-∑i=1nxim+1)+∑i=1nti,0.xin, where ti,0=transportation time between consumer i and the main store, ∀i∈V. The second term in T3 is added to cover the case when the optimum route will contain all the candidate n consumers since the first summation in the first term does not include the position n.

The following expression is used to calculate T4: T4=∑m=1n∑i=1n(tixim).

The total time of the whole optimum route T will have the form: T = T1 +T2 +T3 +T4.

Substituting for T1,T2,T3,andT4, we obtain Eq. (4):

T=∑i=1nt0,ixi1+∑i=1n∑j=1j≠inti,j.(∑m=1n-1xim.xjm+1)+∑m=1n-1∑i=1n(ti,0.xim).(1-∑i=1nxim+1)+∑i=1nti,0.xin+∑m=1n∑i=1n(tixim)≤Tmax,(4)

where Tmax=time available in the working shift.

(vi) Maximum Load Capacity of the Distribution System Constraint:

The maximum quantity distributed to all the visited consumers in the considered time shift should not exceed the maximum load capacity of the transportation system, see Eq. (5):

∑i=1nqi.(∑m=1nxim)≤Q,(5)

where qi=quantity of safeguarding substances required for consumer i; i=1,2,…,n; Q=maximum load capacity of the distribution system.

(vii) Binary Constraints:

All the decision variables are 0–1; see Eq. (6).

xim=0 or 1;i,m=1,2,…,n.(6)

3.3 The Objective Function

The objective function is formulated in order to maximize the total amount of delivered safeguarding substances; see Eq. (7):

MaximizeZ=∑i=1nqi.(∑m=1nxim),(7)

where qi=quantity of safeguarding substances required by consumer number i; i=1,2,…,n.

Finally, we have a suggested model that contains (n2) binary variables and (4n + 1) constraints.

An optimum solution to the problem will produce two distinct situations:

a) If ∑m=1nxim=1, i=1,2,…,n, then all the n consumers are supplied with the needed safeguarding substances in one shift, and the problem is completed.

b) If ∑m=1nxim=0 for any i, then the corresponding consumer i is not supplied with the needed materials in the considered shift. In this case, it is needed to eliminate the visited consumers, add other candidate ones to be supplied, and then consider one more shift and repeat the procedure once more.

Structured English is used to present the solution procedure. The use of Structured English to describe the steps of the algorithm is clear and unambiguous and can be read from start to finish. The use of Structured English keywords provides a syntax similar to that of a programming language to assist with identifying logical steps necessary to properly describe the algorithm. Structured English aims to provide the benefits of both programming logic and natural language; program logic helps to attain precision, and natural language helps with the familiarity of the spoken word. See Fig. 2.

Figure 2: Steps of the solution procedure of the problem

4  Real Application Case Study

A real example is presented to apply the given mathematical model for very important consumers during an epidemic outbreak. An example of an important consumer of the safeguarding substances for an outbreak are hospitals that exist in different locations in Al-Gharbia Governorate, Egypt. A small truck with 1.7-ton capacity starts its route from the main store of safeguarding substances located in Tanta, the capital of the Governorate denoted by (STORE), as shown in Fig. 3.

Figure 3: Locations of the main store and consumers

In one special emergency night shift that lasts five hours, five hospitals are identified as candidate consumers, denoted by serial numbers (1,2,…,5). The store is denoted by (0). All are located in Al-Gharbia Governorate. The data is given in Tab. 1, where numbers inside the cells (i, j) represent the transportation times tij in hours. For simplicity, the time of delivery of the safeguarding substances for each hospital is included in the transportation time.

Table 1: Data for the case study example

The mathematical formulation for the given case study is worked out by substituting in the previously described model, that is, formulas 1–7.

5  The Proposed Methodology

Metaheuristic approaches have been developed for complex optimization problems with continuous variables. References [22–29] note that these metaheuristic algorithms include Genetic Algorithm, Differential Evolution, Particle Swarm Optimization algorithm, Grey Wolf Optimizer, Water Cycle Algorithm, Teaching Learning based Optimization, Bat Algorithm, and artificial bee colony algorithm. They have been successfully applied to many real-world problems [30–40]. Reference [41] recently proposed a novel GSK based on acquiring knowledge and sharing it with others throughout their lifetimes. The original GSK solves optimization problems over continuous space, but it cannot solve the problem in binary space. So, a new variant of GSK is introduced to solve the proposed problem. DBGSK is proposed over discrete binary space with new binary junior and senior gaining and sharing stages.

References [42–50] state that there are many constraint handling techniques in the literature. References [51,52] used the augmented Lagrangian method in which an unconstrained optimization problem was obtained from a constrained optimization one.

The proposed methodology is described below.

5.1 Gaining-Sharing Knowledge-based Optimization Algorithm

An optimization problem with constraints can be formulated as:

Minf(X);X=[x1,x2,…,xDim]s.to.gi(X)≤0;i=1,2,…,mX∈[αp,βp];p=1,2,…,Dim

where f denotes the objective function; X=[x1,x2,…,xDim] are the decision variables; gi(X) are the inequality constraints; αp,βp are the lower and upper bounds of the decision variables, respectively; and Dim represents the dimension of individuals. If the problem is in maximization form, then consider minimization=-maximization.

The human-based GSK algorithm has two stages: junior and senior gaining and sharing stage. All persons acquire knowledge and share their views with others. The people in early stage gain knowledge from their small networks, such as family members, relatives, and neighbours, and want to share their opinions with others who might not be from their networks, because the curiosity about other people. These people may not have the experience to categorize the people. In the same way, people in the middle or later stages enhance their knowledge by interacting with friends, colleagues, and social media friends, among others, and share their views with the most suitable person so that they can improve their knowledge. These people have the experience to judge other people and can categorize them (good or bad). The process mentioned above can be formulated mathematically in the following steps.

Step 1: To get a starting point of the optimization problem, the initial population must be obtained. The initial population is created randomly within the boundary constraints. See Eq. (8):

xtp0=αp+randp(βp-αp),(8)

where t is for the number of populations; randp denotes a random number uniformly distributed between 0 and 1.

Step 2: At this step, the dimensions of junior and senior stages should be computed through the following formula. See Eqs. (9) and (10):

DimJ=Dim×(Genmax-GGenmax)k, (9)

DimS=Dim-DimJ, (10)

where k (> 0) denotes the learning rate that monitors the experience rate. DimJ and DimS represent the dimensions for the junior and senior stage, respectively. Genmax is the maximum count of generations, and G is the count of generation.

Step 3: Junior gaining sharing knowledge stage: In this stage, the early aged people gain knowledge from their small networks and share their views with other people who may or may not belong to their groups. Thus, individuals are updated as:

     i)  According to the objective function values, the individuals are arranged in ascending order. For every xt (t=1,2,…,NP), select the nearest best (xt −1) and worst (xt+1) to gain knowledge and also randomly choose (xr) to share knowledge. The pseudocode to update the individuals is presented in Fig. 4, where kf (> 0) is the knowledge factor.

Figure 4: Pseudocode for junior gaining sharing knowledge stage

Step 4: Senior gaining sharing knowledge stage: This stage comprises the impact and effect of other people (good or bad) on the individual. The updated individuals can be determined as follows:

     i)  The individuals are classified into three categories (best, middle, and worst) after sorting individuals into ascending order based on the objective function values.

    ii)  Best individual=100p% (xbest); middle individual=Dim-2*100p% (xmiddle); worst individual=100p% (xworst).

For every individual xt, choose the top and bottom 100p% individuals for the gaining part and the third one (middle individual) for the sharing part. The new individuals are updated through the pseudocode shown in Fig. 5, where p∈[0,1] is the percentage of best and worst classes.

Figure 5: Pseudocode of senior gaining sharing knowledge stage

5.2 Discrete Binary Gaining Sharing Knowledge-Based Optimization Algorithm

For solving problems in discrete binary space, a novel Discrete Binary Gaining Sharing Knowledge-based Optimization algorithm is proposed. In DBGSK, the new initialization and the working mechanism of both stages (junior and senior gaining sharing stages) are introduced over discrete binary space, and the remaining algorithms remain the same as the previous ones. The working mechanism of DBGSK is presented in the following subsections.

Discrete Binary Initialization:

The initial population is obtained in GSK using Eq. (8). It must be updated using the following equation for binary population; see Eq. (11):

xtp0=round(rand(0,1)),(11)

where the round operator is used to convert the decimal number into the nearest binary number.

Discrete Binary Junior Saining and Sharing Stage:

The discrete binary junior gaining and sharing stage is based on the original GSK with kf = 1. The individuals are updated in original GSK using the pseudocode that contains two cases. These two cases are defined for the discrete binary stage as follows.

Case 1. When f(xr)<f(xt): There are three different vectors (xt-1,xt+1,xr), which can take only two values (0 and 1). Therefore, a total of 23 combinations are possible, which are listed in Tab. 2. Furthermore, these eight combinations can be categorized into two different subcases [(a) and (b)]; each subcase has four combinations. The results of each possible combination are presented in Tab. 2.

Table 2: Results of the discrete binary junior gaining and sharing stage of Case 1 with kf = 1

Subcase (a): If xt −1 is equal to xt+1, the result is equal to xr.

Subcase (b): When xt −1 is not equal xt+1, the result is the same as xt −1 by taking −1 as 0 and 2 as 1.

The mathematical formulation of Case 1 is as follows:

xtpnew={xr;ifxt-1=xt+1xt-1;ifxt-1≠xt+1

Case 2. When f(xr)≥f(xt): There are four different vectors (xt-1,xt,xt+1,xr) that consider only two values (0 and 1). Therefore, there are 24 possible combinations that are presented in Tab. 3. The 16 combinations can be divided into two subcases [(c) and (d)] in which (c) and (d) have four and 12 combinations, respectively.

Subcase (c): If xt −1 is not equal to xt+1 and xt+1 is equal to xr, the result is equal to xt −1.

Subcase (d): If any of the conditions arise xt-1=xt+1≠xrorxt-1≠xt+1≠xrorxt-1=xt+1=xr, the result is equal to xt by considering −1 and −2 as 0 and 2 and 3 as 1.

Table 3: Results of the discrete binary junior gaining and sharing stage of Case 2 with kf = 1

The mathematical formulation of Case 2 is:

xtpnew={xt-1;ifxt-1≠xt+1=xrxt;Otherwise

Discrete Binary Senior Gaining and Sharing Stage: The working mechanism of the discrete binary senior gaining and sharing stage is the same as that of the binary junior gaining and sharing stage with value of kf = 1. The individuals are updated in the original senior gaining sharing stage using pseudocode (Fig. 7) with two cases. The two cases are further modified for binary senior gaining and sharing stage in the following manner.

Case 1. f(xmiddle)<f(xt): It contains three different vectors (xbest, xmiddle, xworst), and they can assume only binary values (0 and 1). Thus, total eight combinations are possible to update the individuals. These eight combinations can be classified into two subcases [(a) and (b)], and each subcase contains only four different combinations. The obtained results for this case are presented in Tab. 4.

Table 4: Results of the discrete binary senior gaining and sharing stage of Case 1 with kf = 1

Subcase (a): If xbest is equal to xworst, then the obtained results are equal to xmiddle.

Subcase (b): If xbest is not equal to xworst, then the results are equal to xbest assuming −1 or 2, equivalent to their nearest binary values (0 and 1, respectively).

Case 1 can be mathematically formulated in the following way:

xtpnew={xmiddle;ifxbest=xworstxbest;ifxbest≠xworst

Case 2. f(xmiddle)>f(xt): It consists of four different binary vectors (xbest,xmiddle,xworst,xt), and with the values of each vector, a total of 16 combinations are possible. The 16 combinations are also divided into two subcases [(c) and (d)]. The subcases (c) and (d) further contain four and 12 combinations, respectively. The subcases are explained in detail in Tab. 5.

Table 5: Results of the discrete binary senior gaining and sharing stage of Case 2 with kf = 1

Subcase (c): When xbest is not equal to xworst and xworst is equal to xmiddle, then the obtained results are equal to xbest.

Subcase (d): If any case arises other than (c), then the obtained results are equal to xt by taking −2 and −1 as 0 and 2 and 3 as 1.

The mathematical formulation of Case 2 is given as:

xtpnew={xbest;ifxbest≠xworst=xmiddlext;Otherwise

The flow chart of DBGSK is presented in Fig. 6.

Figure 6: Flow chart of DBGSK

6  Experimental Results

The problem is handled by using the proposed novel DBGSK algorithm. The used parameters are presented in Tab. 6.

Table 6: Numerical values of the parameters

DBGSK was run on a personal computer with Intel® CoreTM i5-7200U CPU@2.50 GHz and 4 GB RAM and coded on MATLAB R2015a. To get the optimal solutions, 30 independent runs were completed. The obtained statistics are provided in Tab. 7, including the best, median, average, and worst solutions and the DBGSK standard deviations.

Table 7: Statistical results using DBGSK

Fig. 7 shows the convergence graph of the solutions using DBGSK. From the figure, it can be observed that after few iterations, it converges to the global optimal solution (14.50), which shows the robustness of DBGSK.

Figure 7: Convergence graph of DBGSK

The route provided by the optimum solution can be seen in Fig. 8. The route begins in the store location (0) at Tanta and then visits four hospitals having numbers 1, 3, 5, and 2, and finally returns to the store. The total amounts of the safeguarding substances supplied to the four hospitals=1,450 kg. The total time for the optimum route is five hours, which means that all the available working shift time is completely utilized. The remaining unsupplied hospital (number 4) will be added to the new list of candidate hospitals, and the procedure is repeated once more for the next shift.

Figure 8: Optimum solution for the case study example

7  Conclusions and Points for Future Researchers Researches

The main conclusions for this paper can be summarized as follows:

     i)  An optimum distribution of safeguarding substances in the context of the huge danger of a pandemic is presented. The objective is to achieve the maximum total amount of the distributed safeguarding substances to consumers in a specific time shift.

    ii)  A nonlinear integer constrained mathematical programming model is formulated for the given problem, which is hard to be solved using exact algorithms, especially in large dimensions.

   iii)  The mathematical model and the solution method are used to solve a real application case study for five hospitals located in El-Gharbia Governorate in Egypt.

    iv)  The proposed model of the case study is solved by a novel Discrete Binary Gaining Sharing Knowledge-based optimization algorithm, which involves two main stages: discrete binary junior and senior gaining and sharing stages with knowledge factor kf = 1. DBGSK is a discrete binary variant of the general GSK.

     v)  DBGSK has the ability of finding the solutions of the introduced problem, and the obtained results demonstrate the robustness and convergence of DBGSK toward the optimal solutions.

The suggestions for future research are as follows:

     i)  To apply the same procedure for other Governorates, other regions in the country, and other countries.

    ii)  To apply the same problem formulation to other similar fields, such as industry, agriculture, business, education, telecommunications, investing, quality assurance, social and community services, pollution, medical, tourism, marketing, sales, advertising, sports, arts, cooking, and others.

   iii)  To check the performance of the DBGSK approach in solving different complex optimization problems.

    iv)  Other problems can be investigated by the extension of DBGSK with different kinds of constraint handling methods.

Acknowledgement: The authors are grateful to the Deanship of Scientific Research, King Saud University, KSA, for funding through the Vice Deanship of Scientific Research Chairs.

Funding Statement: This research was funded by Deanship of Scientific Research, King Saud University through the Vice Deanship of Scientific Research.

Conflicts of Interest: The authors declare that they have no conflicts of interest to report regarding the present study.

References

 1.  S. Cleemput, W. Dumon, V. Fonseca, W. Abdool Karim, M. Giovanetti et al. (2020). , “Genome detective coronavirus typing tool for rapid identification and characterization of novel coronavirus genomes,” Bioinformatics, vol. 36, no. 11, pp. 3552–3555. [Google Scholar]

 2.  Wikimedia Commons website, “COVID-19 outbreak world map,” Retrieved on October 3, 2020. [Online]. Available: https://commons.wikimedia.org/wiki/File:COVID-19_Outbreak_World_Map.svg. [Google Scholar]

 3.  World Health Organization website, “Coronavirus disease 2019 (COVID-19) situation report-85,” Retrieved on October 4, 2020. [Online]. Available: https://www.who.int/docs/default-source/coronaviruse/situation-reports/20200414-sitrep-85-covid-19.pdf?sfvrsn=7b8629bb_4. [Google Scholar]

 4.  Worldometer website, “COVID-19 coronavirus pandemic,” Last updated: November 23, 2020. [Online]. Available: https://www.worldometers.info/coronavirus/. [Google Scholar]

 5.  World Health Organization website, “Statement on the first meeting of the international health regulations (2005) emergency committee regarding the outbreak of novel coronavirus (2019-nCoV),” Retrieved on November 23, 2020. [Online]. Available: https://www.who.int/news/item/23-01-2020-statement-on-the-meeting-of-the-international-health-regulations-(2005)-emergency-committee-regarding-the-outbreak-of-novel-coronavirus-(2019-ncov). [Google Scholar]

 6.  R. Li, S. Pei, B. Chen, Y. Song, T. Zhang et al. (2020). , “Substantial undocumented infection facilitates the rapid dissemination of novel coronavirus (SARS-CoV-2),” Science, vol. 368, no. 6490, pp. 489–493. [Google Scholar]

 7.  W. J. Guan, Z. Y. Ni, Y. Hu, W. H. Liang and Q. C. Ou, et al. (2020). “Clinical characteristics of coronavirus disease 2019 in China,” New England Journal of Medicine, vol. 382, no. 18, pp. 1708–1720. [Google Scholar]

 8.  Centers for Disease Control and Prevention (CDC) website, Coronavirus disease 2019, “Coronavirus disease 2019,” Retrieved on October 7, 2020. [Online]. Available: https://www.cdc.gov/. [Google Scholar]

 9.  J. W. Jeon, H. G. Kim and H. K. Ha. (2008). “A study on establishing a strategy of supply chain management: Focusing on Korean automobile industry,” Journal of International Logistics and Trade, vol. 6, no. 2, pp. 49–67. [Google Scholar]

10. J. Olhager and B. M.West. (2002). “House of flexibility-using the QFD approach to deploy manufacturing flexibility,” International Journal of Operations & Production Management, vol. 22, no. 1, pp. 50–79. [Google Scholar]

11. L. Krajewski, J. C. Wei and L. L.Tang. (2005). “Responding to schedule changes in build-to-order supply chains,” Journal of Operations Management, vol. 23, no. 5, pp. 452–469. [Google Scholar]

12. C. Rothe, M. Schunk, P. Sothmann, G. Bretzel, G. Froeschl et al. (2020). , “Transmission of 2019-nCoV infection from an asymptomatic contact in Germany,” New England Journal of Medicine, vol. 382, no. 10, pp. 970–971. [Google Scholar]

13. L. Zou, F. Ruan, M. Huang, L. Liang, H. Huang et al. (2020). , “SARS-CoV-2 viral load in upper respiratory specimens of infected patients,” New England Journal of Medicine, vol. 382, no. 12, pp. 1177–1179. [Google Scholar]

14. W. E. Wei, Z. Li, C. J. Chiew, S. E. Yong, M. P. Toh et al. (2020). , “Presymptomatic transmission of SARS-CoV-2—Singapore, centers for disease control and prevention,” Morbidity and Mortality Weekly Report, vol. 69, no. 16, pp. 411–415. [Google Scholar]

15. World Health Organization (WHO) website, “Coronavirus disease (COVID-19) dashboard,” Retrieved on October 7, 2020. [Online]. Available: https://www.who.int/emergencies/diseases/novel-coronavirus-2019/question-and-answers-hub/q-a-detail/q-a-how-is-covid-19-transmitted?gclid=EAIaIQobChMI1pubiOKq6wIVwu7tCh03dwbZEAAYASAAEgJVsvD_BwE. [Google Scholar]

16. A. Davies, K. A. Thompson, K. Giri, G. Kafatos, J. Walker et al. (2013). , “Testing the efficacy of homemade masks: Would they protect in an influenza pandemic?,” Disaster Medicine and Public Health Preparedness, vol. 7, no. 4, pp. 413–418. [Google Scholar]

17. A. Konda, A. Prakash, G. A. Moss, M. Schmoldt, G. D. Grant et al. (2020). , “Aerosol filtration efficiency of common fabrics used in respiratory cloth masks,” ACS Nano, vol. 14, no. 5, pp. 6339–6347. [Google Scholar]

18. O. Aydin, M. A. B. Emon and M. T. A. Saif. (2020). “Performance of fabrics for home-made masks against spread of respiratory infection through droplets: A quantitative mechanistic study,” Extreme Mechanics Letters, vol. 40, pp. 100924. [Google Scholar]

19. Q. X. Ma, H. Shan, H. L. Zhang, G. M. Li, R. M. Yang et al. (2020). , “Potential utilities of mask-wearing and instant hand hygiene for fighting SARS-CoV-2,” Journal of Medical Virology, vol. 92, no. 9, pp. 1567–1571. [Google Scholar]

20. N. H. Leung, D. K. Chu, E. Y. Shiu, K. H. Chan, J. J. McDevitt et al. (2020). , “Respiratory virus shedding in exhaled breath and efficacy of face masks,” Nature Medicine, vol. 26, no. 5, pp. 676–680. [Google Scholar]

21. C. Wang, P. W. Horby, F. G. Hayden and G. F. Gao. (2020). “A novel coronavirus outbreak of global health concern,” Lancet, vol. 395, no. 10223, pp. 470–473. [Google Scholar]

22. A. H. Wright. (1991). “Genetic algorithms for real parameter optimization,” Foundations of Genetic Algorithms, vol. 1, pp. 205–218. [Google Scholar]

23. R. Storn and K. Price. (1997). “Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359. [Google Scholar]

24. J. Kennedy and R. Eberhart. (1995). “Particle swarm optimization,” Proc. of ICNN’95-Int. Conf. on Neural Networks, vol. 4, pp. 1942–1948. [Google Scholar]

25. S. Mirjalili, S. M. Mirjalili and A. Lewis. (2014). “Grey Wolf Optimizer,” Advances in Engineering Software, vol. 69, pp. 46–61. [Google Scholar]

26. H. Eskandar, A. Sadollah, A. Bahreininejad and M. Hamdi. (2012). “Water cycle algorithm-a novel metaheuristic optimization method for solving constrained engineering optimization problems,” Computers & Structures, vol. 110, no. 1, pp. 151–166. [Google Scholar]

27. R. V. Rao, V. J. Savsani and D. P. Vakharia. (2011). “Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems,” Computer-Aided Design, vol. 43, no. 3, pp. 303–315. [Google Scholar]

28. X. S. Yang and A. H. Gandomi. (2012). “Bat algorithm: A novel approach for global engineering optimization,” Engineering Computations, vol. 29, no. 5, pp. 464–483. [Google Scholar]

29. S. Hemamalini and S. P. Simon. (2010). “Artificial bee colony algorithm for economic load dispatch problem with non-smooth cost functions,” Electric Power Components and Systems, vol. 38, no. 7, pp. 786–803. [Google Scholar]

30. S. A. El-Qulity and A. W. Mohamed. (2016). “A generalized national planning approach for admission capacity in higher education: A nonlinear integer goal programming model with a novel differential evolution algorithm,” Computational Intelligence and Neuroscience, vol. 2016, pp. 14. [Google Scholar]

31. S. A. El-Quliti, A. H. M. Ragab, R. Abdelaal, A. W. Mohamed, A. S. Mashat et al. (2015). “A nonlinear goal programming model for university admission capacity planning with modified differential evolution algorithm,” Mathematical Problems in Engineering, vol. 2015, Article ID892937,13pages. [Google Scholar]

32. S. A. El-Quliti and A. W. Mohamed. (2016). “A large-scale nonlinear mixed-binary goal programming model to assess candidate locations for solar energy stations: An improved binary differential evolution algorithm with a case study,” Journal of Computational and Theoretical Nanoscience, vol. 13, no. 11, pp. 7909–7921. [Google Scholar]

33. A. W. Mohamed, H. Z. Sabry and M. Khorshid. (2012). “An alternative differential evolution algorithm for global optimization,” Journal of Advanced Research, vol. 3, no. 2, pp. 149–165. [Google Scholar]

34. A. W. Mohamed. (2017). “Solving stochastic programming problems using new approach to differential evolution algorithm,” Egyptian Informatics Journal, vol. 18, no. 2, pp. 75–86. [Google Scholar]

35. A. W. Mohamed, A. K. Mohamed, E. Z. Elfeky and M. Saleh. (2019). “Enhanced directed differential evolution algorithm for solving constrained engineering optimization problems,” International Journal of Applied Metaheuristic Computing, vol. 10, no. 1, pp. 1–28. [Google Scholar]

36. A. W. Mohamed. (2016). “A new modified binary differential evolution algorithm and its applications,” Applied Mathematics & Information Sciences, vol. 10, no. 5, pp. 1965–1969. [Google Scholar]

37. A. W. Mohamed, H. Z. Sabry and A. Farhat. (2011). “Advanced differential evolution algorithm for global numerical optimization,” in Proc. the IEEE Int. Conf. on Computer Applications and Industrial Electronic, Penang, Malaysia, pp. 156–161. [Google Scholar]

38. A. K. Mohamed, A. W. Mohamed, E. Z. Elfeky and M. Saleh. (2019). “Solving constrained non-linear integer and mixed-integer global optimization problems using enhanced directed differential evolution algorithm,” in Machine Learning Paradigms: Theory and Application. Cham, Switzerland: Springer. [Google Scholar]

39. A. H. M. Ragab, S. A. El-Quliti, R. Abdelaal, A. W. Mohamed, A. S. Mashat et al. (2016). , “Higher education admission capacity planning using a large scale nonlinear ınteger goal programming model with improved differential evolution algorithm,” Journal of Computational and Theoretical Nanoscience, vol. 13, no. 11, pp. 7864–7878. [Google Scholar]

40. A. W. Mohamed. (2017). “An efficient modified differential evolution algorithm for solving constrained non-linear integer and mixed-integer global optimization problems,” International Journal of Machine Learning and Cybernetics, vol. 8, no. 3, pp. 989–1007. [Google Scholar]

41. A. W. Mohamed, A. A. Hadi and A. K. Mohamed. (2020). “Gaining-sharing knowledge-based algorithm for solving optimization problems: A novel nature-inspired algorithm,” International Journal of Machine Learning and Cybernetics, vol. 11, no. 7, pp. 1501–1529. [Google Scholar]

42. K. Deb. (2000). “An efficient constraint handling method for genetic algorithms,” Computer Methods in Applied Mechanics and Engineering, vol. 186, no. 2–4, pp. 311–338. [Google Scholar]

43. C. A. C. Coello. (2002). “Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art,” Computer Methods in Applied Mechanics and Engineering, vol. 191, no. 11, 12, pp. 1245–1287. [Google Scholar]

44. N. Muangkote, L. Photong and A. Sukprasert. (2018). “Comparative study of constrained handling techniques of constrained differential evolution algorithms applied to constrained optimization problems in mechanical engineering,” in Proc. 3rd Technology Innovation Management and Engineering Science Int. Conf., Bangkok, Thailand, pp. 1–5. [Google Scholar]

45. A. M. Gleixner. (2014). “Introduction to constraint integer programming,” in 5th Porto Meeting on Mathematics for Industry, Berlin, Zuse Institute Berlin, MATHEON, Berlin Mathematical School. [Google Scholar]

46. M. Nadeem, F. Li and H. Ahmad. (2019). “Modified Laplace variational iteration method for solving fourth-order parabolic partial differential equation with variable coefficients,” Computers & Mathematics with Applications, vol. 78, no. 6, pp. 2052–2062. [Google Scholar]

47. I. Ahmad, M. N. Khan, M. Inc, H. Ahmad and K. S. Nisar. (2020). “Numerical simulation of simulate an anomalous solute transport model via local meshless method,” Alexandria Engineering Journal, vol. 59, no. 4, pp. 2827–2838. [Google Scholar]

48. M. N. Khan, I. Ahmad and H. Ahmad. (2020). “A radial basis function collocation method for space-dependent inverse heat problems,” Journal of Applied and Computational Mechanics, vol. 6, no. SI, pp. 1187–1199. [Google Scholar]

49. H. Ahmad. (2018). “Variational iteration method with an auxiliary parameter for solving differential equations of the fifth order,” Nonlinear Science Letters A, vol. 9, no. 1, pp. 27–35. [Google Scholar]

50. N. A. Shah, I. Ahmad, B. Omar, A. E. Abouelregal and H. Ahmad. (2020). “Multistage optimal homotopy asymptotic method for the nonlinear riccati ordinary differential equation in nonlinear physics,” Applied Mathematics & Information Sciences, vol. 14, no. 6, pp. 1–7. [Google Scholar]

51. W. Long, X. Liang, Y. Huang and Y. Chen. (2013). “A hybrid differential evolution augmented Lagrangian method for constrained numerical and engineering optimization,” Computer-Aided Design, vol. 45, no. 12, pp. 1562–1574. [Google Scholar]

52. A. Bahreininejad. (2019). “Improving the performance of water cycle algorithm using augmented Lagrangian method,” Advances in Engineering Software, vol. 132, no. 4, pp. 55–64. [Google Scholar]

This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.