P-Graph Approach for Optimization of Segregated Targeting Networks

Segregated targeting networks are a special class of source-sink networks, addressed in the literature using Pinch Analysis technique. This work presents a novel approach for the optimization of segregating targeting problems using P-graph methodology. Along with the general constraints of satisfying the requirement of different demands (flow and material balance), this work also considers many practical constraints which are not included earlier for segregated targeting networks. For example, transportation cost associated with the flow of materials from sources to sinks, investment and fixed cost associated with different sources and sinks, etc. Apart from the inclusion of these practical constraints, P-graph methodology provides the advantage of generating n-best solution networks. This approach of addressing segregated targeting problems is demonstrated by using an illustrative case study from carbon constraint energy sector planning domain, which includes the optimal allocation of different energy sources to meet the demands of various sectors of the society.