期刊
APPLIED SOFT COMPUTING
卷 11, 期 8, 页码 5375-5390出版社
ELSEVIER
DOI: 10.1016/j.asoc.2011.05.021
关键词
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)
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据