Berth scheduling by simulated annealing

被引：299
|
作者：
Kim, KH [1 ]
Moon, KC [1 ]
机构：
[1] Pusan Natl Univ, Dept Ind Engn, Kumjeong Ku, Pusan 609735, South Korea
来源：
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL | 2003年 / 37卷 / 06期
关键词：
berth scheduling; container terminals; mixed-integer-programming; simulated annealing;
D O I：
10.1016/S0191-2615(02)00027-9
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
The objective of the berth-scheduling problem is to determine the berthing times and positions of containerships in port container terminals. Every vessel requires a specific amount of space in a wharf for a predetermined length of time to unload and load containers. In this study, a mixed-integer-linear-programming (MIP) model was formulated for the berth-scheduling problem. The simulated annealing algorithm was applied to the berth-scheduling problem to find near-optimal solutions. Experimental results showed that the simulated annealing algorithm obtains solutions that are similar to the optimal solutions found by the MIP model. (C) 2003 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：541 / 560
页数：20
相关论文
共 50 条
  • [41] Genetic algorithms and simulated annealing for scheduling in agile manufacturing
    Gaafar, LK
    Masoud, SA
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2005, 43 (14) : 3069 - 3085
  • [42] Experiments with scheduling using simulated annealing in a grid environment
    YarKhan, A
    Dongarra, JJ
    GRID COMPUTING - GRID 2002, 2002, 2536 : 232 - 242
  • [43] A quantum genetic simulated annealing algorithm for task scheduling
    Shu, Wanneng
    He, Bingjiao
    ADVANCES IN COMPUTATION AND INTELLIGENCE, PROCEEDINGS, 2007, 4683 : 169 - +
  • [44] SCHEDULING IN A CELLULAR MANUFACTURING SYSTEM - A SIMULATED ANNEALING APPROACH
    SRIDHAR, J
    RAJENDRAN, C
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1993, 31 (12) : 2927 - 2945
  • [45] Simulated Annealing Algorithm for the Quay Crane Scheduling Problem
    Liu, Yan-Na
    Wang, Rui
    Zhang, Xiao-Yu
    Li, Chang-Guo
    Zhong, Min
    Li, Yu-Hao
    PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, : 2307 - 2311
  • [46] Hybridization of Simulated Annealing with Quenching for Job Shop Scheduling
    Akram, Kashif
    Kamal, Khurram
    PROCEEDINGS OF 2015 INTERNATIONAL CONFERENCE ON FLUID POWER AND MECHATRONICS - FPM 2015, 2015, : 825 - 829
  • [47] Solving the Course Scheduling Problem Using Simulated Annealing
    Aycan, E.
    Ayav, T.
    2009 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE, VOLS 1-3, 2009, : 462 - 466
  • [48] Resource scheduling - comparing simulated annealing with constraint programming
    Crabtree, I.B.
    British Telecom technology journal, 1995, 13 (01): : 121 - 127
  • [49] HARVEST SCHEDULING WITH SPATIAL CONSTRAINTS - A SIMULATED ANNEALING APPROACH
    LOCKWOOD, C
    MOORE, T
    CANADIAN JOURNAL OF FOREST RESEARCH-REVUE CANADIENNE DE RECHERCHE FORESTIERE, 1993, 23 (03): : 468 - 478
  • [50] No-wait jobshop scheduling using simulated annealing
    Caux, C
    Rebreyend, P
    Pierreval, H
    CAD/CAM ROBOTICS AND FACTORIES OF THE FUTURE, 1996, : 633 - 639
12345