碩士 / 元智大學 / 工業工程與管理學系 / 100 / Located in Southeast Asia, Taiwan has been an important international transportation hub and center and relies heavily on sea transportation. Reducing the vessel turnaround time is an important issue for improving terminal efficiency thus improving the competitiveness over other Southeastern countries.
This study deals with the discrete berth allocation problem (BAPD), where minimizing the total waiting time and total service time are both considered. Since the problem is NP-hard, we propose a beam search (BS), particle swan optimization (PSO), and a hybrid algorithm BS-PSO in which the solutions obtained by BS are used as initial solutions of PSO. Both instances in the static and dynamic berth allocation problem are tested. The static instances are extracted from the benchmarks of parallel machine scheduling problem, while the dynamic instances are randomly generated by a set of simulated data based on the real data from the Keelung Port.
Taking the advantages of the BS quick achieving near optimal solutions and PSO obtaining lower costs than BS, the BS-PSO is able to provide improved terminal efficiency. The results show that the hybrid BS-PSO obtains the best solution among three algorithms. Compared with first come first served heuristic, BS-PSO can improve results by up to 11.1%. In the future, the research will advance the study using BS-PSO in the continuous berth allocation problem.
| Identifer | oai:union.ndltd.org:TW/100YZU05031033 |
| Creators | Hao Chou, 周昊 |
| Contributors | Ching-JungTing, 丁慶榮 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 118 |
Page generated in 0.013 seconds