Dual-objective modelling and optimization for a low-carbon waste classified collection problem

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

Abstract Recently, waste collection has become a research hotspot and an urgent problem to be solved due to the explosive growth of waste. With the improvement of the quality of life, there are various kinds of waste, which has caused great difficulties for waste collection. As a result, waste classified collection is proposed worldwide. However, the existing research on waste collection pays little attention to waste classification, and most of them aim to minimize the cost without consideration of it. In this paper, we consider the pretreatment and classification of waste transfer stations. In recent years, global warming caused by carbon emission has already become a serious problem. Therefore, this work proposes a dual-objective multi-depot two-echelon green vehicle routing problem with various pickups to optimize waste classified collection for the first time, and then we establish a mixed-integer programming model. To solve our investigated model effectively, we design a multi-objective brain storm optimization algorithm where a novel clustering strategy based on rank method and differential mutation are used. Compared with two classical multi-objective optimization algorithms on some generated test instances and a real-world case, the experimental results show that the proposed model helps sanitation departments improve economic and environmental benefits of waste classified collection, and the proposed algorithm is an excellent optimizer to solve the concerned problem

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-26T02:00:01.498150+00:00
License: CC-BY-4.0