Title of article :
A Modified Harmony Search Algorithm for Solving the Dynamic Vehicle Routing Problem with Time Windows
Author/Authors :
Chen, Shifeng Department of Information Science and Technology - Dalian Maritime University , China , Chen, Rong Department of Information Science and Technology - Dalian Maritime University , China , Gao, Jian Department of Information Science and Technology - Dalian Maritime University , China
Pages :
14
From page :
1
To page :
14
Abstract :
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.
Keywords :
Search Algorithm , Dynamic Vehicle Routing , Time Windows , Solving Problem
Journal title :
Scientific Programming
Serial Year :
2017
Full Text URL :
Record number :
2607681
Link To Document :
بازگشت