A robust bi-objective multi-trip periodic capacitated arc routing problem for urban waste collection using a multi-objective invasive weed optimization.

Abstract

Urban waste collection is one of the principal processes in municipalities with large expenses and laborious operations. Among the important issues raised in this regard, the lack of awareness of the exact amount of generated waste makes difficulties in the processes of collection, transportation and disposal. To this end, investigating the waste collection issue under uncertainty can play a key role in the decision-making process of managers. This paper addresses a novel robust bi-objective multi-trip periodic capacitated arc routing problem under demand uncertainty to treat the urban waste collection problem. The objectives are to minimize the total cost (i.e. traversing and vehicles' usage costs) and minimize the longest tour distance of vehicles (makespan). To validate the proposed bi-objective robust model, the ε-constraint method is implemented using the CPLEX solver of GAMS software. Furthermore, a multi-objective invasive weed optimization algorithm is then developed to solve the problem in real-world sizes. The parameters of the multi-objective invasive weed optimization are tuned optimally using the Taguchi design method to enhance its performance. The computational results conducted on different test problems demonstrate that the proposed algorithm can generate high-quality solutions considering three indexes of mean of ideal distance, number of solutions and central processing unit time. It is proved that the ε-constraint method and multi-objective invasive weed optimization can efficiently solve the small- and large-sized problems, respectively. Finally, a sensitivity analysis is performed on one of the main parameters of the problem to study the behavior of the objective functions and provide the optimal policy.