A genetic algorithm to solve the container´s location allocation problem in rear storage yard

Author

Shuding Kang ; Weimin Wu

Author_Institution

State Key Lab. of Ind. Control Technol., Zhejiang Univ., Hangzhou, China

fYear

2015

fDate

9-11 April 2015

Firstpage

33

Lastpage

38

Abstract

In this paper, a genetic algorithm is designed to solve the container´s location allocation problem (CLAP) in rear storage yard. The CLAP considers the number of reshuffles and the range of all bays, which is a two-objective optimization problem. In the model, we only take 20ft normal containers into account and ignore the weight of containers. The GA designed for CLAP can get the global optimum solution and the population is going to converge, which can provide the solution of the minimum number of reshuffles and the balance between bays.

Keywords

containers; genetic algorithms; sea ports; CLAP; GA; bay range; container location allocation problem; genetic algorithm; global optimum solution; population convergence; rear storage yard; reshuffles; two-objective optimization problem; Containers; Cranes; Genetic algorithms; Resource management; Sociology; Stacking; Statistics; container terminal; genetic alogrithm; location allocation; rear storage yard; reshuffle;

fLanguage

English

Publisher

ieee

Conference_Titel

Networking, Sensing and Control (ICNSC), 2015 IEEE 12th International Conference on

Conference_Location

Taipei

Type

conf

DOI

10.1109/ICNSC.2015.7116006

Filename

7116006