A two phase approach for the bi-objective non-convex combined heat and power production planning problem

Aiying Rong, José Rui Figueira and Risto Lahdelma

European Journal of Operational Research, 2015, vol. 245, issue 1, 296-308

Abstract: In this paper, we deal with the bi-objective non-convex combined heat and power (CHP) planning problem. A medium and long term planning problem decomposes into thousands of single period (hourly) subproblems and dynamic constraints can usually be ignored in this context. The hourly subproblem can be formulated as a mixed integer linear programming (MILP) model. First, an efficient two phase approach for constructing the Pareto Frontier (PF) of the hourly subproblem is presented. Then a merging algorithm is developed to approximate the PF for the multi-period planning problem. Numerical results with real CHP plants demonstrate the effectiveness and efficiency of the solution approach using the Cplex based ɛ-constraint method as benchmark.

Keywords: Multi-objective optimization; Combined heat and power production; Mixed integer linear programming; Two phase method, (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221715001575
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:245:y:2015:i:1:p:296-308

DOI: 10.1016/j.ejor.2015.02.037

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().