Tai-Lin Chiang

Tai-Lin Chiang


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 April 2019 in Sustainability
Verified
Journal Article
Open access
PDF file
HHHsien-Pin Hsu
Hsien-Pin Hsu
TCTai-Lin Chiang
Tai-Lin Chiang
CWC.N. Wang
C.N. Wang
HFHsin-Pin Fu
Hsin-Pin Fu
CCChien-Chang Chou
Chien-Chang Chou
Container terminals help countries to sustain their economic development. Improving the operational efficiency in a container terminal is important. In past research, genetic algorithms (GAs) have been widely used to cope with seaside operational problems, including the berth allocation problem (BAP) and quay crane assignment problem (QCAP) individually or simultaneously. However, most GA approaches in past studies were dedicated to generate time-invariant QC assignment that does not adjust QCs assigned to a ship. This may underutilize available QC capacity. In this research, three hybrid GAs (HGAs) have been proposed to deal with the dynamic and discrete BAP (DDBAP) and the dynamic QCAP (DQCAP) simultaneously. The three HGAs supports variable QC assignment in which QCs assigned to a ship can be further adjusted. The three HGAs employ the same crossover operator but a different mutation operator and a two-stage procedure is used. In the first stage, these HGAs can generate a BAP solution and a QCAP solution that is time-invariant. The time-invariant QC assignment solution is then further transformed into a variable one in the second stage. Experiments have been conducted to investigate the effects of the three HGA and the results showed that these HGAs outperformed traditional GAs in terms of fitness value. In particular, the HGA3 with Thoros mutation operator had the best performance.

3 November 2019 in Applied Sciences
Verified
Journal Article
Open access
PDF file
HHHsien-Pin Hsu
Hsien-Pin Hsu
TCTai-Lin Chiang
Tai-Lin Chiang
This research deals with the dynamic and continuous berth allocation problem (DCBAP) in which both arrived and incoming ships are considered and a quay is used as a continuous line to accommodate as many ships as possible at one time. The DCBAP is solved by a two-stage procedure. In the first stage a heuristic/metaheuristic is used to generate alternative ship placement sequences while in the second stage a specific heuristic is employed to place ships and resolve overlaps of ships for the development of a feasible solution. Different methods, including FCFS (First Come First Served), SFLA (Shuffled Frog-Leaping Algorithm), and ISFLA (Improved Shuffled Frog-Leaping Algorithm), were employed in the first stage for comparison. The experimental results show that the ISFLA outperforms the others in terms of solution quality, implying that the ISFLA has the potential to deal with the DCBAP in a container terminal.