.png){kind=icon}
返回
A multi-parametric evolution strategies algorithm for vehicle routing problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2005.12.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational testing on six real-life problems and 195 benchmark problems demonstrate that the suggested algorithm is efficient and highly competitive, improving or matching the current best-known solution in 42% of the test cases. (C) 2005 Elsevier Ltd. All rights reserved.
Keyword:
distribution management
vehicle routing problem
heuristics
evolution strategies
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏A route-neighborhood-based metaheuristic for vehicle routing problem with time windows基于路径邻域的带时间窗车辆路径问题的元启发式算法
PREAI
分享收藏分享收藏
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints具有时间窗约束的车辆路径和调度问题的算法
PREAI
分享收藏
查看更多内容