Year: 2019
Type: preprint
Abstract: Designing and analyzing algorithms with provable performance guarantees enables efficient optimization problem solving in different application domains, e.g.\ communication networks, transportation, economics, and manufacturing. Despite the significant contributions of approximation algorithms in engineering, only limited and isolated works contribute from this perspective in process systems engineering. The current paper discusses three representative, NP-hard problems in process systems engineering: (i) pooling, (ii) process scheduling, and (iii) heat exchanger network synthesis. We survey relevant results and raise major open questions. Further, we present approximation algorithms applications which are relevant to process systems engineering: (i) better mathematical modeling, (ii) problem classification, (iii) designing solution methods, and (iv) dealing with uncertainty. This paper aims to motivate further research at the intersection of approximation algorithms and process systems engineering.
Source: arXiv (Cornell University)
Institution: Imperial College London
Language: English
Subfield: Control and Systems Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
Awards: Uncertainty-Aware Planning and Scheduling in the Process Industries, G352653711, GALINI: Global ALgorithms for mixed-Integer Nonlinear optimisation of Industrial systems, Industrial CASE Account - Imperial College London 2017, EPSRC Centre for Doctoral Training in High Performance Embedded and Distributed Systems, G6136873952
OpenAlex ID: W4288102408