Research Article
Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm
Algorithm 1
The initial solution based on CW.
Main: Clarke And Wright savings algorithm | Input: the number of customers and vehicles, the capacity of vehicles | Output: set of initial solution | Begin | for each day do | while number of routes number of vehicles do | shortest route:= find route with fewest number of customers | for each customer shortest route do | delete current route | insert in cheapest position of the remaining routes | end for | end while | end for | end Begin |
|