Search

This paper studies a multi-trip vehicle routing problem with time windows specifically related to urban waste collection. Urban waste collection is one of the municipal activities with large costs and has many practical difficulties. In other words, waste collection and disposal is a costly task due to high operating expenses (fuel, maintenance, recycling, manpower, etc.) and small improvements in this field can result in tremendous savings on municipal expenditure. In the raised problem, the goal is to minimize total cost including traversing cost, vehicle employment cost, and exit penalty from permissible time windows. In this problem, the waste is deposited at the points indicating the demand nodes, in which each demand shows the volume of generated waste. Considering multiple trips for vehicles and time windows are the most critical features of the problem, so that the priorities of serving some specific places such as hospitals can be observed. Since vehicle routing problems (VRP) belongs to NP-hard problems, an efficient simulated annealing (SA) is proposed to solve the problem. The computational results show that our proposed algorithm has a great performance in a short computational time in comparison with the CPLEX solver. Finally, in order to demonstrate the applicability of the model, a case study is analyzed in Iran, and the optimal policies are presented.

The performance of waste management system has been recently interrupted and encountered a very serious situation due to the epidemic outbreak of the novel Coronavirus (COVID-19). To this end, the handling of infectious medical waste has been particularly more vital than ever. Therefore, in this study, a novel mixed-integer linear programming (MILP) model is developed to formulate the sustainable multi-trip location-routing problem with time windows (MTLRP-TW) for medical waste management in the COVID-19 pandemic. The objectives are to concurrently minimize the total traveling time, total violation from time windows/service priorities and total infection/environmental risk imposed on the population around disposal sites. Here, the time windows play a key role to define the priority of services for hospitals with a different range of risks. To deal with the uncertainty, a fuzzy chance-constrained programming approach is applied to the proposed model. A real case study is investigated in Sari city of Iran to test the performance and applicability of the proposed model. Accordingly, the optimal planning of vehicles is determined to be implemented by the municipality, which takes 19.733 h to complete the processes of collection, transportation and disposal. Finally, several sensitivity analyses are performed to examine the behavior of the objective functions against the changes of controllable parameters and evaluate optimal policies and suggest useful managerial insights under different conditions., Graphical abstract Unlabelled Image, Highlights • Addressing the sustainability of location-routing problem under the pandemic situation • Applying fuzzy chance-constrained programming technique to address the uncertainty • Implementing weighted goal programming method to deal with the mutli-objectiveness • Investigating applicability of the proposed methodology using a real case study.