.png){kind=icon}
返回
Localized genetic algorithm for vehicle routing problem with time windows
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2011.05.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces the Localized Optimization Framework (LOF). This framework is an iterative procedure between two phases, Optimization and De-optimization. Optimization is done on the problem parts rather than the problem as a whole, while de-optimization is done on the whole problem. To test our hypothesis, we have chosen a genetic algorithm as an optimization methodology and Vehicle Routing Problem with Time Windows (VRPTW) as a domain space. We call this new scheme the Localized Genetic Algorithm (LGA). We demonstrate that the LGA is, on average, able to produce better solutions than most of the other heuristics on small scale problems of VRPTW. Furthermore the LGA has attained several new best solutions on popular datasets. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Vehicle Routing Problem with Time Windows (VRPTW)
Localized Optimization Framework (LOF)
Localized Genetic Algorithm (LGA)
Benefit Maximization Genetic Algorithm (BMGA)
Controlled De-Optimization Procedure (CDP)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
A route-neighborhood-based metaheuristic for vehicle routing problem with time windows基于路径邻域的带时间窗车辆路径问题的元启发式算法
PREAI
分享收藏分享收藏
查看更多内容