Research Article
Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix
Algorithm 4
Updating the saving matrix.
(1) | function do | (2) | create_route() | (3) | if | (4) | for each k do | (5) | | (6) | end | (7) | oined_vertex () | (8) | for each kdo | (9) | | (10) | end | (11) | else | (12) | if | (13) | for each k do | (14) | | (15) | end | (16) | | (17) | | (18) | for each k do | (19) | | (20) | end | (21) | else | (22) | if | (23) | for each k do | (24) | | (25) | end | (26) | | (27) | | (28) | | (29) | for each kdo | (30) | | (31) | end | (32) | else | (33) | if | (34) | for each k do | (35) | for each l do | (36) | if () | (37) | | (38) | else | (39) | | (40) | end | (41) | end | (42) | end | (43) | else | (44) | for each k do | (45) | | (46) | end | (47) | for each k do | (48) | | (49) | end | (50) | end | (51) | end | (52) | end | (53) | end | (54) | if | (55) | | (56) | | (57) | | (58) | else | (59) | | (60) | end | (61) | end |
|