Research Article
Introducing Complexity Curtailing Techniques for the Tour Construction Heuristics for the Travelling Salesperson Problem
Procedure 3
Fast max difference insertion heuristic (FMDIH).
Procedure FMDIH starts | Form circular linked list of cities not in the subtour | Form empty Linked list | Setup initial subtour of three cities | Delete from the list | Insert in the empty list | Initialize expansion costs, 2nd expansion costs and 3rd expansion costs w.r.t. all in to very high value | while is not empty do begin | do begin (Visit all in ) | Let | = Cost of insertion of city on 1st newly formed edge | = Cost of insertion of city on 2nd newly formed edge | = | = | = | If expansion cost edge is broken in last iteration | then | else if 2nd expansion cost edge is broken in last iteration | then | else if 3rd expansion cost edge is broken in last iteration | then | else | end if | while all in not visited | Choose city in such that cost difference | Delete from the list | Insert in on the edge connected to | end while | Procedure FMDIH ends |
|