The strategic berth template problem

Transportation Research Part E: Logistics and Transportation Review

Volumn 72, Issue , 2014, Pages 77-100

  Imai, Akio ^a,b   Yamakawa, Yukiko ^a   Huang, Kuancheng ^c  

^a KOBE UNIVERSITY   (Japan)

^b PORT AND AIRPORT RESEARCH INSTITUTE   (Japan)

^c NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Berth allocation problem; Berth template problem; Container terminal; Heuristics; Lagrangian relaxation; Subgradient optimization

Indexed keywords

OPTIMIZATION; RAILROAD YARDS AND TERMINALS; RESERVATION SYSTEMS; TRANSFER CASES (VEHICLES);

BERTH ALLOCATION PROBLEM; BERTH TEMPLATE PROBLEM; CONTAINER TERMINAL; CONTAINER TERMINAL OPERATORS; HEURISTIC; LAGRANGIAN RELAXATIONS; MARINE CONTAINER TERMINALS; NEW SERVICES; SERVICE CONTRACT; SUB-GRADIENT OPTIMIZATION;

PORT TERMINALS;

CONTAINER TERMINAL; LAGRANGIAN ANALYSIS; OPTIMIZATION; SHIPPING;

EID: 84910046767     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2014.09.013     Document Type: Article

References (47)

