The selective traveling salesman problem with draft limits

作     者：Gelareh, Shahin Gendron, Bernard Hanafi, Said Neamatian Monemi, Rahimeh Todosijevic, Raca 

作者机构：Univ Artois IUT Bethune Dept Reseaux & Telecoms F-62000 Bethune France Univ Montreal Dept Informat & Rech Operat CP 6128Succursale Ctr Ville Montreal PQ H3C 3J7 Canada Univ Montreal CIRRELT CP 6128Succursale Ctr Ville Montreal PQ H3C 3J7 Canada Univ Polytech Hauts De France CNRS UMR 8201 LAMIH F-59313 Valenciennes 9 France Univ Southampton IT Innovat Ctr Southampton Hants England 

出 版 物：《JOURNAL OF HEURISTICS》 (试探法杂志)

年 卷 期：2020年第26卷第3期

页      面：339-352页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Selective traveling salesman problem with draft limits Variable neighborhood search Location neighborhood structures Traveling salesman neighborhood structures Mixed integer linear programming 

摘      要：This paper introduces the selective traveling salesman problem with draft limits, an extension of the traveling salesman problem with draft limits, wherein the goal is to design a maximum profit tour respecting draft limit constraints at the visited nodes. We propose a mixed integer linear programming (MILP) formulation for this problem. This MILP model is used to solve-to optimality-small size instances and to assess the quality of solutions obtained using a general variable neighborhood search heuristic that explores several neighborhood structures. Our extensive computational experiments confirm the efficiency of the method and the quality of the reported solutions.