基于Hopfield神经网络的聚类算法求解绿色车辆路径问题

IF 1.6 3区 工程技术 Q4 ENGINEERING, INDUSTRIAL
Serap Ercan Comert, Harun Resit Yazgan, Gamze Turk
{"title":"基于Hopfield神经网络的聚类算法求解绿色车辆路径问题","authors":"Serap Ercan Comert, Harun Resit Yazgan, Gamze Turk","doi":"10.5267/j.ijiec.2022.6.002","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"27 1","pages":""},"PeriodicalIF":1.6000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Hopfield neural network based on clustering algorithms for solving green vehicle routing problem\",\"authors\":\"Serap Ercan Comert, Harun Resit Yazgan, Gamze Turk\",\"doi\":\"10.5267/j.ijiec.2022.6.002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":51356,\"journal\":{\"name\":\"International Journal of Industrial Engineering Computations\",\"volume\":\"27 1\",\"pages\":\"\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Industrial Engineering Computations\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.5267/j.ijiec.2022.6.002\",\"RegionNum\":3,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ENGINEERING, INDUSTRIAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Industrial Engineering Computations","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.5267/j.ijiec.2022.6.002","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 4

摘要

由于分销网络的迅速增加,车辆向环境排放的有毒气体也增加了,从而对健康构成威胁。本研究涉及确定绿色车辆路线的问题,旨在最大限度地减少二氧化碳排放,以满足超市连锁销售新鲜和干燥产品的客户需求。提出了一种基于聚类算法和Hopfield神经网络的方法来解决这一问题。首先利用K-Means和K-Medoids算法将大型绿色车辆的路径问题划分为多个聚类,然后利用Hopfield神经网络找到每个聚类的路径问题,使CO2排放量最小化。最后通过一个实例说明了所提方法的性能和适用性。研究得出的结论是,所提出的方法产生了非常蚕食的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hopfield neural network based on clustering algorithms for solving green vehicle routing problem
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
5.70
自引率
9.10%
发文量
35
审稿时长
20 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信