Optimization Online


The Synthesis Problem of Decentralized Energy Systems is strongly NP-hard

Sebastian Goderbauer (goderbauer***at***math2.rwth-aachen.de)
Martin Comis (comis***at***math2.rwth-aachen.de)
Felix J. L. Willamowski (willamowski***at***or.rwth-aachen.de)

Abstract: We analyze the computational complexity of the synthesis problem of decentralized energy systems. This synthesis problem consists of combining various types of energy conversion units and determining their sizing as well as operations in order to meet time-varying energy demands while maximizing an objective function, e.g., the net present value. In this paper, we prove that the synthesis problem of decentralized energy systems is strongly NP-hard. Furthermore, we prove a strong inapproximability result. This paper provides the first complexity findings in the long scientific history of the synthesis problem of decentralized energy systems.

Keywords: Computational complexity; NP-hardness; Inapproximability; Structural optimization; Optimal design and operation; Superstructure

Category 1: Applications -- Science and Engineering

Category 2: Applications -- Science and Engineering (Chemical Engineering )

Category 3: Combinatorial Optimization

Citation: Published in Computers & Chemical Engineering (DOI: 10.1016/j.compchemeng.2019.02.002).


Entry Submitted: 05/16/2018
Entry Accepted: 05/16/2018
Entry Last Modified: 02/04/2019

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society