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 条
  • [21] The selective traveling salesman problem with draft limits
    Gelareh, Shahin
    Gendron, Bernard
    Hanafi, Said
    Neamatian Monemi, Rahimeh
    Todosijevic, Raca
    JOURNAL OF HEURISTICS, 2020, 26 (03) : 339 - 352
  • [22] The selective traveling salesman problem with draft limits
    Shahin Gelareh
    Bernard Gendron
    Saïd Hanafi
    Rahimeh Neamatian Monemi
    Raca Todosijević
    Journal of Heuristics, 2020, 26 : 339 - 352
  • [23] Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
    Mjirda, Anis
    Todosijevic, Raca
    Hanafi, Said
    Hansen, Pierre
    Mladenovic, Nenad
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2017, 24 (03) : 615 - 633
  • [24] BREAKOUT LOCAL SEARCH FOR THE TRAVELLING SALESMAN PROBLEM
    El Krari, Mehdi
    Ahiod, Belaid
    El Benani, Bouazza
    COMPUTING AND INFORMATICS, 2018, 37 (03) : 656 - 672
  • [25] An Improved Harmony Search for Travelling Salesman Problem
    Tseng, Shih-Pang
    2016 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATIONS (ICCC), 2016, : 299 - 302
  • [26] A general variable neighborhood search for the cyclic antibandwidth problem
    Sergio Cavero
    Eduardo G. Pardo
    Abraham Duarte
    Computational Optimization and Applications, 2022, 81 : 657 - 687
  • [27] A general variable neighborhood search for the cyclic antibandwidth problem
    Cavero, Sergio
    Pardo, Eduardo G.
    Duarte, Abraham
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 81 (02) : 657 - 687
  • [28] A General Variable Neighborhood Search Approach for the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule
    Dasari, Kasi Viswanath
    Singh, Alok
    Mallipeddi, Rammohan
    DISTRIBUTED COMPUTING AND INTELLIGENT TECHNOLOGY, ICDCIT 2024, 2024, 14501 : 356 - 370
  • [29] An adaptive variable neighborhood search for the traveling salesman problem with job-times
    Lan, Shaowen
    Lu, Yongliang
    Fan, Wenjuan
    JOURNAL OF HEURISTICS, 2025, 31 (02)
  • [30] The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
    Felipe, Angel
    Teresa Ortuno, M.
    Tirado, Gregorio
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (11) : 2983 - 2993
12345