.png){kind=icon}
返回
Multi-Depot Split-Delivery Vehicle Routing Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3103640.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The rapid advancements in information technologies and globalization change the way of distributing goods to customers. Many enterprises have multiple factories, warehouses, and distribution centers and strive for competitive efficiency in the distribution operations to minimize transportation costs. This study proposed the mixed-integer programming (MIP) model for the multi-depot split-delivery vehicle routing problems (MDSDVRPs) with hetero vehicles, allowing multiple visits to a customer. A genetic algorithm (GA) with a novel two-dimensional chromosome representation has been proposed with dynamic mutation policies. The process parameters of the proposed GA are optimized using the Taguchi method. The proposed algorithms showed the benefits of split-delivery in MDSDVRPs and showed the competitive performance even for the classical single-depot vehicle routing problems with no split-delivery.
Keyword:
Genetic algorithms
Vehicle routing
Statistics
Sociology
Approximation algorithms
Search problems
Programming
Vehicle routing problem (VRP)
multi-depot split-delivery VRP
genetic algorithm (GA)
taguchi method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Electric Vehicle Routing Problem with Battery Swapping Considering Energy Consumption and Carbon Emissions考虑能耗和碳排放的电池交换电动汽车路径问题.png)
SUSTAINABILITY
OAAI
SUSTAINABILITYIF3.3
OAAI分享收藏分享收藏
查看更多内容