Optimization of solid waste collection circuits

Nezha Haddoun,Driss Khomsi

doi:10.1051/e3sconf/202021103021

Abstract

The management of solid waste is a significant problem that can negatively affect human health, the environment, and the living environment. One of the biggest threats to sustainable development is environmental pollution due to poor waste management. The ‘’collection’’ component represents the most expensive link in management and is subject to several constraints. Its optimization will, therefore, make it possible to optimize the overall cost of management. Solving the problem comes down to solving the “Periodic Capacitated Arc Routing Problem” PCARP, an extension of the famous CARP problem over several periods. The objective is to minimize the number of vehicles required and the total cost of collection trips according to the set schedule. This document defines this NP-difficult problem, summarizes the different optimization methods used to solve the problem with a literature review, and discusses the latest studies and results.

Highlights

Solid waste is a threat to the quality of the environment and the living environment
The increase in the quantities of waste poses a series of problems in terms of collection, disposal, and landfill, especially in small municipalities and urban areas. 60 to 80% of solid waste management expenses is mainly linked to their pickup and transport, so good optimization of waste collection techniques will decrease the cost of their management and will lessen pollution of the environment and this by minimizing CO2 emissions, which will contribute to sustainable development
It was compared to four heuristics that have demonstrated their ability to minimize bi-objective functions: Best Insertion Heuristic (BIH), Daily Genetic Algorithm (DGA), Periodic Genetic Algorithm (PGA), and Improved Genetic Algorithm (IGA)

Summary

Introduction

Solid waste is a threat to the quality of the environment and the living environment. The road network is modeled by a graph comprising arc/edge (street) These must be treated at least once, the goal is to find a cycle (or circuit) of minimum cost crossing at least once through each network link. The objective is to find out an arrangement of days for each task and a set of tours relative to each day optimizing the total cost with the respect of the constraints below: (1) Each action [i, j] is served fij times on the horizon, but at most once a day; (2) Each trip begin and finish at the depot; (3) A task relating to a day is served by a single tour in that day; (4) The capacity of the vehicle is respected.

Method

Results and discussion

Conclusion