The Selective Traveling Salesman Problem with Draft Limits

Session : PLNE / Programmation linéaire en nombres entiers
Mercredi 10 février 11:00 - 12:40 Salle : CI2-06
Raca Todosijevic, Shahin Gelareh et Said Hanafi

In this paper we introduce new variant of Traveling Salesman Problem with Draft Limits (STSPDL) called Selective TSPDL and formulate it as a mixed integer program (MIP). The proposed MIP formulation turns out suitable for solving small size instances, while on large size instances General Variable Neighborhood Search (GVNS) appears to be good alternative. The metaheuristic GVNS succeeds to find all solutions whose optimality were proven solving MIP formulation.

Mots clés : Traveling Salesman Problem , Draft limits, Profits, Variable Neighborhood Search