点击次数：

论文类型：期刊论文

发表时间：2013-04-01

发表刊物：INTERNATIONAL JOURNAL OF LOGISTICS-RESEARCH AND APPLICATIONS

收录刊物：SSCI、Scopus

卷号：16

期号：2

页面范围：144-157

ISSN号：1367-5567

关键字：dynamic multi-depot vehicle routing problem; distance-based clustering approach; improved ant colony optimisation; nearest addition approach

摘要：Dynamic vehicle routing problem (DVRP) with single depot has received increasing interest from engineers and scientists. Dynamic multi-depot vehicle routing problem (DMDVRP), an extension of DVRP, however, has not received much attention. In our paper, a distance-based clustering approach is introduced to simplify the DMDVRP by allocating each customer to its nearest depot. Thus, DMDVRP is decomposed to a sequence of DVRPs. An improved ant colony optimisation (IACO) with ant-weight strategy and mutation operation is presented to optimise vehicle routing problem (VRP) in this paper. Moreover, to satisfy the real-time feature of DMDVRP, the nearest addition approach is used to handle the new orders occurring during a time slice on the basis of VRP solution. Finally, the computational results for 17 benchmark problems are reported to validate that IACO with the distance-based clustering approach is more suitable for solving DMDVRP.