Constrained layout optimization in satellite cabin using a multiagent genetic algorithm

Authors:
Jing Liu
Affiliations:
Key Lab of Intelligent Perception and Image Understanding of Ministry of Education of China, Xidian University, China
Venue:
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Year:
2012

Citing 7
Cited 0

A multiagent evolutionary algorithm for combinatorial optimization problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An organizational coevolutionary algorithm for classification

IEEE Transactions on Evolutionary Computation
Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning With Arbitrarily Shaped Rectilinear Blocks

IEEE Transactions on Evolutionary Computation
A multiagent genetic algorithm for global numerical optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A multiagent evolutionary algorithm for constraint satisfaction problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An Organizational Evolutionary Algorithm for Numerical Optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Motif difficulty (md): A predictive measure of problem difficulty for evolutionary algorithms using network motifs

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

One application of constrained layout optimization problems (CLOPs) is to lay out the instruments in satellite cabin (CLOPssc), which concerns the two dimensional physical placement of a collection of objects within a satellite cabin. CLOPssc are not only of significant theoretical interest, but also of real practical significance in industrial applications. In this paper, we use a multiagent genetic algorithm with a simple technique of handling constraints to solve CLOPssc. In experiments, the performance of the new algorithm is compared with existing algorithms on three benchmark problems with different complexities. Experimental results show that the new algorithm has a better global searching ability. Especially, it found a currently best solution for the constrained layout problem with 40 objects.