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 条
  • [1] A general variable neighborhood search variants for the travelling salesman problem with draft limits
    Raca Todosijević
    Anis Mjirda
    Marko Mladenović
    Saïd Hanafi
    Bernard Gendron
    Optimization Letters, 2017, 11 : 1047 - 1056
  • [2] A General Variable Neighborhood Search for The Travelling Salesman Problem with Draft Limits
    Todosijevic, Raca
    Mjirda, Anis
    Hanafi, Said
    Mladenovic, Nenad
    Gendron, Bernard
    PROCEEDINGS OF 2013 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IEEE-IESM 2013), 2013, : 25 - 28
  • [3] A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
    Mladenovic, Nenad
    Urosevic, Dragan
    Hanafi, Said
    Ilic, Aleksandar
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 220 (01) : 270 - 285
  • [4] An Effective Combination of Genetic Algorithms and the Variable Neighborhood Search for Solving Travelling Salesman Problem
    Pram Dinh Thanh
    Huynh Thi Thanh Binh
    2015 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI), 2015, : 142 - 149
  • [5] General Variable Neighborhood Search for the Quote-Travelling Repairman Problem
    Ha-Bang Ban
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2020, 11 (04) : 696 - 709
  • [6] Variable neighborhood search for the travelling deliveryman problem
    Mladenovic, Nenad
    Urosevic, Dragan
    Hanafi, Said
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2013, 11 (01): : 57 - 73
  • [7] Variable neighborhood search for the travelling deliveryman problem
    Nenad Mladenović
    Dragan Urošević
    Saïd Hanafi
    4OR, 2013, 11 : 57 - 73
  • [8] A general variable neighborhood search algorithm for the k-traveling salesman problem
    Venkatesh, Pandiri
    Srivastava, Gaurav
    Singh, Alok
    8TH INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING & COMMUNICATIONS (ICACC-2018), 2018, 143 : 189 - 196
  • [9] Two level General variable neighborhood search for Attractive traveling salesman problem
    Mladenovic, Nenad
    Todosijevic, Raca
    Urosevic, Dragan
    COMPUTERS & OPERATIONS RESEARCH, 2014, 52 : 341 - 348
  • [10] Variable Neighborhood Search for a Colored Traveling Salesman Problem
    Meng, Xianghu
    Li, Jun
    Dai, Xianzhong
    Dou, Jianping
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2018, 19 (04) : 1018 - 1026
12345