The family of tiling problems comprises combinatorial optimization problems involving a grid and a number of shapes. Appropriate placements of the shapes on the grid are sought such that specific constraints concerning shape overlap and grid coverage are satisfied. The family of tiling problems has
A neural network approach to multiobjective and multilevel programming problems
โ Scribed by Hsu-Shih Shih; Ue-Pyng Wen; S. Lee; Kuen-Ming Lan; Han-Chyi Hsiao
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 781 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
โฆ Synopsis
This study aims at utilizing the dynamic behavior of artificial neural networks (ANNs) to solve multiobjective programming (MOP) and multilevel programming (MLP) problems. The traditional and nontraditional approaches to the MLP are first classified into five categories. Then, based on the approach proposed by Hopfield and Tank [1], the optimization problem is converted into a system of nonlinear differential equations through the use of an energy function and Lagrange multipliers. Finally, the procedure is extended to MOP and MLP problems. To solve the resulting differential equations, a steepest descent search technique is used. This proposed nontraditional algorithm is efficient for solving complex problems, and is especially useful for implementation on a large-scale VLSI, in which the MOP and MLP problems can be solved on a real time basis. To illustrate the approach, several numerical examples are solved and compared.
๐ SIMILAR VOLUMES
An optimization platform with multilevel structure, which is capable of efficiently solving design-optimization problems in aerodynamics, is proposed. The multilevel structure relies on a two-way regular exchange of information between successive search levels. Each level can be associated with a di