Traveling Salesman Problem with Transportation

Abstract

Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined – a synthesis of classical TSP and classical Transportation Problem. Algorithms based on Integer Programming cutting-plane methods and Branch and Bound Techniques are obvious.

Keywords

• NTraveling Salesman Problem with Transportation and Fixed Additional Payments (TSPT)
• TSP
• algorithm
• computational complexity