Reoptimization Heuristic for the Capacitated Vehicle Routing Problem

Pseudocode 1

Dispersion minimization reoptimization algorithm.

1 For each  node in nodes  do:

2    r = NULL, KPI = +inf

3    For each  route in routes  do:

4             If  load(route) + demand(node) > capacity  then  Skip route

5             KPIm = KPI marginal when inserting node in route

6             If  (KPI < KPIm)  then

7            r = route

8            KPI = KPIm

9    If  r == NULL then

10         r = new route

11    cheapest insertion of node in r

12 End