Optimum Allocation and Size of Seaports
Publication: Journal of Waterway, Port, Coastal, and Ocean Engineering
Volume 116, Issue 2
Abstract
The amount of general cargo that is transported through public wharves in a port is not necessarily constant for a certain point of time; it will change depending on the relative location of the port to other ports in a country. In this paper, a method to determine the optimum allocation and size of ports in a country is proposed from a national economic point of view. The total cost spent in transporting general cargo consists of two kinds of costs; i.e., the total inland transportation cost and the total port cost. The former cost is a linear function of the amount of cargo transported; while the latter cost is a nonlinear function and is not easy to treat. Consequently, the total port cost is approximated by a piecewise linear function. Thus, the application of the separable programming technique to this type of allocation problem has proved successful. The optimum berth planning of ports in a country can be executed efficiently and easily with the aid of the procedures herein developed.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Agerschou, H., and Korsgaard, J. (1969). “Systems analysis for port planning.” Dock Harb. Auth., 49, Mar., 411–415.
2.
Chang, W. H., et al. (1975). “Harbour expansion and harbour congestion charges—An application of nonlinear programming.” J. Transport Economics and Policy, 9(3), 209–229.
3.
Cosmetatos, G. P. (1975). “Approximate explicit formulae for the average queueing time in the processes (M/D/r) and (D/M/r).” INFOR, 13(3), 328–331.
4.
Cosmetatos, G. P. (1976). “Some approximate equilibrium results for the multi‐server queue (M/G/r).” Operational Res. Q., 27(3), 615–620.
5.
De Weille, J., and Ray, A. (1974). “The optimum port capacity.” J. Transport Economics and Policy, 8(3), 244–259.
6.
FACOM OS IV MPS/X user's manual‐mathematical programming system . (1984). Fujitsu Limited, Tokyo, Japan (in Japanese).
7.
Hadley, G. (1964). Nonlinear and dynamic programming. Addison‐Wesley Publishing Co., Mass.
8.
Jones, J. H., and Blunden, W. R. (1968). “Ship turn‐around time at the Port of Bangkok.” J. Wtrwy. and Harb. Div., ASCE, 94(2), 135–148.
9.
McMillan, C., Jr (1970). Mathematical programming: An introduction to the design and application of optimal decision machines. John Wiley and Sons, Inc., New York, N.Y.
10.
Mettam, J. D. (1967). “Forecasting delays to ships in port.” Dock Harb. Auth., 47, Apr., 380–382.
11.
Nicolaou, S. N. (1967). “Berth planning by evaluation of congestion and cost.” J. Wtrwy. and Harb. Div., ASCE, 93(4), 107–132.
12.
Noritake, M., and Kimura, S. (1983). “Optimum number and capacity of seaport berths.” J. Wtrwy., Port, Coast, and Oc. Engrg., ASCE, 109(3), 323–339.
13.
Plumlee, C. H. (1966). “Optimum size seaport.” J. Wtrwy. and Harb. Div., ASCE, 92(3), 1–24.
14.
Wanhill, S. R. C. (1974). “Further analysis of optimum size seaport.” J. Wtrwy., Harb. and Coast. Engrg. Div., ASCE, 100(4), 377–383.
Information & Authors
Information
Published In
Journal of Waterway, Port, Coastal, and Ocean Engineering
Volume 116 • Issue 2 • March 1990
Pages: 287 - 299
Copyright
Copyright © 1990 ASCE.
History
Published online: Mar 1, 1990
Published in print: Mar 1990
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.