Abstract

Segregated targeting problems, a class of resource allocation and conservation problem, consists of a set of common internal sources and multiple sets of demands. Each set of demands, also called zone, is associated with a dedicated resource. The demands of each zone are met by the resource specified for that zone and the common internal sources. These problems are addressed in the literature for minimisation of a single objective function. However, to make sustainable and cleaner production, multi-objective optimisation plays a vital role. This paper addresses multiple objectives in a segregated targeting problem using Pinch Analysis approach. A methodology is developed in this paper which graphically identifies precisely the optimal targeting sequences and reduces the computational effort of calculating non-optimal solutions. The computational efficiency of the proposed approach is illustrated through an example. Four different illustrative examples from various domains such as water allocation networks, planning for carbon-constrained energy sectors, and integrated iron and steel mill, demonstrate the applicability of the proposed methodology. Finally, the optimal solutions of these illustrative examples are represented through the Pareto-optimal front.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call