Optimized Module Design for Berth Planning of Logistics Information System Using Tabu Search Algorithm


The KIPS Transactions:PartB , Vol. 11, No. 1, pp. 63-70, Feb. 2004
10.3745/KIPSTB.2004.11.1.63,   PDF Download:

Abstract

Port operation is largely divided into gate operation, yard operation and berth operation. Operation strategy and optimal resource allocation for three parts are important in the productivity of the port operation. Especially the resource allocation planning in berth operation needs optimization, because it is directly connected with the processing time in shipping. Berth planning is not independent on recourse allocation but interrelated with yard stacking area allocation. Therefore, we design the optimized module of berth planning and give priority to interrelationship with yard space allocation, while existing studies design independent resource allocation in berth planning. We suggest constraints by mathematical method, and they are related to yard stacking area allocation with existing constraints. Then we look fot solutions, use tabu search to optimize them, and design optimized the verth planning module. In the performance test of optimized module design of berth planning, we find that the berth planning with yard stacking area allocation takes less processing time than without yard stacking area allocations.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. D. Hui and K. C. Gon, "Optimized Module Design for Berth Planning of Logistics Information System Using Tabu Search Algorithm," The KIPS Transactions:PartB , vol. 11, no. 1, pp. 63-70, 2004. DOI: 10.3745/KIPSTB.2004.11.1.63.

[ACM Style]
Hong Dong Hui and Kim Chang Gon. 2004. Optimized Module Design for Berth Planning of Logistics Information System Using Tabu Search Algorithm. The KIPS Transactions:PartB , 11, 1, (2004), 63-70. DOI: 10.3745/KIPSTB.2004.11.1.63.