Y. Cohen, J. Reis, F. Pilati

This study examines several significant improvements to the penalty method suggested by Martello and Toth (1981) for the assignment problem. It is shown that these improvements reduce the possible effect of worst case scenarios. Based on the principles of the improved assignment, a heuristic procedure is proposed for solving the TSP. Again, it is shown that the effect of worst case scenario is greatly reduced by using this heuristic when compared to the Nearest Neighbor approach.

Keywords: Penalty, Assignment, TSP, Traveling Salesman, Myopic, Heuristic


TB3 TSP and its variants
June 10, 2021  11:15 AM
3 - TC Koopmans

Latest news

  • 6/5/21
    Conference abstract book

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.