The selective traveling salesman problem with draft limits
The selective traveling salesman problem with draft limits
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.
Location neighborhood structures, Mixed integer linear programming, Selective traveling salesman problem with draft limits, Traveling salesman neighborhood structures, Variable neighborhood search
Gelareh, Shahin
a21719bb-d942-4838-9945-533034bfac77
Gendron, Bernard
005abd8f-5fef-4e59-a898-1c18e947fa91
Hanafi, Saïd
ad6007b6-a473-4955-a6e1-2cb85a1f05f5
Neamatian Monemi, Rahimeh
b18838f0-854b-4c2c-9100-c50c531e5666
Todosijević, Raca
e52aa1b2-fbe8-4755-8adb-3df60b814c7e
Gelareh, Shahin
a21719bb-d942-4838-9945-533034bfac77
Gendron, Bernard
005abd8f-5fef-4e59-a898-1c18e947fa91
Hanafi, Saïd
ad6007b6-a473-4955-a6e1-2cb85a1f05f5
Neamatian Monemi, Rahimeh
b18838f0-854b-4c2c-9100-c50c531e5666
Todosijević, Raca
e52aa1b2-fbe8-4755-8adb-3df60b814c7e
Gelareh, Shahin, Gendron, Bernard, Hanafi, Saïd, Neamatian Monemi, Rahimeh and Todosijević, Raca
(2019)
The selective traveling salesman problem with draft limits.
Journal of Heuristics.
(doi:10.1007/s10732-019-09406-z).
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.
This record has no associated files available for download.
More information
Accepted/In Press date: 21 January 2019
e-pub ahead of print date: 29 January 2019
Keywords:
Location neighborhood structures, Mixed integer linear programming, Selective traveling salesman problem with draft limits, Traveling salesman neighborhood structures, Variable neighborhood search
Identifiers
Local EPrints ID: 430391
URI: http://eprints.soton.ac.uk/id/eprint/430391
ISSN: 1381-1231
PURE UUID: 886f45a9-e38a-41a9-af52-3633e2871015
Catalogue record
Date deposited: 26 Apr 2019 16:30
Last modified: 16 Mar 2024 00:23
Export record
Altmetrics
Contributors
Author:
Shahin Gelareh
Author:
Bernard Gendron
Author:
Saïd Hanafi
Author:
Rahimeh Neamatian Monemi
Author:
Raca Todosijević
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics