By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. Y. He ; Inf. Technol. Dept., Bank of China Head Office, Beijing, China ; J. Z. Cha

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.

Published in:

Machine Learning and Cybernetics, 2002. Proceedings. 2002 International Conference on  (Volume:1 )

Date of Conference: