Minimizing crane times in pre-marshalling problems

被引：18
|
作者：
Parreno-Torres, Consuelo [1 ]
Alvarez-Valdes, Ramon [1 ]
Ruiz, Ruben [2 ]
Tierney, Kevin [3 ]
机构：
[1] Univ Valencia, Dept Stat & Operat Res, Doctor Moliner 50, Valencia 46100, Spain
[2] Univ Politecn Valencia, Inst Tecnol Informat, Grp Sistemas Optimizac Aplicada, Ciudad Politecn Innovac,Edificio 8G,Acc B, Valencia 46021, Spain
[3] Bielefeld Univ, Decis & Operat Technol Grp, Univ Str 25, D-33615 Bielefeld, Germany
来源：
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2020年 / 137卷
关键词：
Logistics; Container pre-marshalling; Crane time; Maritime transport; Terminal operations; BLOCKS RELOCATION PROBLEM; EXACT ALGORITHM; MODEL;
D O I：
10.1016/j.tre.2020.101917
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
The pre-marshalling problem has been extensively studied in recent years with the aim of minimizing the number of movements needed to rearrange a bay of containers. Time is a more realistic objective for measuring process efficiency, and we show that it does not correlate with the number of movements. As a result, we study the problem of minimizing crane times and develop two exact approaches to solve it: an integer linear model, and a branch and bound algorithm, with new upper and lower bounds, dominance criteria, and a heuristic procedure, to provide optimal solutions for problems of practical size.
引用
收藏
页数：20
相关论文
共 50 条
  • [1] Heuristic algorithms for container pre-marshalling problems
    Huang, Shan-Huen
    Lin, Tsan-Hwan
    COMPUTERS & INDUSTRIAL ENGINEERING, 2012, 62 (01) : 13 - 20
  • [2] A branch and bound approach for large pre-marshalling problems
    Tanaka, Shunji
    Tierney, Kevin
    Parreno-Torres, Consuelo
    Alvarez-Valdes, Ramon
    Ruiz, Ruben
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 278 (01) : 211 - 225
  • [3] Integer programming models for the pre-marshalling problem
    Parreno-Torres, Consuelo
    Alvarez-Valdes, Ramon
    Ruiz, Ruben
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (01) : 142 - 154
  • [4] Solving the pre-marshalling problem to optimality with A* and IDA*
    Kevin Tierney
    Dario Pacino
    Stefan Voß
    Flexible Services and Manufacturing Journal, 2017, 29 : 223 - 259
  • [5] Solving the pre-marshalling problem to optimality with A* and IDA*
    Tierney, Kevin
    Pacino, Dario
    Voss, Stefan
    FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2017, 29 (02) : 223 - 259
  • [6] A new effective unified model for solving the Pre-marshalling and Block Relocation Problems
    da Silva, Marcos de Melo
    Toulouse, Sophie
    Calvo, Roberto Wolfler
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 271 (01) : 40 - 56
  • [7] An optimization model for the container pre-marshalling problem
    Lee, Yusin
    Hsu, Nai-Yun
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (11) : 3295 - 3313
  • [8] Hybrid optimization algorithm for pre-marshalling export containers
    Bian, Z. (bianzhan1990@163.com), 1600, Northeast University (29):
  • [9] A tree search procedure for the container pre-marshalling problem
    Bortfeldt, Andreas
    Forster, Florian
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 217 (03) : 531 - 540
  • [10] Logistics optimisation of slab pre-marshalling problem in steel industry
    Ge, Peixin
    Meng, Ying
    Liu, Jiyin
    Tang, Lixin
    Zhao, Ren
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2020, 58 (13) : 4050 - 4070
12345