A general variable neighborhood search variants for the travelling salesman problem with draft limits

被引：23
|
作者：
Todosijevic, Raca [1 ]
Mjirda, Anis [1 ]
Mladenovic, Marko [1 ]
Hanafi, Said [1 ]
Gendron, Bernard [2 ]
机构：
[1] LAMIH UVHC, Le Mt Houy Valenciennes 9, France
[2] Univ Montreal, CIRRELT, Montreal, PQ, Canada
来源：
OPTIMIZATION LETTERS | 2017年 / 11卷 / 06期
关键词：
Maritime transportation; Traveling salesman problem with draft limits; Sequential variable neighborhood descent; General variable neighborhood search;
D O I：
10.1007/s11590-014-0788-9
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we present two general variable neighborhood search (GVNS) based variants for solving the traveling salesman problem with draft limits (TSPDL), a recent extension of the traveling salesman problem. TSPDL arises in the context of maritime transportation. It consists of finding optimal Hamiltonian tour for a given ship which has to visit and deliver products to a set of ports while respecting the draft limit constraints. The proposed methods combine ideas in sequential variable neighborhood descent within GVNS. They are tested on a set of benchmarks from the literature as well as on a new one generated by us. Computational experiments show remarkable efficiency and effectiveness of our new approach. Moreover, new set of benchmarks instances is generated.
引用
收藏
页码：1047 / 1056
页数：10
相关论文
共 50 条
  • [41] Precedence-Constrained Colored Traveling Salesman Problem: An Augmented Variable Neighborhood Search Approach
    Xu, Xiangping
    Li, Jun
    Zhou, Mengchu
    Yu, Xinghuo
    IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (09) : 9797 - 9808
  • [42] A Steiner Zone Variable Neighborhood Search Heuristic for the Close-Enough Traveling Salesman Problem
    Wang, Xingyin
    Golden, Bruce
    Wasil, Edward
    COMPUTERS & OPERATIONS RESEARCH, 2019, 101 : 200 - 219
  • [43] Random-key cuckoo search for the travelling salesman problem
    Ouaarab, Aziz
    Ahiod, Belaid
    Yang, Xin-She
    SOFT COMPUTING, 2015, 19 (04) : 1099 - 1106
  • [44] An effective hybrid harmony search for the asymmetric travelling salesman problem
    Boryczka, Urszula
    Szwarc, Krzysztof
    ENGINEERING OPTIMIZATION, 2020, 52 (02) : 218 - 234
  • [45] Discrete symbiotic organisms search algorithm for travelling salesman problem
    Ezugwu, Absalom El-Shamir
    Adewumi, Aderemi Oluyinka
    EXPERT SYSTEMS WITH APPLICATIONS, 2017, 87 : 70 - 78
  • [46] Tabu search heuristic for the undirected selective travelling salesman problem
    Universite de Montreal, Montreal, Canada
    Eur J Oper Res, 2-3 (539-545):
  • [47] A Multi-Start Granular Skewed Variable Neighborhood Tabu Search for the Roaming Salesman Problem
    Shahmanzari, Masoud
    Aksen, Deniz
    APPLIED SOFT COMPUTING, 2021, 102
  • [48] A tabu search heuristic for the undirected selective travelling salesman problem
    Gendreau, M
    Laporte, G
    Semet, F
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (2-3) : 539 - 545
  • [49] DISCRETE HEAT TRANSFER SEARCH FOR SOLVING TRAVELLING SALESMAN PROBLEM
    Savsani, Poonam
    Tawhid, Mohamed A.
    MATHEMATICAL FOUNDATIONS OF COMPUTING, 2018, 1 (03): : 265 - 280
  • [50] A general variable neighborhood search approach for the minimum load coloring problem
    Alberto Herrán
    J. Manuel Colmenar
    Nenad Mladenović
    Abraham Duarte
    Optimization Letters, 2023, 17 : 2065 - 2086
12345