FUZZY LOGIC BASED CAPACITY OPTIMIZATION IN HEURISTIC VEHICLE ROUTING PROBLEMS: A CASE STUDY IN A FLOUR MILL

Aysun Altinkaya, M. Tunca
{"title":"FUZZY LOGIC BASED CAPACITY OPTIMIZATION IN HEURISTIC VEHICLE ROUTING PROBLEMS: A CASE STUDY IN A FLOUR MILL","authors":"Aysun Altinkaya, M. Tunca","doi":"10.55580/oguzhan.1107296","DOIUrl":null,"url":null,"abstract":"Vehicle Routing Problem (VRP) is used to ensure that customer requirements are met on time and at minimum cost. With VRP, it is aimed to create routes that enable the movement of limited capacity vehicles or vehicles to customers in different regions, with the lowest cost from a depot. Therefore, the purpose of the Vehicle Routing Problem, which deals with product distribution between the depot and the customers, is to determine the vehicle routes in a way that will serve all customers by minimizing the total travel costs. In this study, it is aimed to minimize transportation costs by improving the capacity utilization of the vehicles, used for deliveries from the central depot of a flour mill, operating in the city center of Isparta to customers in the city and district centers of Isparta, Denizli, Burdur, Afyon and Antalya. Within the scope of the study, after the routes were determined with the Savings Algorithm, alternative solutions were obtained by fuzzying the demand data with the help of Fuzzy Logic in order to improve the capacity ratios of the vehicles.","PeriodicalId":103645,"journal":{"name":"Oğuzhan Sosyal Bilimler Dergisi","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Oğuzhan Sosyal Bilimler Dergisi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.55580/oguzhan.1107296","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Vehicle Routing Problem (VRP) is used to ensure that customer requirements are met on time and at minimum cost. With VRP, it is aimed to create routes that enable the movement of limited capacity vehicles or vehicles to customers in different regions, with the lowest cost from a depot. Therefore, the purpose of the Vehicle Routing Problem, which deals with product distribution between the depot and the customers, is to determine the vehicle routes in a way that will serve all customers by minimizing the total travel costs. In this study, it is aimed to minimize transportation costs by improving the capacity utilization of the vehicles, used for deliveries from the central depot of a flour mill, operating in the city center of Isparta to customers in the city and district centers of Isparta, Denizli, Burdur, Afyon and Antalya. Within the scope of the study, after the routes were determined with the Savings Algorithm, alternative solutions were obtained by fuzzying the demand data with the help of Fuzzy Logic in order to improve the capacity ratios of the vehicles.
基于模糊逻辑的启发式车辆路径优化:以面粉厂为例
车辆路径问题(VRP)用于保证以最小的成本按时满足客户的需求。通过VRP,它旨在创建路线,使有限容量的车辆或车辆能够以最低的成本从仓库移动到不同地区的客户。因此,车辆路线问题的目的是确定车辆路线,通过最小化总旅行成本来为所有客户服务。车辆路线问题处理的是仓库和客户之间的产品分配。在这项研究中,它的目的是通过提高车辆的能力利用率来最大限度地降低运输成本,这些车辆用于从伊斯帕塔市中心的一家面粉厂的中央仓库运送到伊斯帕塔、德尼兹利、布尔杜尔、阿菲永和安塔利亚等城市和地区中心的客户。在研究范围内,利用节约算法确定路线后,利用模糊逻辑对需求数据进行模糊处理,得到备选方案,以提高车辆的运力比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信