期刊
APPLIED SOFT COMPUTING
卷 13, 期 4, 页码 1693-1704出版社
ELSEVIER
DOI: 10.1016/j.asoc.2013.01.007
关键词
Particle Swarm Optimization; Path relinking; Vehicle Routing Problem with Stochastic; Demands
This paper introduces a new hybrid algorithmic approach based on Particle Swarm Optimization (PSO) for successfully solving one of the most popular supply chain management problems, the Vehicle Routing Problem with Stochastic Demands (VRPSD). The VRPSD is a well known NP-hard problem in which a vehicle with finite capacity leaves from the depot with full load and has to serve a set of customers whose demands are known only when the vehicle arrives to them. A number of different variants of the PSO are tested and the one that performs better is used for solving benchmark instances from the literature. (C) 2013 Elsevier B. V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据