A memetic algorithm for the quadratic multiple container packing problem

Authors:
Sang-Moon Soak;Sang-Wook Lee
Affiliations:
Information Examination Team, Korean Intellectual Property Office, Dunsandong, Seo-gu, Daejeon, Republic of Korea 920;Dept. of Information and Communication, Mokwon University, Seo-gu, Daejeon, Republic of Korea 302-318
Venue:
Applied Intelligence
Year:
2012

Citing 18
Cited 3

A Connectionist Approach for Solving Large ConstraintSatisfaction Problems

Applied Intelligence
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
Network random keys: a tree representation scheme for genetic and evolutionary algorithms

Evolutionary Computation
Evolution Strategies, Network Random Keys, and the One-Max Tree Problem

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Genetic Algorithms for the Multiple Container Packing Problem

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Lamarckian Evolution, The Baldwin Effect and Function Optimization

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
3-D Container Packing Heuristics

Applied Intelligence
A hybrid heuristic for the maximum clique problem

Journal of Heuristics
The quadratic multiple knapsack problem and three heuristic approaches to it

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Adding learning to the cellular development of neural networks: Evolution and the baldwin effect

Evolutionary Computation
Statistical properties analysis of real world tournament selection in genetic algorithms

Applied Intelligence
'Adaptive Link Adjustment' Applied to the Fixed Charge Transportation Problem

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A new grouping genetic algorithm for the quadratic multiple knapsack problem

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
A genetic algorithm for the quadratic multiple knapsack problem

BVAI'07 Proceedings of the 2nd international conference on Advances in brain, vision and artificial intelligence
Multi-population co-genetic algorithm with double chain-like agents structure for parallel global numerical optimization

Applied Intelligence
Optimal sampling for estimation with constrained resources using a learning automaton-based solution for the nonlinear fractional knapsack problem

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

Applied Intelligence
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

Block-matching algorithm based on harmony search optimization for motion estimation

Applied Intelligence
Generalized quadratic multiple knapsack problem and two solution approaches

Computers and Operations Research
A memetic algorithm for the capacitated m-ring-star problem

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new memetic algorithm for the quadratic multiple container packing problem. The proposed memetic algorithm is based on the adaptive link adjustment evolutionary algorithm (ALA-EA) and it incorporates heuristic fitness improvement schemes into the ALA-EA. In addition, we propose a new powerful initialization method for the QMCPP.The proposed algorithm is compared to the previous approaches. We report that it can find much improved final solutions at most benchmark instances. Moreover, even the best solutions of the first generation show better than the previous known best solutions at most of instances especially with density d=0.75.In addition, we compare the proposed memetic algorithm to the NetKey based evolutionary algorithm for analyzing features of the ALA-EA.