The Selective Traveling Salesman Problem with Draught Limits

This paper introduces the Selective Traveling Salesman Problem with Draught Limits, an extension of Traveling Salesman Problem with Draught Limits, wherein the goal is to design maximal profit tour respecting draught limit constraints of the visited ports. We propose a mixed integer linear programming formulation for this problem. The proposed mixed integer program is used … Read more