A lamda-optimal based heuristic for the berth scheduling problem

Transportation Research Part C: Emerging Technologies

Volumn 18, Issue 5, 2010, Pages 794-806

  Golias, Mihalis M ^a,c   Boile, Maria ^b   Theofanis, Sotirios ^c  

^a University of Memphis   (United States)

^b the state University of New Jersey   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Berth scheduling; Container terminal operations; Heuristics; Optimization

Indexed keywords

GENETIC ALGORITHMS; OPTIMIZATION; SCHEDULING;

COMPLEX OPTIMIZATION PROBLEMS; COMPUTATIONAL TIME; CONTAINER TERMINAL OPERATION; DISCRETE SPACES; HEURISTICS; NEAR-OPTIMAL; NUMERICAL EXPERIMENTS; SCHEDULING PROBLEM;

HEURISTIC ALGORITHMS;

COMPUTER SIMULATION; CONTAINER TERMINAL; GENETIC ALGORITHM; HEURISTICS; NUMERICAL MODEL; OPTIMIZATION; PLANNING METHOD; TRANSPORTATION PLANNING;

EID: 77953360763     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2009.07.001     Document Type: Article

References (50)

1. Bierwirth C., Meisel F. A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research 2009, 10.1016/j.ejor.2009.05.031.
2. Boile, M., Theofanis, S., Golias, M.M., 2008. A conceptual approach for the yard-berth operations asset management and resource allocation at container terminals. In: 49th Annual Transportation Research Forum, Texas A&M University, College Station, Texas.
3. Briano, C, Briano, E., Bruzzone, A. G., Revetria, R., 2005. Models for support maritime logistics: a case study for improving terminal planning. 19th European Conference on Modeling and Simulation. June 1st-4th, 2005, Riga, Latvia.
4. Canonaco P., Legato P., Mazza R., Musmanno R. A queuing network model for the management of berth crane operations. Computers and Operations Research 2008, 35(8):2432-2446.
5. Cordeau J.-F., Laporte G., Legato P., Moccia L. Models and tabu search heuristics for the berth-allocation problem. Transportation Science 2005, 39:526-538.
6. Dimopoulos C., Zalzala A.M.S. Investigating the use of genetic programming for a classic one-machine scheduling problem. Advances in Engineering Software 2001, 32:489-498.
7. Dragović B., Park N.-K., Radmilović Z. Ship-berth link performance evaluation: simulation and analytical approaches. Maritime Policy and Management 2006, 33(3):281-299.
8. Golias, M.M., Theofanis, S., Boile, M., 2009a. A bi-level formulation for the berth scheduling problem with variable vessel release dates to reduce port emissions. In: 2009 International Conference on Shipping, Port, Logistics Management, Inha University, Incheon, Korea.
9. Golias, M.M., Boile, M., Theofanis, S., 2009b. An adaptive time window partitioning based algorithm for the discrete and dynamic berth scheduling problem. In: TRB 88th Annual Meeting Compendium of Papers DVD. Paper #09-2668.
10. Golias M.M., Boile M., Theofanis S. Berth scheduling by customer service differentiation: a 3 multi-objective approach. Transportation Research Part E 2009, 10.1016/j.tre.2009.05.006.
11. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine-learning 1989, Addison-Wesley, Reading, MA.
12. Guan Y., Cheung R.K. The berth allocation problem: models and solution methods. OR Spectrum 2004, 26:75-92.
13. Gupta, C.M., Gupta, P.Y., Kumar, A., 1993. Genetic algorithms application in a machine scheduling problem. In: Proceedings of the 1993 ACM Conference on Computer Science, pp. 372-377.
14. Han, M., Ping, L., Sun, J., 2006. The algorithm for berth scheduling problem by the hybrid optimization strategy GASA. In: 9th International Conference on Control, Automation, Robotics and Vision, ICARCV.
15. Hansen P., Oguz C., Mladenovic N. Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research 2008, 131(3):636-649.
16. Hooker, N.J., 1998 Constraint satisfaction methods for generating valid cuts. (accessed 26.11.08). http://citeseer.ist.psu.edu/163317.html.
17. Imai A., Nagaiwa K., Tat C-W. Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 1997, 31:75-94.
18. Imai A., Nishimura E., Papadimitriou S. The dynamic berth allocation problem for a container port. Transportation Research Part B 2001, 35:401-417.
19. Imai A., Nishimura E., Papadimitriou S. Berth allocation with service priority. Transportation Research Part B 2003, 37:437-457.
20. Imai A., Sun X., Nishimura E., Papadimitriou S. Berth allocation in a container port: using continuous location space approach. Transportation Research Part B 2005, 39:199-221.
21. Imai A., Nishimura E., Hattori M., Papadimitriou S. Berth allocation at indented berths for mega-containerships. European Journal of Operations Research 2007, 179(2):579-593.
22. Imai A., Zhang J-T., Nishimura E., Papadimitriou S. The berth allocation problem with service time and delay time objectives. Maritime Economics and Logistics 2007, 9:269-290.
23. Imai A., Nishimura E., Papadimitriou S. Berthing ships at a multi-user container terminal with a limited quay capacity. Transportation Research Part E 2008, 44(1):136-151.
24. Imai A., Chen C.H., Nishimura E., Papadimitriou S. The simultaneous berth and quay crane allocation problem. Transportation Research Part E 2008, 44(5):900-920.
25. Kim K.H., Moon K.C. Berth scheduling by simulated annealing. Transportation Research Part B 2003, 37:541-560.
26. Lai K.K., Shih K. A study of container berth allocation. Journal of Advanced Transportation 1992, 26:45-60.
27. Lee Y., Chen Y-C. An optimization heuristic for the berth scheduling problem. European Journal of Operational Research 2009, 196(2):500-508.
28. Lee, D.-H., Song, L., Wang, H., 2006. Bilevel programming model and solutions of berth allocation and quay crane scheduling. In: TRB 85th Annual Meeting Compendium of Papers CD-ROM. Paper #06-1386.
29. Legato P., Mazza R. Berth Planning and resources optimization at a container terminal via discrete event simulation. European Journal of Operational Research 2001, 133(3).
30. Li C-L, Cai X., Lee C-Y. Scheduling with multiple-job-on-one-processor pattern. IIE Transactions 1998, 30:433-445.
31. Liang C., Huang Y., Yang Y. A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Computers and Industrial Engineering 2009, 56(3):1021-1028.
32. Lin S., Kernigan W. An effective heuristic algorithm for the Traveling-Salesman problem. Operations Research 1973, 21:498-516.
33. Liu C-I., Jula H., Vukadinovic K., Ioannou P. Automated guided vehicle system for two container yard layouts. Transportation Research Part C 2004, 12:349-368.
34. Lokuge P., Alahakoon P. Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents. European Journal of Operational Research 2007, 177(3):1985-2015.
35. Mastrogiannidou, C., Theofanis, S., Ziliaskopoulos, A., Boile, M., 2008. Intraterminal transport problem: System description, literature review, and research recommendations. In: Proceedings of the 87th Annual Meeting of the Transportation Research Board.
36. Meisel F. Seaside Operations Planning in Container Terminals 2009, Physica-Verlag, Berlin, Heidelberg, doi:10.1007/978-3-7908-2191-8.
37. Meisel F., Bierwirth C. Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Research Part E 2009, 45:196-209.
38. Monaco M.F., Samara M. The berth allocation problem: a strong formulation solved by a Lagrangean approach. Transportation Science 2007, 41(2):265-280.
39. Moorthy R., Teo C-P. Berth management in container terminal: the template design problem. OR Spectrum 2006, 28(4):495-518.
40. Nikolaou N.S. Berth planning by evaluation of congestion and cost. Journal of the Waterways and Harbors Division, Proceedings of ASCE 1967, 93:107-132.
41. Nishimura E., Imai A., Papadimitriou S. Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research 2001, 131:282-292.
42. Notteboom T.E. The time factor in liner services. Maritime Economics and Logistics 2006, 8(1):19-39.
43. Park M.Y., Kim H.K.A. Scheduling method for berth and quay cranes. OR Spectrum 2003, 25:1-23.
44. Pinedo M. Scheduling: Theory, Algorithms, and Systems 2008, Prentice Hall.
45. Stahlbock R., Voss S. Operations research at container terminals: a literature update. OR Spectrum 2008, 30:1-52.
46. Steenken D., Voss S., Stahlbock R. Container terminal operation and operations research - a classification and literature review. OR Spectrum 2004, 26:3-49.
47. Taboada, H., 2007. Multi-objective optimization algorithms considering objective preferences and solution clusters. PhD Dissertation. Rutgers University, NJ.
48. Tavakkoli-Moghhaddam R., Taheri F., Bazzazi M., Izadi M., Sassani F. Design of genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Computers and Operations Research 2009, 36(12):3224-3230.
49. Theofanis, S., Boile, M., Golias, M.M., 2009. Container Terminal Berth Planning: Critical Review of Research Approaches and Practical Challenges. In: TRB 88th Annual Meeting Compendium of Papers DVD. Paper #09-3262.
50. Tong, C.J., Lau, H.C., Lim, A., 1999. Ant colony optimization for the ship berthing problem. In: Proceedings of the Asian Comp. Sci. Conf. (ASIAN), pp. 359-370.