时间窗车辆路径问题:禁忌搜索算法

IF 1.7 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Hasibe Berfu Demir, Ebru Pekel Özmen, Şakir Esnaf
{"title":"时间窗车辆路径问题:禁忌搜索算法","authors":"Hasibe Berfu Demir, Ebru Pekel Özmen, Şakir Esnaf","doi":"10.14201/adcaij.27533","DOIUrl":null,"url":null,"abstract":"Vehicle routing problem (VRP); it is defined as the problem of planning the best distribution or collection routes of the vehicles assigned to serve the scattered centers from one or more warehouses in order to meet the demands of the customers. Vehicle routing problem has been a kind of problem in which various studies have been done in recent years. Many vehicle routing problems include scheduling visits to customers who are available during certain time windows. These problems are known as vehicle routing problems with time windows (VRPTWs). In this study, a tabu search optimization is proposed for the solution of time window vehicle routing problem (VRPTWs). The results were compared with the current situation and the results were interpreted.","PeriodicalId":42597,"journal":{"name":"ADCAIJ-Advances in Distributed Computing and Artificial Intelligence Journal","volume":"20 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Time-Windowed Vehicle Routing Problem: Tabu Search Algorithm Approach\",\"authors\":\"Hasibe Berfu Demir, Ebru Pekel Özmen, Şakir Esnaf\",\"doi\":\"10.14201/adcaij.27533\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicle routing problem (VRP); it is defined as the problem of planning the best distribution or collection routes of the vehicles assigned to serve the scattered centers from one or more warehouses in order to meet the demands of the customers. Vehicle routing problem has been a kind of problem in which various studies have been done in recent years. Many vehicle routing problems include scheduling visits to customers who are available during certain time windows. These problems are known as vehicle routing problems with time windows (VRPTWs). In this study, a tabu search optimization is proposed for the solution of time window vehicle routing problem (VRPTWs). The results were compared with the current situation and the results were interpreted.\",\"PeriodicalId\":42597,\"journal\":{\"name\":\"ADCAIJ-Advances in Distributed Computing and Artificial Intelligence Journal\",\"volume\":\"20 1\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2022-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ADCAIJ-Advances in Distributed Computing and Artificial Intelligence Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14201/adcaij.27533\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ADCAIJ-Advances in Distributed Computing and Artificial Intelligence Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14201/adcaij.27533","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 1

摘要

车辆路径问题(VRP);它被定义为规划从一个或多个仓库分配到分散中心的车辆的最佳配送或收集路线的问题,以满足客户的需求。车辆路径问题是近年来研究较多的一类问题。许多车辆路线问题包括安排访问在特定时间窗口内可用的客户。这些问题被称为带时间窗的车辆路线问题(VRPTWs)。针对时间窗车辆路径问题,提出了一种禁忌搜索优化算法。将结果与现状进行了比较,并对结果进行了解释。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Time-Windowed Vehicle Routing Problem: Tabu Search Algorithm Approach
Vehicle routing problem (VRP); it is defined as the problem of planning the best distribution or collection routes of the vehicles assigned to serve the scattered centers from one or more warehouses in order to meet the demands of the customers. Vehicle routing problem has been a kind of problem in which various studies have been done in recent years. Many vehicle routing problems include scheduling visits to customers who are available during certain time windows. These problems are known as vehicle routing problems with time windows (VRPTWs). In this study, a tabu search optimization is proposed for the solution of time window vehicle routing problem (VRPTWs). The results were compared with the current situation and the results were interpreted.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.40
自引率
0.00%
发文量
22
审稿时长
4 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学术官方微信