Skip to Main content Skip to Navigation
Journal articles

The selective traveling salesman problem with draft limits

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03472173
Contributor : Marie Zoia Connect in order to contact the contributor
Submitted on : Thursday, December 9, 2021 - 11:07:02 AM
Last modification on : Tuesday, January 4, 2022 - 6:36:48 AM

Identifiers

Collections

Citation

Shahin Gelareh, Bernard Gendron, Said Hanafi, Rahimeh Neamatian Monemi, Raca Todosijević. The selective traveling salesman problem with draft limits. Journal of Heuristics, Springer Verlag, 2020, 26 (3), pp.339-352. ⟨10.1007/s10732-019-09406-z⟩. ⟨hal-03472173⟩

Share

Metrics

Les métriques sont temporairement indisponibles