A Heuristic Algorithm for Berth Planning with a Limited Number of Cranes

descriptionPublicationkeyboard_double_arrow_right Article 28 Feb 2011 English Publisher:Korean Institute of Navigation and Port ResearchJournal:Journal of Korean navigation and port research, volume 35, pages 63-70 (issn: 1598-5725,

Copyright policy )

Authors: Young-Man Park; Kap-Hwan Kim;

doi: 10.5394/kinpr.2011.35.1.63

A Heuristic Algorithm for Berth Planning with a Limited Number of Cranes

- Summary
- Metrics

Abstract

This paper discusses the problem of scheduling berth and container cranes simultaneously in port container terminals. A mixed-integer programming model is formulated by considering various practical constraints. A heuristic algorithm is suggested for solving the mathematical model. A numerical experiment was conducted to test the performance of the suggested heuristic algorithm.

Related Organizations

Pusan National University
Korea (Republic of)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average