The selective traveling salesman problem with draft limits

Shahin Gelareh, Bernard Gendron (), Saïd Hanafi, Rahimeh Neamatian Monemi and Raca Todosijević
Additional contact information
Shahin Gelareh: Université d’Artois
Bernard Gendron: Université de Montréal
Saïd Hanafi: Université Polytechnique Hauts-de-France
Rahimeh Neamatian Monemi: University of Southampton
Raca Todosijević: Université Polytechnique Hauts-de-France

Journal of Heuristics, 2020, vol. 26, issue 3, No 2, 339-352

Abstract: 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.

Keywords: Selective traveling salesman problem with draft limits; Variable neighborhood search; Location neighborhood structures; Traveling salesman neighborhood structures; Mixed integer linear programming (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10732-019-09406-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:26:y:2020:i:3:d:10.1007_s10732-019-09406-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-019-09406-z

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().