A multi-start local search heuristic for ship scheduling - a computational study

被引：57
|
作者：
Bronmo, Geir [1 ]
Christiansen, Marielle
Fagerholt, Kjetil
Nygreen, Bjorn
机构：
[1] MARINTEK, Trondheim, Norway
[2] Norwegian Univ Sci & Technol, Sect Managerial Econ & Operat Res, N-7034 Trondheim, Norway
[3] Norwegian Univ Sci & Technol, Dept Marine Technol, N-7034 Trondheim, Norway
来源：
COMPUTERS & OPERATIONS RESEARCH | 2007年 / 34卷 / 03期
关键词：
maritime transportation; integer programming; set partitioning; routing;
D O I：
10.1016/j.cor.2005.05.017
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We present a multi-start local search heuristic for a typical ship scheduling problem. A large number of initial solutions are generated by an insertion heuristic with random elements. The best initial solutions are improved by a local search heuristic that is split into a quick and an extended version. The quick local search is used to improve a given number of the best initial solutions. The extended local search heuristic is then used to further improve some of the best solutions found. The multi-start local search heuristic is compared with an optimization-based solution approach with respect to computation time and solution quality. The computational study shows that the multi-start local search method consistently returns optimal or near-optimal solutions to real-life instances of the ship scheduling problem within a reasonable amount of computation time. (c) 2005 Elsevier Ltd. All rights reserved.
引用
下载
收藏
页码：900 / 917
页数：18
相关论文
共 50 条
  • [31] A Multi-start Iterated Local Search Algorithm with Variable Degree of Perturbation for the Covering Salesman Problem
    Venkatesh, Pandiri
    Srivastava, Gaurav
    Singh, Alok
    HARMONY SEARCH AND NATURE INSPIRED OPTIMIZATION ALGORITHMS, 2019, 741 : 279 - 292
  • [32] A multi-start iterated local search algorithm for the uncapacitated single allocation hub location problem
    Guan, Jian
    Lin, Geng
    Feng, Hui-Bin
    APPLIED SOFT COMPUTING, 2018, 73 : 230 - 241
  • [33] Balancing lines with CNC machines: A multi-start ant based heuristic
    Essafi, Mohamed
    Delorme, Xavier
    Dolgui, Alexandre
    CIRP JOURNAL OF MANUFACTURING SCIENCE AND TECHNOLOGY, 2010, 2 (03) : 176 - 182
  • [34] A MULTI-START GLOBAL MINIMIZATION ALGORITHM WITH DYNAMIC SEARCH TRAJECTORIES
    SNYMAN, JA
    FATTI, LP
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1987, 54 (01) : 121 - 141
  • [35] Improving the Performance of Multi-start Search on the Traveling Salesman Problem
    King, Charles R.
    McKenney, Mark
    Tamir, Dan E.
    DEVELOPING CONCEPTS IN APPLIED INTELLIGENCE, 2011, 363 : 77 - 82
  • [36] A Variable Neighborhood Search Heuristic for Tramp Ship Scheduling
    Malliappi, Fotini
    Bennell, Julia A.
    Potts, Chris N.
    COMPUTATIONAL LOGISTICS, 2011, 6971 : 273 - 285
  • [37] An effective multi-start multi-level evolutionary local search for the flexible job-shop problem
    Kemmoe-Tchomte, S.
    Lamy, D.
    Tchernev, N.
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2017, 62 : 80 - 95
  • [38] A heuristic multi-start decomposition approach for optimal design of serial machining lines
    Guschinskaya, O.
    Dolgui, A.
    Guschinsky, N.
    Levin, G.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 189 (03) : 902 - 913
  • [39] Learning-based multi-start iterated local search for the profit maximization set covering problem
    Sun, Wen
    Li, Wenlong
    Hao, Jin-Kao
    Wu, Qinghua
    INFORMATION SCIENCES, 2023, 646
  • [40] A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem
    Juan D. Palacio
    Juan Carlos Rivera
    Annals of Operations Research, 2022, 316 : 979 - 1011
12345