No abstract

Resource allocation networks (RAN) are efficiently optimized using the techniques of Pinch Analysis. Primarily, these RANs consist of a set of source streams and a set of demands. However, in the past a special type of RAN, called segregated targeting problems, is identified which consists of multiple sets of demands called zones. The resource and cost optimality of such problems are determined by using the sequential targeting and the concept of prioritized cost. In this paper, segregated targeting problems are extended to include dedicated sources in each zone. In segregated targeting problems, sources are shared by all zones. However, in the extended version of the problem, there are some dedicated sources specific to a zone in which they are present and are not shared with other zones due to proximity, safety, operability, etc. The primary objective of this paper is to develop an algorithm, based on the principles of Pinch Analysis, to determine the minimum resource requirement for a segregated targeting problem with dedicated sources. Using rigorous mathematical arguments, a nondimensional number is determined that dictates the allocation of an internal source to a zone for overall resource optimality. As a part of the proposed algorithm, we have rigorously analyzed and characterized pinch jump due to addition and removal of flows from a RAN. The applicability of the proposed algorithm is demonstrated through three examples from diverse domains: cooling water network, carbon constrained energy sector planning, and water allocation network.

No abstract

No abstract

Pinch analysis is a well-established technique to achieve sustainable development through conservation of various resources. The techniques of pinch analysis are also applied for cost minimisation in several problems as cost-effectiveness plays a major role in decision making for any industry. In this paper, cost optimality of a special kind of resource allocation problem, called segregated targeting problem with dedicated sources, is addressed. A segregated targeting problem consists of multiple set of demands called zones and a set of common internal sources. Dedicated sources are the internal sources which are specific to a zone in which they are present and are not shared with other zones. A mathematically rigorous methodology is developed in this paper and a quantity with the dimension of per unit cost that sets the preference for the distribution of flow from different sources to demands is identified. The applicability of the proposed methodology is demonstrated through three illustrative examples from diverse domains: carbon constrained energy sector planning, water allocation network, and integrated iron and steel mill.