Task Decomposition for Optimization Problem Solving

Autor:	Daryl Essam, Ruhul A. Sarker, Ehab Z. Elfeky
Rok vydání:	2008
Předmět:	Continuous optimization symbols.namesake Mathematical optimization Optimization problem Quadratic assignment problem Lagrangian relaxation symbols Computational problem Metaheuristic Bilevel optimization Mathematics Engineering optimization
Zdroj:	Lecture Notes in Computer Science ISBN: 9783540896937 SEAL
DOI:	10.1007/978-3-540-89694-4_34
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::f2a296cceb7d67f89645e22905c922aa https://doi.org/10.1007/978-3-540-89694-4_34 Zobrazit plný text záznamu