4.7 Article

Heuristic approaches to address vehicle routing problem in the Iot-based waste management system

期刊

EXPERT SYSTEMS WITH APPLICATIONS
卷 220, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2023.119708

关键词

Waste Management System; Internet of Things; Vehicle Routing Problem; Smart Cities; Heuristics

向作者/读者索取更多资源

This study proposes a two-echelon waste management system (WMS) based on industry 4.0 concept to minimize operational costs and environmental impact. The system utilizes modern traceability Internet of Things devices to compare real-time waste levels with the threshold waste level parameter. The first model optimizes the operational cost and CO2 emission of waste collection, while the later model aims to minimize the cost of waste transferring to recycling centers. Recent meta-heuristic algorithms are employed to find the optimal solution, and novel heuristics based on the problem's specifications are developed.
Nowadays, population growth and urban development lead to having an efficient waste management system (WMS) based on recent advances and trends. Alongside all functions and procedures in these systems, the waste collection plays a significant role. This study proposes a two-echelon WMS to minimize operational costs and environmental impact by utilizing the industry 4.0 concept. Both models utilize modern traceability Internet of Thing-based devices to compare real-time information of waste level in bins and separation centers with the threshold waste level (TWL) parameter. The first model optimizes the operational cost and CO2 emission of collecting waste from bins to the separation center by considering the time windows. A capacitated vehicle routing problem is designed as a later model-based to minimize the cost of waste transferring to recycling centers. In addition, to find the optimal solution, recent meta-heuristic algorithms are employed, and several novel heuristics based on the problem's specifications are developed. Furthermore, the developed heuristics methods are utilized to generate the initial feasible solutions in meta-heuristics and compared with random ones. The performance of the proposed algorithms is probed, and Best Worst Method (BWM) is applied to rank the algorithms based on relative percentage deviation, relative deviation index and hitting time.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据