Research on solution to complex container loading problem based on genetic algorithm

Author

He, Dy ; Cha, J.Z.

Author_Institution

Inf. Technol. Dept., Bank of China Head Office, Beijing, China

Volume

1

fYear

2002

fDate

2002

Firstpage

78

Abstract

The container-loading problem occurring in on-the-spot freight production is often with several constraints and objectives, i.e., complex container-loading problem. The robustness, parallelism, and a variety of applications in the solution of NP-complete problem of the genetic algorithm demonstrate that the genetic algorithm is an effective approach to solve the complex container-loading problem. In this paper, the genetic algorithm for complex container-loading problem is studied, and the effective coding and decoding methods are given. The numerical solution of example shows that the algorithm is effective.

Keywords

computational complexity; encoding; genetic algorithms; operations research; transportation; NP-complete problem; coding; container-loading problem; decoding; genetic algorithm; optimisation; parallelism; robustness; Containers; Decoding; Genetic algorithms; Heuristic algorithms; Information technology; Loading; NP-complete problem; Production; Robustness; Stability;

fLanguage

English

Publisher

ieee

Conference_Titel

Machine Learning and Cybernetics, 2002. Proceedings. 2002 International Conference on

Print_ISBN

0-7803-7508-4

Type

conf

DOI

10.1109/ICMLC.2002.1176713

Filename

1176713