Recyclables Collection Route Balancing Problem with Heterogeneous Fleet

Abstract

Nowadays, robust and efficient solid waste collection is crucial to motivate citizens to participate in the circular economy by sorting recyclable solid waste. Vocational vehicles, including garbage trucks, contribute significantly to CO2 emissions; therefore, it is strongly recommended, and in the European Union it is mandatory, to replace conventional-fuel-based garbage trucks with electric ones. For providing sustainable and energy-efficient solid waste collection with a heterogeneous fleet, in-depth mathematical computations are needed to support solving complex decision-making problems, including crew rostering and vehicle routing, because the distance and capacity of electric garbage trucks differ from conventional-fuel-based ones. However, the literature on solid waste collection using electric garbage trucks is still relatively scarce. The main contribution of this paper is developing an optimization problem for balancing travel distance assigned to each garbage truck of a heterogeneous fleet. The problem is based on specific requirements of the Municipal Solid Waste Management in Cracow, Poland, where the working time of routes is balanced and the total time of collection service can be minimized. For the problem, an MIP program was developed to generate optimal crew schedules, so that the hitherto network of segregated solid waste pickup nodes can be served using a heterogeneous fleet in which the share of electric garbage trucks is up to 30%. We study the impact of the changed composition of the fleet on modifications in crew rostering due to the shorter range of an electric vehicle compared to a conventional-fuel-based one.

Keywords

• electric vehicle
• electric garbage trucks
• solid waste management
• solid waste collection
• vehicle routing problem
• crew rostering problem