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 条
  • [31] An improved variable neighborhood search for parallel drone scheduling traveling salesman problem
    Lei, Deming
    Chen, Xiang
    APPLIED SOFT COMPUTING, 2022, 127
  • [32] Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
    Carrabs, Francesco
    Cordeau, Jean-Francois
    Laporte, Gilbert
    INFORMS JOURNAL ON COMPUTING, 2007, 19 (04) : 618 - 632
  • [33] Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem
    Burke, EK
    Cowling, PI
    Keuthen, R
    APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2001, 2037 : 203 - 212
  • [34] The traveling salesman problem with pickups, deliveries, and draft limits
    Malaguti, Enrico
    Martello, Silvano
    Santini, Alberto
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2018, 74 : 50 - 58
  • [35] Exact algorithms for the traveling salesman problem with draft limits
    Battarra, Maria
    Pessoa, Artur Alves
    Subramanian, Anand
    Uchoa, Eduardo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 235 (01) : 115 - 128
  • [36] Discrete cuckoo search algorithm for the travelling salesman problem
    Aziz Ouaarab
    Belaïd Ahiod
    Xin-She Yang
    Neural Computing and Applications, 2014, 24 : 1659 - 1669
  • [37] Discrete cuckoo search algorithm for the travelling salesman problem
    Ouaarab, Aziz
    Ahiod, Belaid
    Yang, Xin-She
    NEURAL COMPUTING & APPLICATIONS, 2014, 24 (7-8): : 1659 - 1669
  • [38] Nested general variable neighborhood search for the periodic maintenance problem
    Todosijevic, Raca
    Benmansour, Rachid
    Hanafi, Said
    Mladenovic, Nenad
    Artiba, Abdelhakim
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (02) : 385 - 396
  • [39] General Variable Neighborhood Search for the Order Batching and Sequencing Problem
    Menendez, Borja
    Bustillo, Manuel
    Pardo, Eduardo G.
    Duarte, Abraham
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 263 (01) : 82 - 93
  • [40] Tight lower bounds for the Traveling Salesman Problem with draft limits
    Balma, Ali
    Mrad, Mehdi
    Ladhari, Talel
    COMPUTERS & OPERATIONS RESEARCH, 2023, 154
12345