OAK

The improved adaptive link adjustment evolutionary algorithm for the multiple container packing problem

Metadata Downloads
Abstract
In this paper, we propose a new version of Adaptive Link Adjustment Evolutionary Algorithm (ALA-EA) for the network optimization problems, and apply it to the multiple container packing problem (MCPP). Because the proposed algorithm uses a different encoding method from that of the original ALA-EA, we also need different decoding methods for the new algorithm. In addition, to improve the performance of the proposed algorithm, we incorporate heuristic local improvement approaches into it. To verify the effectiveness of the proposed algorithm we compare it with the existing evolutionary approaches for several instances, which are known to be extremely difficult to them. Computational tests show that the algorithm is superior to the existing evolutionary approaches and the original ALA-EA in both of the solution quality and the computational time. Moreover, the performance seems to be not affected by an instance property.
Author(s)
Soak, Sang-MoonLee, Sang-WookJeon, Moongu
Issued Date
2010-10
Type
Article
DOI
10.1007/s10489-008-0155-6
URI
https://scholar.gist.ac.kr/handle/local/16589
Publisher
Springer
Citation
Applied Intelligence, v.33, no.2, pp.144 - 158
ISSN
0924-669X
Appears in Collections:
Department of Electrical Engineering and Computer Science > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.