對於商港而言，在繁忙的港務作業中，公用碼頭的船席分配是一個重要的議題，排程的好壞直接影響著整個港口設施的使用率。因此本論文利用基因演算法來解決船席分配問題，達成讓所有船隻的等待時間能夠最小化。根據船席排程的特性，先為各艘船創建可用的碼頭列表，根據碼頭列表產生以船隻為主的染色體，讓染色體在交配和突變後，不會將船隻被分配到不適當的船席，仍然是一個可行解。另外在突變之後進行碼頭使用率平衡程序，以改善解的收斂速度。實驗結果顯示族群的初始化的改變能大幅度改善初始化的解空間，且突變步驟的修正能幫助全局最佳解搜索，這些改變讓提出的基因演算法在解的收斂及結果能夠優於其他的基因演算法。

For a commercial port, to efficiently schedule the public berths is an important issue. Since a berth schedule would affect the usage of the commercial port, in this thesis, we apply a genetic algorithm to schedule the public berths in order to minimize the total waiting time of vessels. When in the initialization process, we encode the chromosome based on wharf characteristics in order to avoid assigning vessels to inappropriate wharves. After mutation process, we also adjust the usage of wharves to improve the speed of convergence speed. Simulation results show that the proposed algorithm can assign vessels to proper berths as soon as vessels arrive. Compared to the other genetic algorithms, the proposed algorithm obtains better performance in convergence speed and the quality of the solutions.

1. Introduction 1
2. Background Materials and Literature Review 3
2.1 Background Materials 3
2.1.1 Berth Scheduling Problem 3
2.1.2 Kaohsiung Port 4
2.1.3 Genetic Algorithm 6
2.1.4 Taguchi Method 8
2.2 Literature Reviews 10
3. Problem Formulation 16
3.1 Definition of Berth Scheduling Problem 16
3.2 Mathematical Formulation 18
4. The Proposed Algorithm 22
4.1. Vessel List Sorting 23
4.2. Generation of Wharf Matching List 24
4.3. Chromosome Representation 25
4.4. Population Initialization 26
4.5. Selection 28
4.6. Crossover 30
4.7. Mutation 32
4.8. Wharf Usage Adjusting 33
4.9. Survival 34
4.10. Stop Condition 35
5. Simulation Results 37
5.1 Parameter Optimization 37
5.2 Performance Comparison of Different Algorithms 53
5.2.1 104 vessels and 25 wharves 53
5.2.2 200 vessels and 25 wharves 55
5.2.3 198 vessels and 23 wharves 56
6. Conclusion 59
References 60
Appendix 62

[1] Nishimura, E., Imai, A., and Papadimitriou, S. (2001). Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research, Vol. 131, 282-292.
[2] Cheong, C. Y., Lin, C. J., Tan, K. C. and Liu, D. K. (2007). A multi-objective evolutionary algorithm for berth allocation in a container port. In Proceedings of IEEE Congress on Evolutionary Computation, 2007, 927-934.
[3] Gkolias, M. D. (2007) The Discrete and Continuous Berth Allocation Problem Models and Algorithm, Dissertation, Rutgers University.
[4] Boile, M., Golias, M., and Theofanis, S. (2009) Scheduling of Berthing Resources at a Marine Container Terminal via the use of Genetic Algorithms: Current and Future Research. Evolutionary Computation. Wellington Pinheiro dos Santos (Ed.), I-Tech, 61-76.
[5] Holland, J. H. (1992) Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, 2nd ed. Cambridge, MA: MIT Press.
[6] Brownlee, J. (2011) Clever Algorithms: Nature-Inspired Programming Recipes. Lulu, North Carolina.
[7] Lee, H. H. (2000). Taguchi Methods Principles and Practices of Quality Design, Gau Lih, Taiwan.
[8] Lim, A. (1998). The berth planning problem. Operations Research Letters, Vol. 22, 105-110.
[9] Go, K. S. and Lim, A. (2000). Combining various algorithms to solve the ship berthing problem. Proceedings of 12th IEEE International Conference on Tools with Artificial Intelligence, 370-375.
[10] Imai, A., Nishimura, E. and Papadimitriou, S. (2001). The dynamic berth allocation problem for a container port. Transportation Research Part B, Vol. 35, 401-417.
[11] Imai, A., Sun, X., Nishimura, E., and Papadimitriou, S. (2005). Berth allocation in a container terminal: using continuous location space approach. Transportation Research Part B, Vol. 39, 199-221.
[12] Park, K. T. and Kim, K. H. (2002). Berth scheduling for container terminals by using a sub-gradient optimization technique. Journal of the Operational Research Society, Vol. 53, 1054-1062.
[13] Park, Y. M. and Kim, K. H. (2003). A scheduling method for berth and quay cranes. Operations Research Spectrum, Vol. 25, 1-23.
[14] Imai, A., Zhang, J. T., Nishimura, E. and Papadimitriou, S. (2007). The Berth Allocation Problem with Service Time and Delay Time Objectives. Maritime Economics & Logistics, Vol. 9, 269-290.
[15] Guan, Y. and Cheung, R. K. (2004). The berth allocation problem: models and solution methods. Operations Research Spectrum, Vol. 26, 75-92.
[16] Lee, Y. and Chen, C. Y. (2009). An optimization heuristic for the berth scheduling problem. European Journal of Operational Research, Vol. 196, 500-508.
[17] Moorthy, R. and Teo, C. P. (2006). Berth management in container terminal: the template design problem. Operations Research Spectrum, Vol. 28, 495-518.
[18] Brodersen, O. B., Meier, L. and Schumann, M. (2010). Optimizing the Berth Allocation Problem using a Genetic Algorithm and Particle Swarm Optimization. MKWI 2010 – Planung/Scheduling und Konfigurieren/Entwerfen, 2277-2294.
[19] Eiben, A. E. and Smith, J. E. (2003). Introduction to Evolutionary Computing, Springer, New York.