Research Article
Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix
Algorithm 2
Calculation of the elementary routes.
| (1) | function do | | (2) | | | (3) | for each do | | (4) | switch | | (5) | case | | (6) | create_route | | (7) | case | | (8) | create_route | | (9) | case | | (10) | create_route | | (11) | end | | (12) | if | | (13) | | | (14) | end | | (15) | end | | (16) | return R | | (17) | end |
|