Application of the Invasive Weed Optimization (IWO) algorithm to the multi-objective circular object allocation problem

• Michelle de Oliveira Parreira INPE
• Sherfis Gibran Ruwer INPE
• Sandra Sandri INPE
• José Carlos Becceneri INPE
• Luiz Leduíno Salles Neto UNIFESP

Abstract

Bioinspired optimization algorithms, such as genetic algorithms and particle swarms, have been used to solve the problem of allocation of cylinders in a circular container. When the height of the cylinders is not considered, the problem is reduced to the allocation of circles, each one with a mass value. This article presents an implementation of the algorithm of infestation by weeds to solve this problem. It was used a multi-objective function that seeks to reduce the distance from the center of mass of the set to the axis of rotation of the circular container, in addition to minimize the total space allocated to the circles inside the container. Finally, it is proposed a new method that removes all the imbalance of the set.

References

Akeb, H.; Li Y. (2005) Basic heuristics for packing a great number of equal circles. Working paper No 7, LaRIA, Université de Picardie Jules Verne, Amiens.

Becceneri, J. C. (Org.) and Silva Neto, J. A. (Org.) (2009) Técnicas de Inteligência Computacional Inspiradas na Natureza - Aplicação em Problemas Inversos em Transferência Radiativa. São Carlos: SBMAC, v. 41, p.122.

Fei, T. and Hongfei, T. (1999) A modified genetic algorithm and its application to layout optimization. In: Journal of Software 10(10), p. 1096–1102.

Hajimirsadeghi, H. and Lucas, C. (2009) A hybrid IWO/PSO algorithm for fast and global optimization. In: EUROCON 2009, EUROCON’09. IEEE, p. 1964–1971.

Huang, W. Q., Li Y. ; Li, C. M. and Xu, R. C. (2006) New heuristics for packing unequal circles into circular container. In: Journal Computers and Operations Research. v. 33, Issue 8, p. 2125–2142, August.

Lei, K. (2009) Constrained Layout Optimization Based on Adaptive Particle Swarm Optimizer. Faculty of Computer & Information Science, Southwest University, Chongqing, China. Springer-Verlag Berlin Heidelberg, LNCS 5821, p. 434–442.

Mehabian, A. and Lucas, C. (2006) A novel numerical optimization algorithm inspired from weed colonization. In: Ecological Informatics, v. 1, n. 4, p. 355–366.

Ning, L., Fei, L. and Debao, S. (2004) A study on the particle swarm optimization with mutation operator constrained layout optimization. In: Chinese Journal of Computers, 27(7), p. 8897–9039.

Rad, H. and Lucas, C. (2008) A recommender system based on invasive weed optimization algorithm. In: Evolutionary Computation. CEC 2007. IEEE Congress on, IEEE, p. 4297–4304.

Tellez, F. R. (2010) Otimização multiobjetivo por infestação de ervas daninhas em um grid cooperativo. Monografia (Bacharelado em Ciência da Computação) Universidade Federal de São Paulo, São Paulo.

Teng, H. F., Shoulin, S. and Wenhai, G. (1994) Layout optimization for the dishes installed on rotating table. In: Science in China (Series A) 37(10), p. 1272–1280.

Xiao, R.B., Xu YC and Amos M. (2006)Two hybrid compaction algorithms for the layout optimization problem, School of Management & CAD Center, Huazhong University of Science & Technology, Wuhan, China. In: Biosystems, 90(2), p. 560-7, December.

Zhou, C., Gao, L. and Gao, H. (2005) Particle swarm optimization based algorithm for constrained layout optimization. Contr. Decis. 20(1), p. 36-40.