TY - JOUR AU - Bartos, Anikó AU - Bertók, Botond TI - Production line balancing by P-graphs JF - OPTIMIZATION AND ENGINEERING J2 - OPTIM ENG VL - 21 PY - 2020 IS - 2 SP - 567 EP - 584 PG - 18 SN - 1389-4420 DO - 10.1007/s11081-019-09462-1 UR - https://m2.mtmt.hu/api/publication/30761719 ID - 30761719 N1 - Cited By :3 Export Date: 18 November 2022 Correspondence Address: Bartos, A.; Department of Computer Science and Systems Technology, 10, Egyetem Street, Hungary; email: bartos@dcs.uni-pannon.hu AB - Assembly industry plays a key role in Central and Eastern Europe. Large companies and their subcontractors manufacture automotive and electronic products from components, employing a significant number of human resources. Due to the growing labor shortage, it is critical that the production lines should be optimally loaded, i.e., the tasks have to be evenly distributed among the workstations according to their cycle times. In this article a novel formulation of the problem by process graphs or P-graphs is presented leading in an easy to follow visual definition of the potential task to employee allocations, as well as the options to generate a mathematical programming model algorithmically, to be solved by general purpose solvers or get the optimal and alternative N-best allocations by P-graph software. In addition to the theoretical presentation, the article shows the results achieved by applying the proposed methodology in a real-world environment in a computer assembly plant. The P-graph approach provides visual modeling by graphs in a graphical editor and helps understand the relations of decision variables while generating the corresponding mathematical model, which can be generalized for a class of problems and rebuilt according to actual data. As a result, the basis for rigorous mathematical optimization-based decision support can be built up according to graphical models easily understandable by end users as well. LA - English DB - MTMT ER - TY - JOUR AU - Friedler, Ferenc AU - Bertók, Botond AU - Foo, Dominic CY AU - Tan, Raymond R TI - Prospects and challenges for chemical process synthesis with P-graph JF - CURRENT OPINION IN CHEMICAL ENGINEERING J2 - CURR OPIN CHEM ENG VL - 26 PY - 2019 SP - 58 EP - 64 PG - 7 SN - 2211-3398 DO - 10.1016/j.coche.2019.08.007 UR - https://m2.mtmt.hu/api/publication/30920524 ID - 30920524 N1 - Pázmány Péter Catholic University, Szentkirályi utca 28, Budapest, 1088, Hungary De La Salle University, 2401 Taft Avenue, Manila, 0922, Philippines University of Pannonia, Egyetem u. 10, Veszprém, 8200, Hungary The University of Nottingham Malaysia, Jalan Broga, Semenyih, Selangor 43500, Malaysia Cited By :35 Export Date: 18 November 2022 LA - English DB - MTMT ER - TY - JOUR AU - Éles, András AU - Halász, L AU - Heckl, István AU - Cabezas, Heriberto TI - Energy Consumption Optimization of a Manufacturing Plant by the Application of the P-Graph Framework JF - CHEMICAL ENGINEERING TRANSACTIONS J2 - CHEM ENG TR VL - 70 PY - 2018 SP - 1783 EP - 1788 PG - 6 SN - 1974-9791 DO - 10.3303/CET1870298 UR - https://m2.mtmt.hu/api/publication/3404230 ID - 3404230 LA - English DB - MTMT ER - TY - JOUR AU - Heckl, István AU - Halász, László AU - Szlama, Adrián György AU - Cabezas, Heriberto AU - Friedler, Ferenc TI - Process Synthesis involving multi-period operations by the p-graph framework JF - COMPUTERS & CHEMICAL ENGINEERING J2 - COMPUT CHEM ENG VL - 83 PY - 2015 SP - 157 EP - 164 PG - 8 SN - 0098-1354 DO - 10.1016/j.compchemeng.2015.04.037 UR - https://m2.mtmt.hu/api/publication/2941212 ID - 2941212 LA - English DB - MTMT ER - TY - JOUR AU - Klemeš, Jiri Jaromir AU - Kravanja, Z TI - Forty years of Heat Integration: Pinch Analysis (PA) and Mathematical Programming (MP) JF - CURRENT OPINION IN CHEMICAL ENGINEERING J2 - CURR OPIN CHEM ENG VL - 2 PY - 2013 IS - 4 SP - 461 EP - 474 PG - 14 SN - 2211-3398 DO - 10.1016/j.coche.2013.10.003 UR - https://m2.mtmt.hu/api/publication/2509858 ID - 2509858 AB - Process Integration (PI) supporting Process Design, Integration, and Optimisation has been around from the early 1970s. PI was developed originally from Heat Integration, which remains the cornerstone for PI continuous advance. It has been closely related to the development of Chemical, Mechanical and Power Engineering supported by the extended implementation of mathematical modelling, simulation and optimisation, and by the application of information technology. Its development has accelerated over the years as its methodology has been able to provide answers and support for important issues regarding economic development - better utilisation and savings regarding energy, water, and other resources. This contribution is targeting towards providing at least a short overview of its historical development, achievements, and future challenges. © 2013 Elsevier Ltd. All rights reserved. LA - English DB - MTMT ER - TY - JOUR AU - Vance, L AU - Cabezas, Heriberto AU - Heckl, István AU - Bertók, Botond AU - Friedler, Ferenc TI - Synthesis of sustainable energy supply chain by the P-graph framework JF - INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH J2 - IND ENG CHEM RES VL - 52 PY - 2013 IS - 1 SP - 266 EP - 274 PG - 9 SN - 0888-5885 DO - 10.1021/ie3013264 UR - https://m2.mtmt.hu/api/publication/2194049 ID - 2194049 N1 - Office of Research and Development, Environmental Protection Agency, U.S. EPA, 26 West Martin Luther King Drive, Cincinnati, OH 45268, United States Department of Computer Science and Systems Technology, University of Pannonia, Hungary Cited By :42 Export Date: 16 October 2023 CODEN: IECRE Correspondence Address: Cabezas, H.; Office of Research and Development, 26 West Martin Luther King Drive, Cincinnati, OH 45268, United States; email: Cabezas.Heriberto@epa.gov AB - The present work proposes a computer-aided methodology for designing sustainable supply chains in terms of sustainability metrics by utilizing the P-graph framework. The methodology is an outcome of the collaboration between the Office of Research and Development (ORD) of the U.S. EPA and the research group led by the creators of the P-graph framework at the University of Pannonia. The integration of supply chain design and sustainability is the main focus of this collaboration. The P- graph framework provides a mathematically rigorous procedure for synthesizing optimal and alternative suboptimal networks subject to multiple objectives and constraints, which include profitability and sustainability in the proposed methodology. Specifically, to evaluate the sustainability of a given process under construction including its supply chain, sustainability metrics are incorporated into the design procedure. The proposed methodology is demonstrated with the optimal design of a supply chain for providing heat and electric power to an agricultural region with relatively limited land area where agricultural wastes can potentially be recovered as renewable resources. The objective functions for optimization comprise the profit and the ecological footprint. The results of the study indicate that, compared to using electricity from the grid and/or natural gas, using renewable energy resources can yield substantial cost reductions of up to 5%, as well as significant ecological footprint reductions of up to 77%. It may, therefore, be possible to design more sustainable supply chains that are both cost-effective and less environmentally damaging. © 2012 American Chemical Society. LA - English DB - MTMT ER - TY - JOUR AU - Emhamed, A M AU - Czuczai, B AU - Horvath, L AU - Rév, Endre AU - Lelkes, Zoltán TI - Optimization of Desalination Location Problem Using MILP JF - AICHE JOURNAL J2 - AICHE J VL - 53 PY - 2007 IS - 9 SP - 2367 EP - 2383 PG - 17 SN - 0001-1541 DO - 10.1002/aic.11255 UR - https://m2.mtmt.hu/api/publication/2635739 ID - 2635739 AB - A new mixed-integer linear programming model for location problem is developed in this work in order to find the optimal co-ordinates of the desalination plants. The model takes into account the given locations and capacities of the water incomes, the demands, and the costs of plants and pipelining. Feasible and infeasible plant regions are distinguished for locating the plants. The model has been developed in two consecutive phases. First, a basic model is developed that provides a solution within short time but does not take into account the possibility of pipeline branching. Application of this model gives rise to redundant pipelines to some connections, involving extra costs. Pipeline branching is dealt with an improved model developed in the second phase. This improved model provides realistic solution but with much longer computation time. The results of applying the different models on motivated examples of different sizes are detailed. (C) 2007 American Institute of Chemical Engineers. LA - English DB - MTMT ER - TY - JOUR AU - Liu, J AU - Fan, L T AU - Seib, P AU - Friedler, Ferenc AU - Bertók, Botond TI - Holistic approach to process retrofitting: Application to downstream process for biochemical production of organics JF - INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH J2 - IND ENG CHEM RES VL - 45 PY - 2006 IS - 12 SP - 4200 EP - 4207 PG - 8 SN - 0888-5885 DO - 10.1021/ie051014m UR - https://m2.mtmt.hu/api/publication/1044778 ID - 1044778 N1 - Department of Chemical Engineering, Kansas State University, Manhattan, KS 66506, United States Department of Grain Science and Industry, Kansas State University, Manhattan, KS 66506, United States Department of Computer Science, University of Veszprém, Veszprem, Egyetem u. 10 H-8200, Hungary Cited By :33 Export Date: 16 October 2023 CODEN: IECRE Correspondence Address: Fan, L.T.; Department of Chemical Engineering, , Manhattan, KS 66506, United States; email: fan@ksu.edu LA - English DB - MTMT ER - TY - JOUR AU - Farkas, T AU - Rév, Endre AU - Lelkes, Z TI - Process flowsheet superstructures: Structural multiplicity and redundancy part I: Basic GDP and MINLP representations JF - COMPUTERS & CHEMICAL ENGINEERING J2 - COMPUT CHEM ENG VL - 29 PY - 2005 IS - 10 SP - 2180 EP - 2197 PG - 18 SN - 0098-1354 DO - 10.1016/j.compchemeng.2005.07.007 UR - https://m2.mtmt.hu/api/publication/2647490 ID - 2647490 AB - Structural multiplicity has a significant effect on the solution of an MINLP model for process synthesis problems. The optimization model may also have built-in redundancy that cannot always be directly derived from the multiplicity of the superstructure. A basic GDP representation (BGR) involving logical relations is defined, and can be constructed by applying a standard natural representation of the process. Basic MINLP representation (BMR) is defined by transforming the logical relations to algebraic ones. MINLP representation (MR) is defined through a fixed form of BMR. Equivalency and representativeness of MR-s in general form can be analyzed by reducing them to their BMRs. BMR can be automatically generated, and can serve as a reference representation. Binary and continuous multiplicity of MR are defined. If the supergraph, i.e. the graph representing the superstructure, is structurally redundant (i.e. there are isomorphic graphs amongst their subgraphs) then BMR has binary multiplicity. Conversely, the structural redundancy of the graph does not follow from the binary multiplicity of its BMR. Different kinds of multiplicity and redundancy measures of the MINLP representation will be defined in Part 11 of this series in order to help inventing tools for decreasing their detrimental effect. Alternative MINLP representations will there be defined, constructed, and compared from the viewpoint of ideality, minimality, and solution properties. (c) 2005 Elsevier Ltd. All rights reserved. LA - English DB - MTMT ER - TY - JOUR AU - Farkas, T AU - Rév, Endre AU - Lelkes, Z TI - Process flowsheet superstructures: Structural multiplicity and redundancy Part II: Ideal and binarily minimal MINLP representations JF - COMPUTERS & CHEMICAL ENGINEERING J2 - COMPUT CHEM ENG VL - 29 PY - 2005 IS - 10 SP - 2198 EP - 2214 PG - 17 SN - 0098-1354 DO - 10.1016/j.compchemeng.2005.07.008 UR - https://m2.mtmt.hu/api/publication/2647491 ID - 2647491 AB - The essential problems, namely representativeness and uniqueness, in defining mixed integer non-linear programming (MINLP) representation (MR) is solved in Part I by first defining a basic MR (BMR) that: (1) can be automatically constructed from an easier formable standard GDP representation and (2) serves as a reference representation. Binary and continuous multiplicity of MR are also defined in Part I, and relation is given there between structural redundancy and binary multiplicity. Based on this results, ideal and binarily minimal MR-s are defined, and the different MR-s are compared from numerical point of view in the present (and final) part. Ideal MR represents all the considered structures and not any other structure. Supposing the process graphs are distincted using binary variables, binarily minimal MR uses the minimal number of them. Solvability of the different MR-s, including some combined versions, are tested on a middle scale and an industrial scale process synthesis problems. Total solution time, solution time for subproblems, number of iterations, non-ideality and scale of the solvable problems are compared. Idealization of the representation and decreasing the number of binary variables, as suggested in the article, both enhance the solvability and decrease the solution time in a great extent. (c) 2005 Elsevier Ltd. All riahts reserved. LA - English DB - MTMT ER - TY - CHAP AU - Farkas, Tivadar AU - Rév, Endre AU - Czuczai, B AU - Fonyó, Zsolt AU - Lelkes, Zoltán ED - Puigjaner, L ED - Espuña, A TI - R-Graph-Based Distillation Column Superstructure and MINLP Model T2 - European Symposium on Computer-Aided Process Engineering-15, 20A and 20B PB - Elsevier CY - Amsterdam CY - San Diego (CA) SN - 9780444519870 T3 - Computer-Aided Chemical Engineering, ISSN 1570-7946 ; 20a-20b. PY - 2005 SP - 889 UR - https://m2.mtmt.hu/api/publication/236103 ID - 236103 LA - English DB - MTMT ER - TY - JOUR AU - Szitkai, Z AU - Lelkes, Z AU - Rév, Endre AU - Fonyó, Zsolt TI - Handling of removable discontinuities in MINLP models for process synthesis problems, formulations of the Kremser equation JF - COMPUTERS & CHEMICAL ENGINEERING J2 - COMPUT CHEM ENG VL - 26 PY - 2002 IS - 11 SP - 1501 EP - 1516 PG - 16 SN - 0098-1354 DO - 10.1016/S0098-1354(02)00037-6 UR - https://m2.mtmt.hu/api/publication/2647495 ID - 2647495 AB - This paper presents a new method for handling removable discontinuities in non-convex mixed integer non-linear programming (MINLP) models for chemical process synthesis and design. First, the occurrences of different kinds of discontinuities in design equations are discussed. Then methods so far developed for handling discontinuities in an MINLP design environment are summarized. In the main part of the paper, a new method is presented for handling removable discontinuities. Our new method is compared to five conventional literature methods applied to three mass exchange network synthesis problems of different size, where the Kremser equation is used for calculating the number of equilibrium stages. In addition, a heat exchange network synthesis problem is considered where the logarithmic mean temperature difference is calculated rigorously. Our method proved to be much faster than the other methods examined and shows less sensitivity to the change of initial values in terms of optimal objective function value and solution time. (C) 2002 Elsevier Science Ltd. All rights reserved. LA - English DB - MTMT ER - TY - JOUR AU - Brendel, M H AU - Friedler, Ferenc AU - Fan, L T TI - Combinatorial foundation for logical formulation in process network synthesis JF - COMPUTERS & CHEMICAL ENGINEERING J2 - COMPUT CHEM ENG VL - 24 PY - 2000 IS - 8 SP - 1859 EP - 1864 PG - 6 SN - 0098-1354 DO - 10.1016/S0098-1354(00)00569-X UR - https://m2.mtmt.hu/api/publication/1044835 ID - 1044835 N1 - Department of Computer Science, University of Veszprém, Egyetem u. 10, Veszprém, H-8200, Hungary Department of Chemical Engineering, Kansas State University, Manhattan, KS 66506, United States Cited By :26 Export Date: 16 October 2023 CODEN: CCEND Correspondence Address: Friedler, F.; Department of Computer Science, , Veszprem, Egyetem u. 10, H-8200, Hungary; email: friedler@dcs.vein.hu LA - English DB - MTMT ER - TY - CHAP AU - Friedler, Ferenc AU - Varga, József AU - Feher, E AU - Fan, L T ED - Floudas, C A ED - Pardalos, P M TI - Combinatorially Accelerated Branch-and-Bound Method for Solving the MIP Model of Process Network Synthesis T2 - Nonconvex Optimization and Its Applications, State of the Art in Global Optimization, Computational Methods and Applications PB - Kluwer Academic Publishers CY - Dordrecht SN - 0792338383 PY - 1996 SP - 609 EP - 626 PG - 18 UR - https://m2.mtmt.hu/api/publication/1049662 ID - 1049662 LA - English DB - MTMT ER - TY - JOUR AU - Friedler, Ferenc AU - Tarján, Klára AU - Huang, Y W AU - Fan, L T TI - Graph-Theoretic Approach to Process Synthesis: Polynomial Algorithm for Maximal Structure Generation JF - COMPUTERS & CHEMICAL ENGINEERING J2 - COMPUT CHEM ENG VL - 17 PY - 1993 SP - 929 EP - 942 PG - 14 SN - 0098-1354 DO - 10.1016/0098-1354(93)80074-W UR - https://m2.mtmt.hu/api/publication/1044846 ID - 1044846 N1 - Department of Systems Engineering, Research Institute of Chemical Engineering, Hungarian Academy of Sciences, Veszprém, Pf. 125, 8201, Hungary Department of Mathematics, University of Veszprém, Veszprém, Hungary Department of Chemical Engineering, Kansas State University, Manhattan, KS 66506, United States Cited By :258 Export Date: 16 October 2023 CODEN: CCEND Correspondence Address: Friedler, F. Funding details: U.S. Environmental Protection Agency, EPA, R-815709 Funding text 1: pendently verifying its mathematical contents. Although the research in this article has been funded in part by the U.S. Environmental Protection Agency under assistance agreement R-815709 to the Great Plains/Rocky Mountain Hazardous Substance Research Center with headquarters at Kansas State University, it has not been subjected to the Aaencv’s Deer and administrative review and therefore may not ne&s~arily reflect the views of the Agency and no official endorsement should be inferred. This research was partially supported by the Hungarian Academy of Sciences and Kansas State University Center for Hazardous Substance. Research. LA - English DB - MTMT ER - TY - JOUR AU - Friedler, Ferenc AU - Tarján, Klára AU - Huang, Y W AU - Fan, L T TI - Combinatorial Algorithms for Process Synthesis JF - COMPUTERS & CHEMICAL ENGINEERING J2 - COMPUT CHEM ENG VL - 16 PY - 1992 SP - S313 EP - S320 SN - 0098-1354 DO - 10.1016/S0098-1354(09)80037-9 UR - https://m2.mtmt.hu/api/publication/1044848 ID - 1044848 N1 - Cited By :204 Export Date: 16 October 2023 Correspondence Address: Fan, L.T.; Laboratory for Artificial Intelligence in Process Engineering Department of Chemical Engineering, , Kansas, 66506, United States Funding details: U.S. Environmental Protection Agency, EPA Funding details: Kansas State University, KSU Funding text 1: Although the research in this article has been funded in part by the U.S. Environmental Protection Agency under assistance agreement headquarters at Kansas State University, it has not been subjected to the and therefore may not necessarily reflect the views of the Agency and no official endorsement should be inferred. This research was partially supported by Kansas State University Center for Hazardous Substance Research. LA - English DB - MTMT ER - TY - JOUR AU - Friedler, Ferenc AU - Tarján, Klára AU - Huang, Y W AU - Fan, L T TI - Graph-Theoretic Approach to Process Synthesis: Axioms and Theorems JF - CHEMICAL ENGINEERING SCIENCE J2 - CHEM ENG SCI VL - 47 PY - 1992 SP - 1973 EP - 1988 PG - 16 SN - 0009-2509 DO - 10.1016/0009-2509(92)80315-4 UR - https://m2.mtmt.hu/api/publication/1044849 ID - 1044849 N1 - Department of Systems Engineering Research Institute of Technical Chemistry, Hungarian Academy of Sciences, P.F. 125, Veszprém, 8201, Hungary Institute of Mathematics, University of Veszprém, Veszprém, Hungary Department of Chemical Engineering, Kansas State University, Manhattan, KS 66506, United States Cited By :357 Export Date: 16 October 2023 CODEN: CESCA Correspondence Address: Friedler, F.; Department of Systems Engineering Research Institute of Technical Chemistry, Hungarian Academy of Sciences, P.F. 125, Veszprém, 8201, Hungary Funding details: U.S. Environmental Protection Agency, EPA, R-815709 Funding details: Kansas State University, KSU Funding text 1: Acknowledgments-Although the research in this article has been funded in part by the U.S. Environmental Protection Agency under assistance agreement R-815709 to the Haaar-dous Substance Research Center for U.S. EPA Regions 7 and 8 with headquarters at Kansas State University, it has not been subjected to the Agency’s peer and administrative review and therefore may not necessarily reflect the views of the Agency and no official endorsement should be inferred. This research was partially supported by Kansas State University Center for Hazardous Substance Research. LA - English DB - MTMT ER -