Biswas Amiya, Roy Sankar Kumar, Mondal Sankar Prasad
Department of Mathematics, Durgapur Government College, Durgapur 713214, India.
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721102, West Bengal, India.
Appl Soft Comput. 2022 Nov;129:109576. doi: 10.1016/j.asoc.2022.109576. Epub 2022 Aug 27.
In recent times, COVID-19 pandemic has posed certain challenges to transportation companies due to the restrictions imposed by different countries during the lockdown. These restrictions cause delay and/ or reduction in the number of trips of vehicles, especially, to the regions with higher restrictions. In a pandemic scenario, regions are categorized into different groups based on the levels of restrictions imposed on the movement of vehicles based on the number of active cases (i.e., number of people infected by COVID-19), number of deaths, population, number of COVID-19 hospitals, etc. The aim of this study is to formulate and solve a fixed-charge transportation problem (FCTP) during this pandemic scenario and to obtain transportation scheme with minimum transportation cost in minimum number of trips of vehicles moving between regions with higher levels of restrictions. For this, a penalty is imposed in the objective function based on the category of the region(s) where the origin and destination are situated. However, reduction in the number of trips of vehicles may increase the transportation cost to unrealistic bounds and so, to keep the transportation cost within limits, a constraint is imposed on the proposed model. To solve the problem, the Genetic Algorithm (GA) has been modified accordingly. For this purpose, we have designed a new crossover operator and a new mutation operator to handle multiple trips and capacity constraints of vehicles. For numerical illustration, in this study, we have solved five example problems considering three levels of restrictions, for which the datasets are generated artificially. To show the effectiveness of the constraint imposed for reducing the transportation cost, the same example problems are then solved without the constraint and the results are analyzed. A comparison of results with existing algorithms proves that our algorithm is effective. Finally, some future research directions are discussed.
近年来,由于不同国家在封锁期间实施的限制措施,新冠疫情给运输公司带来了一定挑战。这些限制导致车辆行程延误和/或数量减少,尤其是前往限制更为严格地区的车辆。在疫情情况下,根据基于活跃病例数(即感染新冠病毒的人数)、死亡人数、人口、新冠医院数量等对车辆通行所施加的限制级别,各地区被分为不同类别。本研究的目的是在这种疫情情况下制定并解决一个固定费用运输问题(FCTP),并在往返限制级别较高地区的车辆最少行程次数下获得运输成本最低的运输方案。为此,基于出发地和目的地所在地区的类别,在目标函数中施加了惩罚。然而,车辆行程次数的减少可能会使运输成本增加到不切实际的水平,因此,为了将运输成本控制在一定范围内,在所提出的模型上施加了一个约束。为了解决该问题,对遗传算法(GA)进行了相应修改。为此,我们设计了一种新的交叉算子和一种新的变异算子来处理车辆的多次行程和容量约束。为了进行数值说明,在本研究中,我们针对三种限制级别求解了五个示例问题,其数据集是人工生成的。为了展示为降低运输成本而施加的约束的有效性,随后在无该约束的情况下求解相同的示例问题并分析结果。与现有算法的结果比较证明了我们的算法是有效的。最后,讨论了一些未来的研究方向。