On a merging reduction of the process network synthesis problem
Since the combinatorial version of the process network synthesis (PNS) problem is NP-complete, it is important to establish such methods which render possible the reduction of the size of model. In this work, a new method called merging reduction is introduced which is based on the merging of operat...
Elmentve itt :
| Szerzők: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
1999
|
| Sorozat: | Acta cybernetica
14 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12625 |
| Tartalmi kivonat: | Since the combinatorial version of the process network synthesis (PNS) problem is NP-complete, it is important to establish such methods which render possible the reduction of the size of model. In this work, a new method called merging reduction is introduced which is based on the merging of operating units. The mergeable operating units are determined by an equivalence relation on the set of the operating units, and all of the operating units included in an equivalence class are merged into one new operating unit. This reduction has the following property: an optimal solution of the original problem can be derived from an optimal solution of the reduced problem and conversely. Presentation of this reduction technique is equipped with an empirical analysis on randomly generated problems which shows the measure of the size decrease. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 251-261 |
| ISSN: | 0324-721X |