Approximation algorithms for process systems engineering

作     者：Letsios, Dimitrios Baltean-Lugojan, Radu Ceccon, Francesco Mistry, Miten Wiebe, Johannes Misener, Ruth 

作者机构：Imperial Coll London Dept Comp London SW7 2AZ England 

出 版 物：《COMPUTERS & CHEMICAL ENGINEERING》 (计算机与化工)

年 卷 期：2020年第132卷

页      面：106599-000页

核心收录：

学科分类：0817[工学-化学工程与技术] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Engineering & Physical Sciences Research Council (EPSRC) [EP/M028240/1] EPSRC DTP EPSRC Center for Doctoral Training in High Performance Embedded and Distributed Systems [EP/L016796/1] EPSRC/Schlumberger CASE studentship [17000145, EP/R511961/1] EPSRC Research Fellowship [EP/P016871/1] EPSRC [EP/L016796/1, EP/R511961/1] Funding Source: UKRI 

主　　题：Approximation algorithms Heuristics with performance guarantees Theoretical computer science 

摘      要：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. (C) 2019 Elsevier Ltd. All rights reserved.