A hybrid metaheuristic algorithm for scheduling iron ore reclaiming in ports

被引：2

作者：

Jesus, Joao D. F. ^{[1
,2
,3
]}

Souza, Marcone J. F. ^{[1
,2
,4
]}

Cota, Luciano P. ^{[1
,2
]}

机构：

[1] Univ Fed Ouro Preto, Programa Posgrad Instrumentacao Controle & Automac, Ouro Preto, Brazil

[2] Inst Tecnol Vale, Ouro Preto, Brazil

[3] Vale SA, Vitoria, Brazil

[4] Univ Fed Ouro Preto, Dept Computacao, Ouro Preto, Brazil

来源：

ENGINEERING OPTIMIZATION | 2025年 / 57卷 / 04期

关键词：

Scheduling; port planning; reclaimer; GRASP; multi-start;

D O I：

10.1080/0305215X.2024.2340688

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This work deals with a scheduling problem of reclaimers. This problem involves a set of ships to be loaded with predefined stockpiles. These stockpiles are unloaded into ship holds, and each hold must store a predefined product and quantity of iron ore. Stockpiles are stored in storage yards, which have reclaimers to reclaim iron ore from stockpiles and send it to berthed ships. The objective is to schedule the operations of reclaimers to minimize the sum of ships' berthing times. A hybrid algorithm, combining the multi-start, GRASP and variable neighbourhood descent procedures, is proposed to treat instances of any scale of the problem. It was tested in real instances, and its results were compared with the hybrid simulated annealing algorithm from the literature and a fast simulation algorithm that emulates operators' decision-making. The proposed algorithm was the best in all instances, and statistical tests proved its superiority

引用

页码：1006 / 1023

页数：18

共 30 条

[11]

Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness

[12]

Gendreau M., 2019, Handbook of Metaheuristics, V272

[13] Flowshop scheduling problem with parallel semi-lines and final synchronization operation [J].

Guimaraes, Irce F. G. ;

Ouazene, Yassine ;

de Souza, Mauricio C. ;

Yalaoui, Farouk .

COMPUTERS & OPERATIONS RESEARCH, 2019, 108 :121-133

[14]

Hansen P., 2005, VARIABLE NEIGHBORHOO, P211, DOI DOI 10.1007/0-387-28356-08

[15]

Hansen P, 2017, EURO J COMPUT OPTIM, V5, P423, DOI 10.1007/s13675-016-0075-x

[16] Stacker-reclaimer scheduling in a dry bulk terminal [J].

Hu, Dayong ;

Yao, Zhenqiang .

INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2012, 25 (11) :1047-1058

[17] Scheduling reclaimers serving a stock pad at a coal terminal [J].

Kalinowski, Thomas ;

Kapoor, Reena ;

Savelsbergh, Martin W. P. .

JOURNAL OF SCHEDULING, 2017, 20 (01) :85-101

[18] Berth scheduling by simulated annealing [J].

Kim, KH ;

Moon, KC .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (06) :541-560

[19] OPTIMIZATION BY SIMULATED ANNEALING [J].

KIRKPATRICK, S ;

GELATT, CD ;

VECCHI, MP .

SCIENCE, 1983, 220 (4598) :671-680

[20] Short-term berth planning and ship scheduling for a busy seaport with channel restrictions [J].

Liu, Baoli ;

Li, Zhi-Chun ;

Wang, Yadong ;

Sheng, Dian .

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2021, 154

← 1 2 3 →