An algorithm of global optimization for solving layout problems |
| |
| Affiliation: | 1. Process Dynamics and Operations Group, Department of Biochemical and Chemical Engineering, TechnischeUniversität Dortmund, Emil-Figge Str. 70, 44227, Dortmund, Germany;1. School of Economics & Management, South China Normal University, Guangzhou, Guangdong, China;2. Department of Industrial and Systems Engineering, Auburn University, Auburn, AL, USA;1. Universidad de Buenos Aires, Facultad de Agronomía, Departamento de Economía, Desarrollo y Planeamiento Agrícola, Cátedra de Sistemas Agroalimentarios, Av. San Martín 4453 (C1417DSE), Buenos Aires, Argentina;2. IFEVA, Universidad de Buenos Aires, CONICET, Facultad de Agronomía, Av. San Martín 4453 (C1417DSE, Buenos Aires, Argentina;3. Universidad de Buenos Aires, Facultad de Agronomía, Departamento de Producción Vegetal, Cátedra de Cerealicultura, Av. San Martín 4453 (C1417DSE), Buenos Aires, Argentina;4. Universidad de Buenos Aires, Facultad de Agronomía, Departamento de Producción Animal, Cátedra de Producciones Animales Alternativas, Av. San Martín 4453 (C1417DSE), Buenos Aires, Argentina |
| |
| Abstract: | The two-dimensional layout problem is known to be NP-complete, and the current research work is basically in the heuristic way. In this paper, we mainly discuss the methods for solving layout problem about the artificial satellite module by virtue of graph theory and group theory. Also, an algorithm of global optimization is presented first time. The method given here can be extended to solve other type of layout problems. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
