E3S Web Conf.
Volume 211, 2020The 1st JESSD Symposium: International Symposium of Earth, Energy, Environmental Science and Sustainable Development 2020
|Number of page(s)||11|
|Published online||25 November 2020|
Optimization of solid waste collection circuits
Mohammadia School of Engineers, Hydraulic Systems Analysis Laboratory, 10090 Rabat, Morocco
* Corresponding author: firstname.lastname@example.org
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.
© The Authors, published by EDP Sciences, 2020
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.