Berth allocation planning in the public berth system by genetic algorithms

被引：265

作者：

Nishimura, E ^{[1
]}

Imai, A ^{[1
]}

Papadimitriou, S ^{[1
]}

机构：

[1] Kobe Univ Mercantile Marine, Dept Transportat & Informat Syst Engn, Higashinada Ku, Kobe, Hyogo 6580022, Japan

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2001年 / 131卷 / 02期

关键词：

transportation; genetic algorithms; facilities planning and design; scheduling; container berth;

D O I：

10.1016/S0377-2217(00)00128-4

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper addresses the problem of determining a dynamic berth assignment to ships in the public berth system. While the public berth system may not be suitable for most container ports in major countries, it is desired for higher cost-effectiveness in Japan's ports. The berth allocation to calling ships is a key factor for efficient public berthing. However. it is not calculated in polynomially-bounded time. To obtain a good solution with considerably small computational effort, we developed a heuristic procedure based on the genetic algorithm. We conducted a large amount of computational experiments which showed that the proposed algorithm is adaptable to real world applications. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：282 / 292

页数：11

共 10 条

[1]

BROWN GG, 1994, NAV RES LOG, V41, P1, DOI 10.1002/1520-6750(199402)41:1<1::AID-NAV3220410102>3.0.CO

[2]

2-L

[3]

Brown GG, 1997, NAV RES LOG, V44, P301, DOI 10.1002/(SICI)1520-6750(199706)44:4<301::AID-NAV2>3.0.CO

[4]

2-A