The berth allocation problem with service time and delay time objectives

被引：0
|
作者：
Imai A. [1 ,2 ]
Zhang J.-T. [1 ]
Nishimura E. [1 ]
Papadimitriou S. [3 ]
机构：
[1] Graduate School of Maritime Sciences, Kobe University, Fukae, Higashinada
[2] World Maritime University, S-201 24 Malmo
[3] Department of Maritime Studies, University of Piraeus, GR185 32 Piraeus
来源：
Maritime Economics & Logistics | 2007年 / 9卷 / 4期
基金：
日本学术振兴会;
关键词：
Berth allocation; Container transportation; Heuristic; Multi-objective mathematical programming; Terminal management;
D O I：
10.1057/palgrave.mel.9100186
中图分类号：
学科分类号：
摘要：
This study addresses a two-objective berth allocation problem: ship service quality expressed by the minimisation of delay in ships' departure and berth utilisation expressed by the minimisation of the total service time. In this problem, noninferior solutions are expected to be identified. Two heuristics, which are implemented based on two existing procedures of the subgradient optimisation and genetic algorithm, are proposed for solving this problem. Through numerical experiments, it was found that in most cases the genetic algorithm outperformed the subgradient optimisation. Also the tight time window yielded noninferior solutions. © 2007 Palgrave Macmillan Ltd All rights reserved.
引用
收藏
页码：269 / 290
页数：21
相关论文
共 50 条
  • [1] The berth allocation problem: Optimizing vessel arrival time
    Mihalis M Golias
    Georgios K Saharidis
    Maria Boile
    Sotirios Theofanis
    Marianthi G Ierapetritou
    [J]. Maritime Economics & Logistics, 2009, 11 : 358 - 377
  • [2] The berth allocation problem: Optimizing vessel arrival time
    Golias, Mihalis M.
    Saharidis, Georgios K.
    Boile, Maria
    Theofanis, Sotirios
    Ierapetritou, Marianthi G.
    [J]. MARITIME ECONOMICS & LOGISTICS, 2009, 11 (04) : 358 - 377
  • [3] Model and Algorithm for the Berth Allocation Problem with Time Windows
    Qin Jin
    Miao Li-xin
    Shi Feng
    Chen Chang-bin
    [J]. CCDC 2009: 21ST CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, PROCEEDINGS, 2009, : 4947 - +
  • [4] Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic
    Lin, Shih-Wei
    Ying, Kuo-Ching
    Wan, Shu-Yen
    [J]. SCIENTIFIC WORLD JOURNAL, 2014,
  • [5] ON THE BERTH ALLOCATION PROBLEM
    Alzaabi, Shaikha Ahmed Jumaa
    Diabat, Ali
    [J]. RAIRO-OPERATIONS RESEARCH, 2016, 50 (03) : 491 - 501
  • [6] An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time
    Xiang, Xi
    Liu, Changchun
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 103
  • [7] The tactical berth allocation problem with time-variant specific quay crane assignments
    Thanos, Emmanouil
    Toffolo, Tulio
    Santos, Haroldo Gambini
    Vancroonenburg, Wim
    Vanden Berghe, Greet
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 155
  • [8] Quality of service objectives for vehicle routing problem with time windows
    Exposito, Airam
    Brito, Julio
    Moreno, Jose A.
    Exposito-Izquierdo, Christopher
    [J]. APPLIED SOFT COMPUTING, 2019, 84
  • [9] Tramp Ship Scheduling Problem with Berth Allocation Considerations and Time-Dependent Constraints
    Lopez-Ramos, Francisco
    Guarnaschelli, Armando
    Camacho-Vallejo, Jose-Fernando
    Hervert-Escobar, Laura
    Gonzalez-Ramirez, Rosa G.
    [J]. ADVANCES IN COMPUTATIONAL INTELLIGENCE, MICAI 2016, PT I, 2017, 10061 : 346 - 361
  • [10] Berth allocation with service priority
    Imai, A
    Nishimura, E
    Papadimitriou, S
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (05) : 437 - 457
12345