Heuristics for a generalization of TSP in the context of PCB assembly

Traveling Salesm an Problem (TSP) is one o f the m ost w ell-know n N P -H ard com binatorial optim ization problem s. A dding new constraints to the problem yields different generalizations to the problem a n d each new generalization fo rm s the basis o f a new research area. In this study, w e propose new techniques fo r a generalization o f the TSP. In this problem , the cost o f traveling between two cities does no t only depend on the distance betw een these cities, but also on the visiting sequence. W e ana lyzed the problem under d ifferent conditions; the f ir s t a n d last points (nodes) are se t f ix e d or they are fr e e a n d fo r so lving the problem we propose several heuristics. After analyzing constructive heuristics, im provem ent heuristics are applied . As im provem ent heuristics, w e im plem ented pair-w ise exchange procedure (PEP) a n d record-to-record travel w ith local exchange m oves (R TR LE M ). C om parison o f these approaches together w ith their param eter f in e tuning are g iven .