Schedule template design and storage allocation for cyclically visiting feeders in container transshipment hubs

Transportation Research Record

Volumn , Issue 2273, 2012, Pages 87-95

  Lee, Der Horng ^a   Jin, Jian ^a   Chen, Jiang ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; FEEDING; INTEGER PROGRAMMING;

COMPUTATIONAL TIME; CONTAINER TERMINAL; LAGRANGIAN RELAXATIONS; MIXED INTEGER PROGRAMMING: FORMULATION; NEAR-OPTIMAL SOLUTIONS; NUMERICAL EXPERIMENTS; STORAGE LOCATION; STORAGE YARDS; TEMPLATE DESIGNS; TOTAL DISTANCES;

CONTAINERS;

EID: 84892553496     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2273-11     Document Type: Article

References (16)

1. Review of Maritime Transport, 2008./United Nations Conference on Trade and Development, Geneva, 2008.
2. Giallombardo, G., L. Moccia, M. Salani, and I. Vacca. Modeling and Solving the Tactical Berth Allocation Problem. Transportation Research Part B: Methodological/, Vol. 44, No. 2, 2010, pp. 232-245.
3. Vacca, I., M. Bierlaire, and M. Salani. Optimization at Container Terminals: Status, Trends and Perspectives./TRANSP-OR 071204. Transport and Mobility Laboratory, National Polytechnic School of Lausanne, Lausanne, Switzerland, 2007.
4. Steenken, D., S. Voss, and R. Stahlbock. Container Terminal Operation and Operations Research: A Classification and Literature Review. OR Spectrum/, Vol. 26, No. 1, 2004, pp. 3-49. (Pubitemid 40549578)
5. Stahlbock, R., and S. Voss. Operations Research at Container Terminals: A Literature Update. OR Spectrum/, Vol. 30, No. 1, 2008, pp. 1-52.
6. Ng, W. C., K. L. Mak, and M. K. Li. Yard Planning for Vessel Services with a Cyclical Calling Pattern. Engineering Optimization/, Vol. 42, No. 11, 2010, pp. 1039-1054.
7. Kim, K. H., and H. B. Kim. Segregating Space Allocation Models for Container Inventories in Port Container Terminals. International Journal of Production Economics/, Vol. 59, No. 1-3, 1999, pp. 415-423.
8. Zhang, C., J. Liu, Y. Wan, K. G. Murty, and R. J. Linn. Storage Space Allocation in Container Terminals. Transportation Research Part B: Methodological/, Vol. 37, No. 10, 2003, pp. 883-903. (Pubitemid 37212276)
9. Chen, P., Z. H. Fu, A. Lim, and B. Rodrigues. Port Yard Storage Optimization. IEEE Transactions on Automation Science and Engineering/, Vol. 1, No. 1, 2004, 26-37.
10. Moccia, L., and A. Astorino. The Group Allocation Problem in a Transshipment Container Terminal. Proc., World Conference on Transport Research/, University of California, Berkeley, 2007.
11. Moccia, L., J. F. Cordeau, M. F. Monaco, and M. Sammarra. A Column Generation Heuristic for a Dynamic Generalized Assignment Problem. Computers and Operations Research/, Vol. 36, No. 9, 2009, pp. 2670-2681.
12. Moorthy, R., and C. P. Teo. Berth Management in Container Terminal: The Template Design Problem. OR Spectrum/, Vol. 28, No. 4, 2006, pp. 495-518. (Pubitemid 44386728)
13. Held, M., and R. M. Karp. The Traveling-Salesman Problem and Minimum Spanning Trees. Operations Research/, Vol. 18, No. 6, 1970, pp. 1938-1962.
14. Held, M., and R. M. Karp. The Traveling-Salesman Problem and Minimum Spanning Trees: Part II. Mathematical Programming/, Vol. 1 No. 1, 1971, pp. 6-25.
15. Zhang, C., Y. W. Wan, J. Y. Liu, and R. J. Linn. Dynamic Crane Deployment in Container Storage Yards. Transportation Research Part B: Methodological/, Vol. 36, No. 6, 2002, pp. 537-555. (Pubitemid 34444176)
16. Monaco, M. F., and M. Sammarra. The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach. Transportation Science/, Vol. 41, No. 2, 2007, pp. 265-280.