期刊
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS
卷 13, 期 4, 页码 573-586出版社
GROWING SCIENCE
DOI: 10.5267/j.ijiec.2022.6.002
关键词
Green vehicle routing problem; Hopfield Neural Network; K-means clustering algorithm; K-medoids clustering algorithm
Due to the expansion of the distribution network, the emission of toxic gases from vehicles has increased, posing a threat to the environment and health. This study proposes a new method based on clustering algorithms and Hopfield Neural Network to minimize CO2 emissions in the green vehicle routing problem for a supermarket chain. The results show that the proposed approach produces very satisfactory results.
As a result of the rapidly increasing distribution network, the toxic gases emitted by the vehicles to the environment have also increased, thus posing a threat to health. This study deals with the problem of determining green vehicle routes aiming to minimize CO2 emissions to meet customers' demand in a supermarket chain that distributes fresh and dried products. A new method based on clustering algorithms and Hopfield Neural Network is proposed to solve the problem. We first divide the large-size green vehicle routing problem into clusters using the K-Means and K-Medoids algorithms, and then the routing problem for each cluster is found using the Hopfield Neural Network, which minimizes CO2 emissions. A real-life example is carried out to illustrate the performance and applicability of the proposed method. The research concludes that the proposed approach produces very encroaching results. (C) 2022 by the authors; licensee Growing Science, Canada
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据