文章基本信息

标题：A Modified Harmony Search Algorithm for Solving the Dynamic Vehicle Routing Problem with Time Windows
本地全文：下载
作者：Shifeng Chen ; Rong Chen ; Jian Gao 等
期刊名称：Scientific Programming
印刷版ISSN：1058-9244
出版年度：2017
卷号：2017
DOI：10.1155/2017/1021432
出版社：Hindawi Publishing Corporation
摘要：The Vehicle Routing Problem (VRP) is a classical combinatorial optimization problem. It is usually modelled in a static fashion; however, in practice, new requests by customers arrive after the initial workday plan is in progress. In this case, routes must be replanned dynamically. This paper investigates the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) in which customers’ requests either can be known at the beginning of working day or occur dynamically over time. We propose a hybrid heuristic algorithm that combines the harmony search (HS) algorithm and the Variable Neighbourhood Descent (VND) algorithm. It uses the HS to provide global exploration capabilities and uses the VND for its local search capability. In order to prevent premature convergence of the solution, we evaluate the population diversity by using entropy. Computational results on the Lackner benchmark problems show that the proposed algorithm is competitive with the best existing algorithms from the literature.