4.7 Article

A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests

期刊

APPLIED SOFT COMPUTING
卷 12, 期 4, 页码 1426-1439

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2011.10.023

关键词

Vehicle routing problem (VRP); Dynamic vehicle routing problem (DVRP); Degree of dynamism (dod); Particle swarm optimization (PSO); Variable neighborhood search (VNS); Adaptive memory; Performance measures for dynamic problems

资金

  1. French National Institute for Research in Computer Science and Control (INRIA)
  2. Spanish Ministry of Sciences and Innovation European FEDER [TIN2008-06491-C04-01]
  3. Spanish Government [AP2009-1680]
  4. CNRS
  5. RENATER
  6. CICE, Junta de Andalucia [P07-TIC-03044]

向作者/读者索取更多资源

Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data are known in advance, i.e. before the optimization process has started. However, in practice, many problems are dynamic, and change while the optimization is in progress. For example, in the dynamic vehicle routing problem (DVRP), new orders arrive when the working day plan is in progress. In this case, routes must be reconfigured dynamically while executing the current simulation. The DVRP is an extension of a conventional routing problem, its main interest being the connection to many real word applications (repair services, courier mail services, dial-a-ride services, etc.). In this article, a DVRP is examined, and solving methods based on particle swarm optimization and variable neighborhood search paradigms are proposed. The performance of both approaches is evaluated using a new set of benchmarks that we introduce here as well as existing benchmarks in the literature. Finally, we measure the behavior of both methods in terms of dynamic adaptation. (c) 2011 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据