Introducing Complexity Curtailing Techniques for the Tour Construction Heuristics for the Travelling Salesperson Problem

Procedure 2

Fast largest insertion heuristic (FLIH).

Procedure FLIH starts

Form circular linked list of cities not in the subtour

Form empty Linked list

Choose an arbitrary city

Delete from the list

Insert in the empty list

Initialize expansion costs and 2nd 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      

         end if

     while all in not visited

     Choose city in such that

     Delete from the list

     Insert in on the edge connected to

end while

Procedure FLIH ends