Task Decomposition for Optimization Problem Solving
This paper examines a new way of dividing computational tasks into smaller interacting components, in order to effectively solve constrained optimization problems. In dividing the tasks, we propose problem decomposition, and the use of GAs as the solution approach. In this paper, we consider problems with block angular structures with or without overlapping variables. We decompose not only the problem but also appropriately the chromosome for different components of the problem. We also design a communication process for exchanging information between the components. The approach can be implemented for solving large scale optimization problems using parallel machines. A number of test problems have been solved to demonstrate the use of the proposed approach. The results are very encouraging.
KeywordsTest Problem Constrain Optimization Problem Computational Task Communication Topology Task Decomposition
Unable to display preview. Download preview PDF.
- 1.Conn, A.R., Gould, N.I.M., Toint, P.L.: Large-scale nonlinear constrained optimization: a current survey. In: Shanno, D.F., Dixon, L., Spedicato, E. (eds.) Algorithms for continuous optimization: the state of the art, vol. 434, pp. 287–332. Kluwer Academic Publishers Group (1994)Google Scholar
- 3.Martin, R.K.: Large Scale Linear and Integer Optimization: A Unified Approach. Springer, Heidelberg (1998)Google Scholar
- 6.Benjamin, W.W., Yixin, C., Andrew, W.: Constrained Global Optimization by Constraint Partitioning and Simulated Annealing. In: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence. IEEE Computer Society, Los Alamitos (2006)Google Scholar
- 15.Elfeky, E.Z., Sarker, R.A., Essam, D.L.: A Simple Ranking and Selection for Constrained Evolutionary Optimization. In: Wang, T.-D., Li, X.-D., Chen, S.-H., Wang, X., Abbass, H.A., Iba, H., Chen, G.-L., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 537–544. Springer, Heidelberg (2006)CrossRefGoogle Scholar