Please use this identifier to cite or link to this item:
|Title:||Schedule template design and storage allocation for cyclically visiting feeders in container transshipment hubs|
|Authors:||Lee, D.-H. |
|Citation:||Lee, D.-H., Jin, J., Chen, J. (2012-01-12). Schedule template design and storage allocation for cyclically visiting feeders in container transshipment hubs. Transportation Research Record (2273) : 87-95. ScholarBank@NUS Repository. https://doi.org/10.3141/2273-11|
|Abstract:||This paper studies the management of transshipment flows in a container terminal. Management consists of designing a visiting schedule template for feeder vessels and determining storage locations for transshipment containers. A mixed integer programming formulation is developed; it includes the objective of minimizing both the total distance traveled by transshipment flows between quayside and storage yard and the workload imbalance in time. To solve the problem, an algorithm is devised on the basis of Lagrangian relaxation to find near-optimal solutions within short computational times. Numerical experiments are conducted to assess (a) the effectiveness and efficiency of the algorithm and (b) the benefit from adjusting feeder visiting schedule.|
|Source Title:||Transportation Research Record|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 14, 2019
WEB OF SCIENCETM
checked on Mar 6, 2019
checked on Dec 14, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.