The Efficiency of Solid Waste Logistics Management: A Prominent Case Study of Banped Subdistrict, Municipality Mueang Khon Kaen District, Khon Kaen Province

Uraiwan Yuttasinsewee, Assoc. Prof. Ph.D. Krittapha Saenchaiyathon
{"title":"The Efficiency of Solid Waste Logistics Management: A Prominent Case Study of Banped Subdistrict, Municipality Mueang Khon Kaen District, Khon Kaen Province","authors":"Uraiwan Yuttasinsewee, Assoc. Prof. Ph.D. Krittapha Saenchaiyathon","doi":"10.35609/gcbssproceeding.2023.1(155)","DOIUrl":null,"url":null,"abstract":"Solid waste is a significant issue worldwide, and it is concerned by many countries worldwide. Local government has a substantial role in managing solid waste. Solid waste is increasing yearly because of several causes, such as the rapidly rising population and the massive city's expansion into suburban areas. The Municipal takes responsibility to collect and dispose of the solid waste in their responsible area. This article aims to forecast solid waste in the future using four methods: static methods, exponential smoothing, Holt's model, and Winter's model. Then, compare all methods to find the optimal ones with the most accurate forecasting. By determining the criteria, the forecast error measures are the absolute deviation (MAD) and the mean of the absolute percentage error (MAPE), which have a minimum error. One of the other purposes is to develop an optimization route that provides the possibility of decreasing distances and reducing transportation expenses. Typically, the most common methods are the Traveling Salesman Problem (TSP) and Vehicle Routing Problem (VRP) to solve the problems. This article will use two algorithms for two steps. The first step is to set the routes with the nearest neighbor heuristic (NN) to generate the routes MSW from point to point until all are reached and return to the origin point. In the second step, improve the routes by using the 2-Opt heuristic. The results found that the 2-Opt can decrease transportation distances, which is optimal and saves costs. In addition to that, it can make process management more effective. Keywords: Forecasting, Nearest Neighbour Heuristic, 2-Opt Heuristic, Travelling Salesman Problem","PeriodicalId":143319,"journal":{"name":"Global Conference on Business and Social Sciences Proceeding","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Global Conference on Business and Social Sciences Proceeding","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35609/gcbssproceeding.2023.1(155)","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Solid waste is a significant issue worldwide, and it is concerned by many countries worldwide. Local government has a substantial role in managing solid waste. Solid waste is increasing yearly because of several causes, such as the rapidly rising population and the massive city's expansion into suburban areas. The Municipal takes responsibility to collect and dispose of the solid waste in their responsible area. This article aims to forecast solid waste in the future using four methods: static methods, exponential smoothing, Holt's model, and Winter's model. Then, compare all methods to find the optimal ones with the most accurate forecasting. By determining the criteria, the forecast error measures are the absolute deviation (MAD) and the mean of the absolute percentage error (MAPE), which have a minimum error. One of the other purposes is to develop an optimization route that provides the possibility of decreasing distances and reducing transportation expenses. Typically, the most common methods are the Traveling Salesman Problem (TSP) and Vehicle Routing Problem (VRP) to solve the problems. This article will use two algorithms for two steps. The first step is to set the routes with the nearest neighbor heuristic (NN) to generate the routes MSW from point to point until all are reached and return to the origin point. In the second step, improve the routes by using the 2-Opt heuristic. The results found that the 2-Opt can decrease transportation distances, which is optimal and saves costs. In addition to that, it can make process management more effective. Keywords: Forecasting, Nearest Neighbour Heuristic, 2-Opt Heuristic, Travelling Salesman Problem
固体废物物流管理效率研究——以孔敬省孟孔敬区班班街道为例
固体废物是一个世界性的重大问题,受到世界上许多国家的关注。地方政府在管理固体废物方面发挥着重要作用。由于人口的迅速增长和大城市向郊区的扩张等原因,固体废物每年都在增加。市负责本辖区固体废物的收集和处置。本文旨在利用静态方法、指数平滑法、Holt模型和Winter模型四种方法对未来的固体废物进行预测。然后,对各种方法进行比较,找出预测最准确的最优方法。通过确定标准,预测误差度量是绝对偏差(MAD)和绝对百分比误差(MAPE)的平均值,它们具有最小误差。另一个目的是开发一条优化路线,提供缩短距离和减少运输费用的可能性。通常,最常用的解决方法是旅行商问题(TSP)和车辆路径问题(VRP)。本文将对两个步骤使用两种算法。第一步是使用最近邻启发式算法(NN)设置路由,从一个点到另一个点生成路由MSW,直到所有路由都到达并返回原点。在第二步中,使用2-Opt启发式算法改进路由。结果表明,2-Opt可以缩短运输距离,达到最优,节约成本。除此之外,它还可以使流程管理更加有效。关键词:预测,最近邻启发式,2-Opt启发式,旅行商问题
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信