TY - CHAP AU - Garcia Ojeda, Juan Carlos AU - A, Argoti AU - Bertók, Botond AU - Friedler, Ferenc ED - Růžička, J TI - Modeling and Assessing Evacuation Route Plans by Resorting to the P-graph Framework T2 - 2020 Smart City Symposium Prague (SCSP) PB - IEEE CY - New York, New York SN - 9781728168210 PY - 2020 SP - 1 EP - 6 PG - 6 DO - 10.1109/SCSP49987.2020.9134050 UR - https://m2.mtmt.hu/api/publication/31880965 ID - 31880965 N1 - Universidad de Cartagena, Cartagena, Colombia Institute for Process Systems Engineering Sustainability, Pázmány Péter Catholic University, Budapest, Hungary University of Pannonia, Veszprém, Hungary Export Date: 18 November 2022 AB - Industrial sites are being built increasingly more complex, thus making it difficult to effect rapid and safe evacuations. The optimal evacuation plan depends on the types and locations of threats in addition to the site's layout; moreover, it is necessary to determine the plan in real time when the events are detected. In such emergency scenarios, determining an optimal or near optimal plan, in terms of the egress time, entails the evaluation of numerous alternative evacuation routes. This problem is highly convoluted because of its combinatorial nature; thus, it is highly desirable or even essential, to have access to optimization techniques to solve it. In the present contribution, an algorithmic optimization method is presented to plan evacuation strategies in the chemical industry, in terms of the egress time, supported by software tools. This method uses the graph-theoretic approach based on P- graphs, which exploits the combinatorial nature of the problem, thus providing optimal solutions with high computational efficiency. The method is illustrated by applying it to the evacuation of various industrial site configurations. LA - English DB - MTMT ER - TY - GEN AU - Pimentel, J. AU - A., Argoti AU - I., Gil AU - Heckl, István AU - Bertók, Botond AU - Friedler, Ferenc AU - Garcia Ojeda, Juan Carlos TI - P-graph approach for enhancing the sustainability of benzaldehyde production from toluene via Reaction-Network Synthesis PY - 2018 UR - https://m2.mtmt.hu/api/publication/30729128 ID - 30729128 LA - English DB - MTMT ER - TY - THES AU - Garcia Ojeda, Juan Carlos TI - On modeling building-evacuation-route planning and organization-based multiagent systems by resorting to the P-graph framework = Épület kiürítési útvonalak tervezése és szervezeti alapú, multiágens rendszerek modellezése a P-gráf keretrendszer felhasználásával PB - Pannon Egyetem PY - 2017 SP - 169 DO - 10.18136/PE.2016.630 UR - https://m2.mtmt.hu/api/publication/3237541 ID - 3237541 LA - English DB - MTMT ER - TY - GEN AU - Losada, J.P. AU - Heckl, István AU - Bertók, Botond AU - Friedler, Ferenc AU - Garcia Ojeda, Juan Carlos AU - A., Argoti TI - Process­network Synthesis for Benzaldehyde Production: P­graph Approach PY - 2015 UR - https://m2.mtmt.hu/api/publication/30729181 ID - 30729181 LA - English DB - MTMT ER - TY - CHAP AU - Garcia Ojeda, Juan Carlos AU - Bertók, Botond AU - Friedler, Ferenc AU - Argoti, A TI - Identifying evacuation routes via the P-graph methodology T2 - 2015 10th Computing Colombian Conference (10CCC 2015) SN - 9781467394659 PY - 2015 SP - 339 EP - 346 PG - 8 DO - 10.1109/ColumbianCC.2015.7333443 UR - https://m2.mtmt.hu/api/publication/3031466 ID - 3031466 N1 - A4 LA - English DB - MTMT ER - TY - JOUR AU - Pimentel, Jean AU - Heckl, István AU - Bertók, Botond AU - Friedler, Ferenc AU - Garcia Ojeda, Juan Carlos AU - Argoti, A TI - Process Network Synthesis for Benzaldehyde Production: P-graph Approach JF - CHEMICAL ENGINEERING TRANSACTIONS J2 - CHEM ENG TR VL - 45 PY - 2015 SP - 1369 EP - 1374 PG - 6 SN - 9788895608365 SN - 1974-9791 DO - 10.3303/CET1545229 UR - https://m2.mtmt.hu/api/publication/2941194 ID - 2941194 N1 - ISSN 2283-9216 WoS:hiba:000366034200229 2019-03-11 01:38 típus nem egyezik, első szerző nem egyezik LA - English DB - MTMT ER - TY - JOUR AU - Garcia Ojeda, Juan Carlos AU - Bertók, Botond AU - Friedler, Ferenc AU - Argoti, A AU - Fan, LT TI - A preliminary study of the application of the P- graph methodology for organization-based multiagent system designs: Assessment JF - ACTA POLYTECHNICA HUNGARICA J2 - ACTA POLYTECH HUNG VL - 12 PY - 2015 IS - 2 SP - 103 EP - 122 PG - 20 SN - 1785-8860 DO - 10.12700/APH.12.2.2015.2.7 UR - https://m2.mtmt.hu/api/publication/2931538 ID - 2931538 N1 - Department of Systems Engineering, Autonomous University of Bucaramanga, Av. 42 No 48-11, El Jardín, Bucaramanga, Santander, 680003, Colombia Department of Computer Science and Systems Technology, University of Pannonia, Egyetem u. 10, Veszprém, H-8200, Hungary Department of Chemical Engineering, Kansas State University, 1005 Durland Hall, Manhattan, KS 66506, United States Cited By :9 Export Date: 16 October 2023 AB - At the outset, the design of an organization-based multiagent system is modeled according to the framework of Organization Model for Adaptive Complex Systems (OMACS). Subsequently, this design model is transformed into a process-network model. Eventually, the resultant process-network model in conjunction with the P-graph-based methodology give rise to: (i) the maximal structure of the process network, comprising all the feasible combinations of structures, i.e., OMACS-based design configurations, capable of yielding the specified products from the specified raw material; (ii) every feasible structure for the process of interest; and (iii) the optimal structure of the network, i.e., the optimal OMACS-based design configuration. Finally, in light of the tenet of a modeling- transformation-evaluation paradigm, an appraisal is made of the feasibility as well as the flexibility and cost of the optimal OMACS-based design configuration obtained. © 2015 Budapest Tech Polytechnical Institution. All rights reserved. LA - English DB - MTMT ER - TY - CHAP AU - DeLoach, Scott A AU - Garcia Ojeda, Juan Carlos ED - Cossentino, Massimo ED - Hilaire, Vincent ED - Molesini, Ambra ED - Seidita, Valeria TI - The O-MASE Methodology T2 - Handbook on Agent-Oriented Design Processes PB - Springer-Verlag Wien CY - Heidelberg SN - 9783642399749 PY - 2014 SP - 253 EP - 285 DO - 10.1007/978-3-642-39975-6_9 UR - https://m2.mtmt.hu/api/publication/2959808 ID - 2959808 LA - English DB - MTMT ER - TY - JOUR AU - Garcia Ojeda, Juan Carlos AU - Bertók, Botond AU - Friedler, Ferenc AU - Fan, LT TI - Building-evacuation-route planning via time-expanded process-network synthesis JF - FIRE SAFETY JOURNAL J2 - FIRE SAFETY J VL - 61 PY - 2013 SP - 338 EP - 347 PG - 10 SN - 0379-7112 DO - 10.1016/j.firesaf.2013.09.023 UR - https://m2.mtmt.hu/api/publication/2706015 ID - 2706015 N1 - Autonomous University of Bucaramanga, Department of Systems Engineering, Avenida 42 No 48-11, Bucaramanga, Santander, Colombia Department of Computer Science and Systems Technology, University of Pannonia, Veszprem, Hungary Department of Chemical Engineering, Kansas State University, Manhattan, KS, United States Cited By :17 Export Date: 16 October 2023 CODEN: FSJOD Correspondence Address: García-Ojeda, J.C.; Autonomous University of Bucaramanga, Avenida 42 No 48-11, Bucaramanga, Santander, Colombia; email: jgarciao@unab.edu.co Funding details: Universidad Autónoma de Bucaramanga, UNAB Funding text 1: The first author acknowledges the support of the Autonomous University of Bucaramanga and the University of Pannonia . This work was undertaken under the auspices of project TÁMOP-4.2.2/B-10/1-2010-0025. AB - A method and software are proposed for optimal building-evacuation-route planning in terms of identifying evacuation routes and scheduling of evacuees on each route. First, the building-evacuation routes are represented by a P-graph, which gives rise to a time-expanded process-network synthesis (PNST) problem that can be algorithmically solved by the P-graph framework. In the proposed method, each location and passage in the building is given by a set of attributes to be taken into account in the evacuation-route planning. The evacuation time is calculated as a minimum cost of the corresponding PN ST. In addition to the globally optimal solution, the P-graph framework provides the n-best sub-optimal solutions. The validity of the proposed method is illustrated by two examples. © 2013 Elsevier Ltd. LA - English DB - MTMT ER - TY - JOUR AU - Garcia Ojeda, Juan Carlos AU - Bertók, Botond AU - Friedler, Ferenc TI - Planning Evacuation Routes with the P-graph Framework JF - CHEMICAL ENGINEERING TRANSACTIONS J2 - CHEM ENG TR VL - 29 PY - 2012 IS - 2 SP - 1531 EP - 1536 PG - 6 SN - 1974-9791 DO - 10.3303/CET1229256 UR - https://m2.mtmt.hu/api/publication/2060145 ID - 2060145 N1 - Department of Systems Engineering, Autonomous University of Bucaramanga, Av. 42 No 48-11, Bucaramanga, Colombia Department of Computer Science and Systems Technology, University of Pannonia, Egyetem u. 10, Veszprém, H-8200, Hungary Cited By :28 Export Date: 16 October 2023 Correspondence Address: Garcia-Ojeda, J.C.; Department of Systems Engineering, Av. 42 No 48-11, Bucaramanga, Colombia; email: jgarciao@unab.edu.co LA - English DB - MTMT ER -