The berth allocation problem: models and solution methods

被引：0
|
作者：
Yongpei Guan
Raymond K. Cheung
机构：
[1] George Institute of Technology,School of Industrial and Systems Engineering
[2] The Hong Kong University of Science and Technology,Department of Industrial Engineering and Engineering Management
来源：
OR Spectrum | 2004年 / 26卷
关键词：
Berth allocation; Tree search procedure; Heuristics;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we consider the problem of allocating space at berth for vessels with the objective of minimizing total weighted flow time. Two mathematical formulations are considered where one is used to develop a tree search procedure while the other is used to develop a lower bound that can speed up the tree search procedure. Furthermore, a composite heuristic combining the tree search procedure and pair-wise exchange heuristic is proposed for large size problems. Finally, computational experiments are reported to evaluate the efficiency of the methods.
引用
收藏
页码：75 / 92
页数：17
相关论文
共 50 条
  • [41] The berth allocation problem with stochastic vessel handling times
    Karafa, Jeffery
    Golias, Mihalis M.
    Ivey, Stephanie
    Saharidis, Georgios K. D.
    Leonardos, Nikolaos
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 65 (1-4): : 473 - 484
  • [42] A dynamic discrete berth allocation problem for container terminals
    Gargari, Masoud Moharami
    Niasar, Mohammad Saeid Fallah
    [J]. MARITIME-PORT TECHNOLOGY AND DEVELOPMENT, 2015, : 11 - 18
  • [43] Bird Mating Optimizer for Discrete Berth Allocation Problem
    Arram, Anas
    Ayob, Masri
    Nazri, Mohd Zakree Ahmad
    Abunadi, Ahmad
    [J]. 5TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING AND INFORMATICS 2015, 2015, : 450 - 455
  • [44] Priority control of berth allocation problem in container terminals
    Evrim Ursavas
    [J]. Annals of Operations Research, 2022, 317 : 805 - 824
  • [45] The berth allocation problem with stochastic vessel handling times
    Jeffery Karafa
    Mihalis M. Golias
    Stephanie Ivey
    Georgios K. D. Saharidis
    Nikolaos Leonardos
    [J]. The International Journal of Advanced Manufacturing Technology, 2013, 65 : 473 - 484
  • [46] Solving the dynamic berth allocation problem by simulated annealing
    Lin, Shih-Wei
    Ting, Ching-Jung
    [J]. ENGINEERING OPTIMIZATION, 2014, 46 (03) : 308 - 327
  • [47] The discrete and dynamic berth allocation problem in bulk port
    Lassoued, Rokaya
    Elloumi, Abdelkarim
    [J]. 2019 6TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT 2019), 2019, : 1976 - 1980
  • [48] Minimum cost berth allocation problem in maritime logistics: new mixed integer programming models
    Jos, Bobin Cherian
    Harimanikandan, M.
    Rajendran, Chandrasekharan
    Ziegler, Hans
    [J]. SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2019, 44 (06):
  • [49] A berth allocation planning problem with direct transshipment consideration
    Liang, Chengji
    Hwang, Hark
    Gen, Mitsuo
    [J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (06) : 2207 - 2214
  • [50] Minimum cost berth allocation problem in maritime logistics: new mixed integer programming models
    Bobin Cherian Jos
    M Harimanikandan
    Chandrasekharan Rajendran
    Hans Ziegler
    [J]. Sādhanā, 2019, 44
12345