A Novel Wharf-based Genetic Algorithm for Berth Allocation Planning
Article No.: 46, Pages 1 - 9
Abstract
For a commercial port, efficiently scheduling the vessels to the public berths is an important issue. In order to save communication and awaiting time of vessels, a wharf-based genetic algorithm is proposed to schedule the public berths. In the initialization process, the schedules are encoded as the chromosomes based on wharf characteristics to avoid assigning vessels to inappropriate wharves. After selection, crossover, mutation processes, the proposed wharf-based genetic algorithm adjusts the usage of wharves to increase the convergence speed. Experimental results show that the proposed algorithm can assign vessels to proper berths as soon as vessels arrive. Compared to the other algorithms, the proposed algorithm obtains 9 times faster than the best one of competing methods. Our wharf-based genetic algorithm obtains the best performance in convergence speed and quality of the solutions than all competing methods.
References
[1]
Lim, A. 1998. The berth planning problem. Operations Research Letters, Vol. 22, 105--110.
[2]
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.
[3]
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.
[4]
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.
[5]
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.
[6]
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.
[7]
Park, Y. M., and Kim, K. H. 2003. A scheduling method for berth and quay cranes. Operations Research Spectrum, Vol. 25, 1--23.
[8]
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.
[9]
Gkolias, M. D. 2007. The Discrete and Continuous Berth Allocation Problem Models and Algorithm, Dissertation, Rutgers University.
[10]
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.
[11]
Guan, Y., and Cheung, R. K. 2004. The berth allocation problem: models and solution methods. Operations Research Spectrum, Vol. 26, 75--92.
[12]
Lee, Y., and Chen, C. Y. 2009. An optimization heuristic for the berth scheduling problem. European Journal of Operational Research, Vol. 196, 500--508.
[13]
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.
[14]
Moorthy, R., and Teo, C. P. 2006. Berth management in container terminal: the template design problem. Operations Research Spectrum, Vol. 28, 495--518.
[15]
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.
[16]
Frojan, P., Correcher, J. F., Alvarez-Valdes, R., Koulouris, G., and Tamarit, J. M. 2015. The continuous Berth Allocation Problem in a container terminal with multiple quays. Expert Systems with Applications, Vol. 42, 7356--7366.
[17]
Golias, M., Portal, I., Konur, D., Kaisar, E., and Kolomvos, G. 2014. Robust berth scheduling at marine container terminals via hierarchical optimization. Computers & Operations Research, Vol. 41, 412--422.
[18]
Yan, S., Lu, C. C., Hsieh, J. H., and Lin, H. C. 2015. A network flow model for the dynamic and flexible berth allocation problem. Computers & Industrial Engineering, Vol. 81, 65--77.
[19]
Lee, H. H. 2000. Taguchi Methods Principles and Practices of Quality Design, Gau Lih, Taiwan.
[20]
Eiben, A. E., and Smith, J. E. 2003. Introduction to Evolutionary Computing, Springer, New York.
Index Terms
- A Novel Wharf-based Genetic Algorithm for Berth Allocation Planning
Recommendations
Novel wharf-based genetic algorithm for berth allocation planning
Commercial ports require an efficient means of scheduling vessels for public berths. In this study, a wharf-based genetic algorithm is proposed for the scheduling of public berths with the aim of reducing reliance on communications and shortening the ...
Hybrid Taguchi-genetic algorithm for global numerical optimization
In this paper, a hybrid Taguchi-genetic algorithm (HTGA) is proposed to solve global numerical optimization problems with continuous variables. The HTGA combines the traditional genetic algorithm (TGA), which has a powerful global exploration capability,...
Solving Japanese nonograms by Taguchi-based genetic algorithm
A Taguchi-based genetic algorithm (TBGA) is proposed to solve Japanese nonogram puzzles. The TBGA exploits the power of global exploration inherent in the traditional genetic algorithm (GA) and the abilities of the Taguchi method in efficiently ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
October 2015
381 pages
ISBN:9781450337359
DOI:10.1145/2818869
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 October 2015
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ASE BD&SI '15
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 81Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)1
Reflects downloads up to 19 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in