A Modified Harmony Search Algorithm for Solving the Dynamic Vehicle Routing Problem with Time Windows
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 invest...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2017-01-01
|
| Series: | Scientific Programming |
| Online Access: | http://dx.doi.org/10.1155/2017/1021432 |