Solving the dynamic berth allocation problem by simulated annealing

Engineering Optimization

Volumn 46, Issue 3, 2014, Pages 308-327

  Lin, Shih Wei ^a   Ting, Ching Jung ^b  

^a CHANG GUNG UNIVERSITY   (Taiwan)

^b YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

Berth allocation problem; Container port; Simulated annealing

Indexed keywords

BERTH ALLOCATION; BERTH ALLOCATION PROBLEM; CONTAINER PORTS; DIFFERENT SIZES; DYNAMIC BERTH ALLOCATION; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; PORT OPERATIONS;

PORTS AND HARBORS; SHIPS; SIMULATED ANNEALING;

TRANSFER CASES (VEHICLES);

EID: 84897834150     PISSN: 0305215X     EISSN: 10290273     Source Type: Journal    
DOI: 10.1080/0305215X.2013.768241     Document Type: Article

References (50)

1. Barros, V. H., T. S. Costa, A. C. M. Oliveira, and L. A. N. Lorena. 2011. "Model and Heuristic for Berth Allocation in Tidal Bulk Ports with Stock Level Constraints." Computers and Industrial Engineering 60 (4): 606-613.
2. Bierwirth, C., and F. Meisel. 2010. "A Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals." European Journal of Operational Research 202 (3): 615-627.
3. Brown, G. G., K. J. Cormican, S. Lawphongpanich, and D. B. Widdis. 1997. "Optimizing Submarine Berthing with a Persistence Incentive." Naval Research Logistics 44 (4): 301-318.
4. Brown, G. G., S. Lawphongpanich, and K. P. Thurman. 1994. "Optimizing Ship Berthing." Naval Research Logistics 41 (1): 1-15.
5. Buhrkal, K., S. Zuglian, S. Ropke, J. Larsen, and R. Lusby. 2011. "Models for the Discrete Berth Allocation Problem: A Computational Comparison." Transportation Research Part E 47 (4): 461-473.
6. Cordeau, J. F., G. Laporte, P. Legato, and L. Moccia. 2005. "Models and Tabu Search Heuristics for the Berth-Allocation Problem." Transportation Science 39 (4): 526-538.
7. Dai, J., W. Lin, R. Moorthy, and C. P. Teo. 2008. "Berth Allocation Planning Optimization in Container Terminals." In Supply Chain Analysis: A Handbook on the Interaction of Information, System and Optimization, edited by C. S. Tang, C. P. Teo, and K. K.Wei, 69-104. NewYork: Springer.
8. Giallombardo, G., L. Moccia, M. Salani, and I. Vacca. 2010. "Modeling and Solving the Tactical Berth Allocation Problem." Transportation Research Part B 44 (1): 232-245.
9. Guan,Y., and R. K. Cheung. 2004. "The Berth Allocation Problem: Models and Solution Methods." OR Spectrum 26 (1): 75-92.
10. Guan,Y.,W. Q. Xiao, R. K. Cheung, and C. L. Li. 2002. "A Multiprocessor Task Scheduling Model for Berth Allocation: Heuristic andWorst-Case Analysis." Operations Research Letters 30 (5): 343-350.
11. Hansen, P., C. Oguz, and N. Mladenovic. 2008. "Variable Neighborhood Search for Minimum Cost Berth Allocation." European Journal of Operational Research 191 (3): 636-649.
12. Imai, A., K. Nagaiwa, and W. T. Chan. 1997. "Efficient Planning of Berth Allocation for Container Terminals in Asia." Journal of Advanced Transportation 31 (1): 75-94.
13. Imai, A., E. Nishimura, M. Hattori, and S. Papadimitriou. 2007a. "Berth Allocation at Indented Berths for Mega-Containerships." European Journal of Operational Research 179 (2): 579-593.
14. Imai, A., E. Nishimura, and S. Papadimitriou. 2001. "The Dynamic Berth Allocation Problem for a Container Port." Transportation Research Part B 35 (4): 401-417.
15. Imai, A., E. Nishimura, and S. Papadimitriou. 2003. "Berth Allocation with Service Priority." Transportation Research Part B 37 (5): 437-457.
16. Imai, A., E. Nishimura, and S. Papadimitriou. 2008. "Berthing Ships at a Multi-User Container Terminal with a Limited Quay Capacity." Transportation Research Part E 44 (1): 136-151.
17. Imai, A., X. Sun, E. Nishimura, and S. Papadimitriou. 2005. "Berth Allocation in a Container Port: Using a Continuous Location Space Approach." Transportation Research Part B 39 (3): 199-221.
18. Imai, A., J. T. Zhang, E. Nishimura, and S. Papadimitriou. 2007b. "The Berth Allocation Problem with Service Time and Delay Time Objectives." Maritime Economics and Logistics 9 (4): 269-290.
19. Kim, K. H., and K. C. Moon. 2003. "Berth Scheduling by Simulated Annealing." Transportation Research Part B 37 (6): 541-560.
20. Kirkpatrick, S., C. D. Gelatt, and M. P. Vecch. 1983. "Optimization by Simulated Annealing." Science 220 (4598): 671-680.
21. Lai, K. K., and K. Shih. 1992. "A Study of Container Berth Allocation." Journal of Advanced Transportation 26 (1): 45-60.
22. Lalla-Ruiz, E., B. Melian-Batista, and J. Marcos Moreno-Vega. 2012. "Artificial Intelligence Hybrid Heuristic Based on Tabu Search for the Dynamic Berth Allocation Problem." Engineering Applications of Artificial Intelligence 25 (6): 1132-1141.
23. Lee, Y., and C. Y. Chen. 2009. "An Optimization Heuristic for the Berth Scheduling Problem." European Journal of Operational Research 196 (2): 500-508.
24. Lee, D. H., J. H. Chen, and J. X. Cao. 2010. "The Continuous Berth Allocation Problem:A Greedy Randomized Adaptive Search Solution." Transportation Research Part E 46 (6): 101-1029.
25. Lee, D. H., and H. Q. Wang. 2010. "Integrated Discrete Berth Allocation and Quay Crane Scheduling in Port Container Terminals." Engineering Optimization 42 (8): 747-761.
26. Li, C. L., X. Cai, and C.Y. Lee. 1998. "Scheduling with Multiple-Job-on-One-Processor Pattern." IIE Transactions 30 (5): 433-445.
27. Lim, A. 1998. "The Berth Planning Problem." Operations Research Letters 22 (2-3): 105-110.
28. Marti, R. 2003. "Multi-Start Methods." In Handbook of Metaheuristics, International Series in Operations Research & Management Sciences, edited by F. Glover and G. A. Kochenberger, 57, 355-368. Dordrecht: Kluwer.
29. Mauri, G. R., L. N. Andrade, and L. A. N. Lorena. 2011. "A Memetic Algorithm for a Continuous Case of the Berth Allocation Problem." In ECTA 2011 -International Conference on Evolutionary Computation Theory and Applications, Pairs, France, October 24-26, 2011, 105-113. Oxford: SciTePress.
30. Mauri, G. R., A. C. M. Oliveira, and L. A. N. Lorena. 2008. "A Hybrid Column Generation Approach for the Berth Allocation Problem." Lecture Notes in Computer Science 4972: 110-122.
31. Metropolis, N., A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. 1953. "Equation of State Calculations by Fast Computing Machines." Journal of Chemical Physics 21 (6): 1087-1090.
32. Monaco, M. F., and M. Sammarra. 2007. "The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangian Approach." Transportation Science 41 (2): 265-280.
33. Moorthy, R., and C. P. Teo. 2006. "Berth Management in Container Terminal: The Template Design Problem." OR Spectrum 28 (4): 495-518.
34. Nishimura, E., A. Imai, and S. Papadimitriou. 2001. "Berth Allocation Planning in the Public Berth System by Genetic Algorithms." European Journal of Operational Research 131 (2): 282-292.
35. de Oliveira, R. M., G. R. Mauri, and L. A. N. Lorena. 2012a. "Clustering Search Heuristics for Solving a Continuous Berth Allocation Problem." Lecture Notes in Computer Science 7245: 49-62.
36. de Oliveira, R. M., G. R. Mauri, and L. A. N. Lorena. 2012b. "Clustering Search for the Berth Allocation Problem." Expert Systems with Applications 39 (5): 5499-5505.
37. Park, K. T., and K. H. Kim. 2002. "Berth Scheduling for Container Terminals by Using a Subgradient Optimization Technique." Journal of the Operational Research Society 53 (9): 1054-1062.
38. Park,Y. M., and K. H. Kim. 2003. "A Scheduling Method for Berth and Quay Cranes." OR Spectrum 25 (1): 1-23.
39. Stahlbock, R., and S.Vo. 2008. "Operations Research at Container Terminals:A Literature Update." OR Spectrum 30 (1): 1-52.
40. Steenken, D., S. Vo, and R. Stahlbock. 2004. "Container Terminal Operation and Operations Research a Classification and Literature Review." OR Spectrum 26 (1): 3-49.
41. Seyedalizadeh Ganji, S. R., A. Babazadeh, and N. Arabshahi. 2010. "Analysis of the Continuous Berth Allocation Problem in Container Ports Using a Genetic Algorithm." Journal of Marine Science and Technology 15 (4): 408-416.
42. Tang, L., S. Li, and J. Liu. 2009. "Dynamically Scheduling Ships to Multiple Continuous Berth Spaces in an Iron and Steel Complex." International Transactions in Operational Research 16 (1): 87-107.
43. Theofanis, S., M. Boile, and M. M. Golias. 2009. "Container Terminal Berth Planning: Critical Review of Research Approaches and Practical Challenges." Transportation Research Record: Journal of the Transportation Research Board 2100: 22-28.
44. Tiwari, M. K., S.Kumar, S.Kumar, Prakash, and R. Shankar. 2006. "Solving Part-Type and Operation Allocation Problems in an FMS: An Approach Using Constraints-Based Fast Simulated Annealing Algorithm." IEEE Transactions on System Man and Cybernetics, Part A: Systems and Human 36 (6): 1170-1184.
45. Tong, C. J., H. C. Lau, and A. Lim. 1999. "Ant Colony Optimization for the Ship Berthing Problem." Lecture Notes in Computer Science 1742: 359-370.
46. UNCTAD. 2011. Review of Maritime Transportation. United Nations Conference on Trade and Development. Geneva: United Nations.
47. Wang, F., and A. Lim. 2007. "A Stochastic Beam Search for the Berth Allocation Problem." Decision Support Systems 42 (4): 2186-2196.
48. Zeng, Q., Z. Yang, and X. Hu. 2011. "Disruption Recovery Model for Berth and Quay Crane Scheduling in Container Terminals." Engineering Optimization 43 (9): 967-983.
49. Zhen, L., E. P. Chew, and L. H. Lee. 2011a. "An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs." Transportation Science 45 (4): 483-504.
50. Zhen, L., L. H. Lee, and E. P. Chew. 2011b. "A Decision Model for Berth Allocation Under Uncertainty." European Journal of Operational Research 212 (1): 54-68.