1. Bramel J., Simchi-Levi D. The Logic of Logistics 1997, Springer-Verlag, New York.
2. Brucker P., Kampmeyer T. A general model for cyclic machine scheduling problems. Discrete Appl. Math. 2008, 156:2561-2572.
3. Buhrkal K., Zuglian S., Ropke S., Larsen J., Lusby R. Models for the discrete berth allocation problem: a computational comparison. Transp. Res. Part E 2011, 47:461-473.
4. Cheong C.Y., Tan K.C., Liu D.K., Lin C.J. Multi-objective and prioritized berth allocation in container ports. Ann. Oper. Res. 2010, 180:63-103.
5. Cordeau J.-F., Laporte G., Legato P., Moccia L. Models and tabu search heuristics for the berth-allocation problem. Transp. Sci. 2005, 39:526-538.
6. Crama Y., Van de Klundert J. Cyclic scheduling of identical parts in a robotic cell. Oper. Res. 1997, 45:952-965.
7. Crama Y., Kats V., Van de Klundert J., Levner E. Cyclic scheduling in robotic flowshops. Ann. Oper. Res. 2000, 96:97-124.
8. De Oliveira R.M., Mauri G.R., Lorena L.A.N. Clustering search for the berth allocation problem. Expert Syst. Appl. 2012, 39:5499-5505.
9. Giallombardo G., Moccia L., Salani M., Vacca I. Modeling and solving the tactical berth allocation problem. Transp. Res. Part B 2010, 44:232-245.
10. Golias M.M., Boile M., Theofanis S. Berth scheduling by customer service differentiation: a multi-objective approach. Transp. Res. Part E 2009, 45:878-892.
11. Golias M.M., Boile M., Theofanis S. A lamda-optimal based heuristic for the berth scheduling problem. Transp. Res. Part C 2010, 18:794-806.
12. Hall N.G., Kamoun H., Sriskandarajah C. Scheduling in robotic cells: classification, two and three machine cells. Oper. Res. 1997, 45:421-439.
13. Hanen C. Study of a NP-hard cyclic scheduling problem: the recurrent job-shop. Eur. J. Oper. Res. 1994, 72:82-101.
14. Hansen P., Oguz C., Mladenovic N. Variable neighborhood search for minimum cost berth allocation. Eur. J. Oper. Res. 2008, 191:636-649.
15. Hendriks M.P.M., Armbruster D., Laumanns M., Lefeber E., Udding J.T. Strategic allocation of cyclically calling vessels for multi-terminal container operators. Flex. Serv. Manuf. J. 2012, 24:248-273.
16. Hendriks M.P.M., Lefeber E., Udding J.T. Simultaneous berth allocation and yard planning at a tactical level. OR Spectr. 2013, 35:441-456.
17. Imai A., Nagaiwa K., Chan W.T. Efficient planning of berth allocation for container terminals in Asia. J. Adv. Transp. 1997, 31:75-94.
18. Imai A., Nishimura E., Papadimitriou S. The dynamic berth allocation problem for a container port. Transp. Res. Part B 2001, 35:401-417.
19. Imai A., Nishimura E., Papadimitriou S. Berth allocation with service priority. Transp. Res. Part B 2003, 37:437-457.
20. Imai A., Nishimura E., Papadimitriou S. Corrigendum to "The dynamic berth allocation problem for a container port" [Transportation Research Part B 35 (2001) 401-417]. Transp. Res. Part B 2005, 39:197.
21. Imai A., Sun X., Nishimura E., Papadimitriou S. Berth allocation in a container port: using a continuous location space approach. Transp. Res. Part B 2005, 39:199-221.
22. Imai A., Nishimura E., Hattori M., Papadimitriou S. Berth allocation at indented berths for mega-containerships. Eur. J. Oper. Res. 2007, 179:579-593.
23. Imai A., Nishimura E., Papadimitriou S. Berthing ships at a multi-user container terminal with a limited quay capacity. Transp. Res. Part E 2008, 44:136-151.
24. Imai A., Nishimura E., Papadimitriou S. Marine container terminal configurations for efficient handling of mega-containership. Transp. Res. Part E 2013, 49:141-158.
25. JICT, 2014. Jakarta International Container Terminal, Berthing Contract. Available from: <>. http://jict.co.id/?x0=berthing%2Bcontract%26x1=26%26x2=article.
26. Lalla-Ruiz E., Melian-Batista B., Moreno-Vega J.M. Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem. Eng. Appl. Artif. Intell. 2012, 25:1132-1141.
27. Lee D.-H., Jin J.G. Feeder vessel management at container transshipment terminals. Transp. Res. Part E 2013, 49:201-216.
28. Lee T.-E., Posner M.E. Performance measures and schedules in periodic job shops. Oper. Res. 1997, 45:72-91.
29. Lee D.-H., Chen J.H., Cao J.X. The continuous berth allocation problem: a greedy randomized adaptive search solution. Transp. Res. Part E 2010, 46:1017-1029.
30. Li C.-L., Cai X., Lee C.-Y. Scheduling with multiple-job-on-one-processor pattern. IIE Trans. 1998, 30:433-445.
31. Lim A. The berth planning problem. Oper. Res. Lett. 1998, 22:105-110.
32. Matsuo H., Shand J.S., Sullivan R.S. A crane scheduling problem in a computer-integrated manufacturing environment. Manage. Sci. 1991, 37:587-606.
33. Mauri G.R., Oliveira A.C.M., Lorena L.A.N. A hybrid column generation approach for the berth allocation problem. Lect. Notes Comput. Sci. 2008, 4972:110-122.
34. McCormick S.T., Rao U.S. Some complexity results in cyclic scheduling. Math. Comput. Modell. 1994, 20:107-122.
35. Monaco M.F., Sammarra M. The dynamic berth allocation problem: a strong formulation solved by Lagrangean approach. Transp. Sci. 2007, 41:265-280.
36. Mongelluzzo B. Decline of the single-user terminal. J. Commerce 2013, 14:36-38.
37. Moorthy R., Teo C.-P. Berth management in container terminal: the template design problem. OR Spectr. 2006, 28:495-518.
38. Nishimura E., Imai A., Papadimitriou S. Berth allocation planning in the public berth system by genetic algorithms. Eur. J. Oper. Res. 2001, 131:282-292.
39. Norman B.A., Bean J.C. A genetic algorithm methodology for complex scheduling problems. Nav. Res. Logist. 1999, 46:199-211.
40. Park K.T., Kim K.H. Berth scheduling for a container terminals by using a sub-gradient optimization technique. J. Oper. Res. Soc. 2002, 53:1054-1062.
41. Pinedo M. Scheduling: Theory, Algorithms, and Systems 2012, Springer, US, Boston, MA.
42. Roundy R. Cyclic schedules for job-shops with identical jobs. Math. Oper. Res. 1992, 17:842-865.
43. Saharidis G.K.D., Golias M.M., Boile M., Theofanis S., Ierapetritou M.G. The berth scheduling problem with customer differentiation: a new methodological approach based on hierarchical optimization. Int. J. Adv. Manuf. Technol. 2010, 46:377-393.
44. Ting C.-J., Wu K.-C., Chou H. Particle swarm optimization algorithm for the berth allocation problem. Expert Syst. Appl. 2014, 41:1543-1550.
45. Vacca I., Salani M., Bierlaire M. An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transp. Sci. 2013, 47:148-161.
46. Xu D., Li C.-L., Leung J.Y.-T. Berth allocation with time-dependent physical limitations on vessels. Eur. J. Oper. Res. 2012, 216:47-56.
47. Zhen L., Chew E.P., Lee L.H. An integrated model for berth template and yard template planning in transshipment hubs. Transp. Sci. 2011, 45:483-504.