Skip to Main content Skip to Navigation
Conference papers

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 :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03388331
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Wednesday, October 20, 2021 - 1:16:32 PM
Last modification on : Wednesday, November 3, 2021 - 4:43:28 AM

Identifiers

  • HAL Id : hal-03388331, version 1

Collections

Citation

Raca Todosijević, Shahin Gelareh, Said Hanafi. The Selective Traveling Salesman Problem with Draft Limits. ROADEF 2016, 17ème conférence de la Société française de Recherche Opérationnelle et d’Aide à la Décision, Feb 2016, Compiègne, France. ⟨hal-03388331⟩

Share

Metrics

Record views

13