Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/117064
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Matelli, Jose Alexandre | - |
dc.contributor.author | Silva, Jonny C. | - |
dc.contributor.author | Bazzo, Edson | - |
dc.date.accessioned | 2015-03-18T15:55:03Z | - |
dc.date.accessioned | 2016-10-25T20:32:42Z | - |
dc.date.available | 2015-03-18T15:55:03Z | - |
dc.date.available | 2016-10-25T20:32:42Z | - |
dc.date.issued | 2014-01-01 | - |
dc.identifier | http://dx.doi.org/10.1108/EC-03-2012-0045 | - |
dc.identifier.citation | Engineering Computations. Bingley: Emerald Group Publishing Limited, v. 31, n. 6, p. 1034-1051, 2014. | - |
dc.identifier.issn | 0264-4401 | - |
dc.identifier.uri | http://hdl.handle.net/11449/117064 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/117064 | - |
dc.description.abstract | Purpose - The purpose of this paper is twofold: to analyze the computational complexity of the cogeneration design problem; to present an expert system to solve the proposed problem, comparing such an approach with the traditional searching methods available.Design/methodology/approach - The complexity of the cogeneration problem is analyzed through the transformation of the well-known knapsack problem. Both problems are formulated as decision problems and it is proven that the cogeneration problem is np-complete. Thus, several searching approaches, such as population heuristics and dynamic programming, could be used to solve the problem. Alternatively, a knowledge-based approach is proposed by presenting an expert system and its knowledge representation scheme.Findings - The expert system is executed considering two case-studies. First, a cogeneration plant should meet power, steam, chilled water and hot water demands. The expert system presented two different solutions based on high complexity thermodynamic cycles. In the second case-study the plant should meet just power and steam demands. The system presents three different solutions, and one of them was never considered before by our consultant expert.Originality/value - The expert system approach is not a "blind" method, i.e. it generates solutions based on actual engineering knowledge instead of the searching strategies from traditional methods. It means that the system is able to explain its choices, making available the design rationale for each solution. This is the main advantage of the expert system approach over the traditional search methods. On the other hand, the expert system quite likely does not provide an actual optimal solution. All it can provide is one or more acceptable solutions. | en |
dc.description.sponsorship | FINEP | - |
dc.description.sponsorship | ANP | - |
dc.description.sponsorship | Petrobras | - |
dc.format.extent | 1034-1051 | - |
dc.language.iso | eng | - |
dc.publisher | Emerald Group Publishing Limited | - |
dc.source | Web of Science | - |
dc.subject | Expert system | en |
dc.subject | Cogeneration design | en |
dc.subject | Computational complexity | en |
dc.subject | Knapsack problem | en |
dc.title | Cogeneration design problem Computational complexity analysis and solution through an expert system | en |
dc.type | outro | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.contributor.institution | Universidade Federal de Santa Catarina (UFSC) | - |
dc.description.affiliation | Univ Estadual Paulista, Dept Energy, Guaratingueta, Brazil | - |
dc.description.affiliation | Univ Fed Santa Catarina, Dept Mech Engn, Florianopolis, SC, Brazil | - |
dc.description.affiliationUnesp | Univ Estadual Paulista, Dept Energy, Guaratingueta, Brazil | - |
dc.identifier.doi | 10.1108/EC-03-2012-0045 | - |
dc.identifier.wos | WOS:000341732900001 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | Engineering Computations | - |
Appears in Collections: | Artigos, TCCs, Teses e Dissertações da Unesp |
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.