A New Approach to Solve MDVRP in Lower Computation Time

R. R. Baghbadorani, M. A. Zajkani, M. Haeri
{"title":"A New Approach to Solve MDVRP in Lower Computation Time","authors":"R. R. Baghbadorani, M. A. Zajkani, M. Haeri","doi":"10.1109/ICEE52715.2021.9544126","DOIUrl":null,"url":null,"abstract":"Vehicle routing problem is one of the complex and NP-hard problems, which plays a crucial role in this hectic world regarding people's lifestyle. Nowadays, many people provide their stuff online, so a logistic problem has been outstripped for companies to reduce their transportation costs. In this article, a novel approach has been introduced, which can solve the multi-depot vehicle routing problem in shorter time. By using clustering and decomposing the main problem into smaller ones, solution time has been dropped dramatically. In addition, this approach obtains a reasonable cost, which can be considered as fuel consumption, distance, or so forth. This method could reduce the solution time drastically.","PeriodicalId":254932,"journal":{"name":"2021 29th Iranian Conference on Electrical Engineering (ICEE)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 29th Iranian Conference on Electrical Engineering (ICEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEE52715.2021.9544126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Vehicle routing problem is one of the complex and NP-hard problems, which plays a crucial role in this hectic world regarding people's lifestyle. Nowadays, many people provide their stuff online, so a logistic problem has been outstripped for companies to reduce their transportation costs. In this article, a novel approach has been introduced, which can solve the multi-depot vehicle routing problem in shorter time. By using clustering and decomposing the main problem into smaller ones, solution time has been dropped dramatically. In addition, this approach obtains a reasonable cost, which can be considered as fuel consumption, distance, or so forth. This method could reduce the solution time drastically.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解MDVRP的一种新方法
车辆路径问题是一个复杂的NP-hard问题,在当今繁忙的世界中对人们的生活方式起着至关重要的作用。如今,许多人在网上提供他们的东西,所以物流问题已经超越了公司,以降低他们的运输成本。本文提出了一种能在较短时间内解决多车场车辆调度问题的新方法。通过使用聚类并将主要问题分解成较小的问题,大大缩短了求解时间。此外,这种方法获得了一个合理的成本,可以考虑为燃料消耗,距离等。该方法可大大缩短溶液时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Model for Backcasting the Environmental Sustainability in Iran's Electricity Supply Mix Multi WGAN-GP loss for pathological stain transformation using GAN Bit Error Rate Improvement in Optical Camera Communication Based on RGB LED Robust IDA-PBC for a Spatial Underactuated Cable Driven Robot with Bounded Inputs Switched Robust Model Predictive Based Controller for UAV Swarm System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1