.png){kind=icon}
返回
A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet
.png){kind=icon}
PRE
AI
DOI：10.1016/S0167-739X(98)00034-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nowadays genetic algorithms stand as a trend to solve NP-complete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses parallel genetic algorithms and scatter search coupled with a decomposition-into-petals procedure for solving a class of vehicle routing and scheduling problems. The parallel genetic algorithm presented is based on the island model and its performance is evaluated for a heterogeneous fleet problem, which is considered a problem much harder to solve than the homogeneous vehicle routing problem. (C) 1998 Elsevier Science B.V. All rights reserved.
Keyword:
parallel algorithms
metaheuristics
vehicle routing problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容