SlideShare a Scribd company logo
Planning Evacuation Routes with the P-
graph Framework
Juan C. Garcia-Ojeda*, Botond Bertok, Ferenc
Friedler, and Mate Hegyhati
University of Pannonia, Veszprém, Hungary
* Autonomous University of Bucaramanga, Colombia
PRES 2012
August 25-29, 2012
Prague, Czech Republic
OutlineOutline
 Evacuation route planning problem
 Illustrative example
 Process-network synthesis (PNS)
by P-graph framework
 Evacuation route planning
by process-network synthesis
 Results and discusion
2www.p-graph.com
Evacuation Route PlanningEvacuation Route Planning
ProblemProblem
 Aim is to ensure
safest and fastest movement of individuals
away from any threat
(e.g., bomb threat, taking of hostages)
or the actual occurrence of a hazard
(e.g., traffic, industrial, or nuclear accidents;
natural disasters, fire, viral outbreak)
/Stringfield, 1996/
www.p-graph.com 3
Evacuation Route PlanningEvacuation Route Planning
Problem (Cont’d)Problem (Cont’d)
 Evacuation plans lack flexibility. This may lead individuals
into dangerous situations (e.g., blocked exits, or spaces
with gas leakage)
/NFPA, 1996; Pu and Zlatanova, 2005/
 Optimization software for supporting human decisions is
essential
/Cova and Johnson, 2003; Dimakis et al., 2010; Pu and
Zlatanova, 2005/
 Optimal or near optimal evacuation plan may imply the
evaluation of a myriad of evacuation routes because of the
combinatorial nature of the problem
/Cova and Johnson, 2003; Hamacher and Tjandra, 2002;
Kim et al., 2008/
www.p-graph.com 4
Evacuation Route Planning:Evacuation Route Planning:
Illustrative ExampleIllustrative Example
www.p-graph.com 5
Room A: 3/5
Room B:
4/8
Room C:
3/20
Number of evacuees / Room capacity
Door AC: 2/1
Door BC: 2/1
Door BO: 3/2
Outside: safe area
Door AB: 2/1
Door CO: 2/1
Door capacity:
evacuees / time unit
Question:
Evacuation plan
Given:
Floor map
Process-Network Synthesis:Process-Network Synthesis:
Problem DefinitionProblem Definition
 Inputs:
 A set P of demands to be satisfied
 A set R of resources (available)
 A set O of potential activities
(manufacturing, transportation, etc.)
 Cost data and capacity constraints
 Output:
 A ranked list of the n-best networks
6www.p-graph.com
 Optimization Methodology
 „P-graph framework”
(F. Friedler & L.T. Fan, 1990)
 Algorithmic model
generation
(MIP)
Process-Network SynthesisProcess-Network Synthesis
7
Problem
Generation of the
Mathematical Model
Solver
Mathematical model
Solution
7www.p-graph.com
P-graph FrameworkP-graph Framework
(F. Friedler & L. T. Fan, 1990)(F. Friedler & L. T. Fan, 1990)
 Three cornerstones of the P-graph Framework
 Structural representation: P-graph
 Axioms of the combinatorially feasible process
networks
 Algorithms for
- Generating the rigorous superstructure
- Generating the combinatorially feasible
process structures
- Generating optimal or n-best networks
8www.p-graph.com
P-graph Framework:P-graph Framework:
Structural RepresentationStructural Representation
 Unambiguous representation of structural properties
Process element P-graph representation
Resource or precursor
Final target
Intermediate entity
Activity
9www.p-graph.com
P-graph Framework:P-graph Framework:
Structural Representation (Cont’d)Structural Representation (Cont’d)
 Bipartite graph
Activities
Inputs and outputs (entities)
Input: Resources or precondition
mj
Output: Effect or target
Activity Oi
10www.p-graph.com
P-graph Framework:P-graph Framework:
Structural Representation (Cont’d)Structural Representation (Cont’d)
 Clear logical interpretation
Each precondition
(E AND F) has to be
satisfied to operate an
activity (O2)
Any of the activities
(O2 OR O3) having the
same effect can
potentially be sufficient
to initiate the
consecutive step (O1)
OR
AND
11www.p-graph.com
Axioms of Combinatorialy Feasible ProcessAxioms of Combinatorialy Feasible Process
Structures (Friedler et al., 1992)Structures (Friedler et al., 1992)
(S1) Every final target is represented in the structure.
(S2) An entity represented in the structure has no
input to if and only if it represents a precursor.
(S3) Every activity represented in the structure is
defined in the synthesis problem.
(S4) Any activity represented in the structure has at
least one path leading to a final target.
(S5) If an entity belongs to the structure, it must be
an activating entity to or resulting entity from at
least one activity represented in the structure.
12www.p-graph.com
P-graph Framework:P-graph Framework:
Reduction of the Search SpaceReduction of the Search Space
Feasible structures
Search Space
Combinatorially feasible
structures
Optimal structure
2nd
best
structure 3rd
best
structure
13www.p-graph.com
P-graph Framework: AlgorithmsP-graph Framework: Algorithms
(Friedler et al., 1992, 1993, 1995)(Friedler et al., 1992, 1993, 1995)
 Algorithm MSG (Maximal Structure Generation)
generates the rigorous superstructure: the union
of the combinatorially feasible structures.
 Algorithm SSG (Solution-Structure Generator)
generates each combinatorially feasible structure
exactly once.
 Algorithm ABB (Accelerated Branch and Bound)
generates the n-best solutions of the problem
while the search space is reduced to the set of
combinatorially feasible structures.
14www.p-graph.com
Problem Definition:Problem Definition:
Software PNS-DrawSoftware PNS-Draw
15www.p-graph.com
Problem Definition:Problem Definition:
Software PNS-StudioSoftware PNS-Studio
16www.p-graph.com
MINLP vs. P-graph FrameworkMINLP vs. P-graph Framework
www.p-graph.com 17
MINLP
P-graph
framework
Problem given by
Variables,
Constraints
Resources, Targets,
Potential activities
Generation of the
math. model
Manual Automatic
Structural properties
of process-networks
Hidden in the
math. model
Exploited
Number of solutions Single Multiple
Handling special
constraints
Can be
incorporated to
the math.
model
May require
modifications of the
model generator and
solver
Evacuation Route Planning byEvacuation Route Planning by
Process-Network SynthesisProcess-Network Synthesis
18
PNS Problem
P-graph Framework
Solution
18www.p-graph.com
Evacuation Route Planning Problem
Model
Transformation
Process-Network Synthesis ProblemProcess-Network Synthesis Problem
of the Building Evacuationof the Building Evacuation
 Resources:
Evacuees at their initial locations
 Activities:
Movement of evacuees
 Targets:
Evacuees at safe locations
 Objective:
As soon as possible
www.p-graph.com 19
Steps of Model TransformationSteps of Model Transformation
1. Transform floor map to P-graph representation
2. Estimate the time horizon (hazard spreading)
3. Determine the time unit
4. Multiplication of the graph of floor map for
each time unit
5. Formulate PNS problem based on the time
extended graph
6. Simplify the problem by algorithm MSG
7. Assign penalty more on later evacuations
8. Generate alternative evacuation plans by
algorithm ABB
www.p-graph.com 20
Process-Network Synthesis ProblemProcess-Network Synthesis Problem
of the Illustrative Exampleof the Illustrative Example
 Resources:
 Evacuees at their initial locations: A, B, C
 Targets:
 Evacuees outside the building at time 1, 2, 3…:
- D1, D2, D3…
 Activities:
 Movement of evacuees at time 1, 2, 3…:
- Leaving Room A at time 1 and
arriving in Room B at time 2: A_B_1_2
…
 Stay of evacuees at time 1, 2, 3…:
- Staying in Room A from time 1 to time 2: A_A_1_2
…
www.p-graph.com 21
Process-Network Synthesis ProblemProcess-Network Synthesis Problem
of the Illustrative Example (Cont’d)of the Illustrative Example (Cont’d)
www.p-graph.com 22
Activity Precondition Result Upper bound
A_A_0_1 A A_1 9
A_B_0_1 A B_1 2
A_C_0_1 A C_1 2
B_B_0_1 B B_1 8
B_C_0_1 B C_1 2
B_D_0_2 B D_2 2
C_C_0_1 C C_1 20
C_D_0_1 C D_1 2
A_A_1_2 A_1 A_2 5
A_C_1_2 A_1 C_2 2
B_C_1_2 B_1 C_2 2
B_D_1_3 B_1 D_3 3
C_C_1_2 C_2 C_3 20
C_D_1_2 C_1 D_2 2
Maximal Structure for the IllustrativeMaximal Structure for the Illustrative
Example Considering 3 Units of TimeExample Considering 3 Units of Time
www.p-graph.com 23
Time 1
Time 2
D_1
Time 3
Room A Room B Room C
Outside
Stay
Move
Solution #1 provided by Algorithm ABBSolution #1 provided by Algorithm ABB
www.p-graph.com 24
Time 0

Time 1

  
Time 2
    
Time 3
  
Solution #2 provided by Algorithm ABBSolution #2 provided by Algorithm ABB
www.p-graph.com 25
Time 0

Time 1

  
Time 2
    
Time 3
   
Solution #3 provided by Algorithm ABBSolution #3 provided by Algorithm ABB
www.p-graph.com 26
Time 0

Time 1

  
Time 2
    
Time 3
   
Solution #4 provided by Algorithm ABBSolution #4 provided by Algorithm ABB
www.p-graph.com 27
Time 0

Time 1

 
Time 2
    
Time 3
  
Concluding RemarksConcluding Remarks
 Evacuation Route Planning Problem can be
converted to PNS problem and solved by the P-
graph framework
 P-graph software generates optimal and n-best
alternative evacuation plan
 Alternative evacuation plans can be evaluated by
in-depth analysis
 P-graph software is available from p-graph.com
 The computational time required is typically
a few seconds or minutes
28www.p-graph.com
AcknowledgementAcknowledgement
Authors acknowledge the support of the Hungarian
Research Fund under project OTKA 81493 K.
29www.p-graph.com
Call for PartitipationCall for Partitipation
Veszprém Optimization Conference:
Advanced Algorithms
11-14 December, 2012
University of Pannonia, Veszprém, Hungary
Deadline for Abstract Submission: September 17, 2012
http://vocal.dcs.vein.hu
30www.p-graph.com
Thank you for your attention!Thank you for your attention!

More Related Content

What's hot

CP Optimizer Walkthrough
CP Optimizer WalkthroughCP Optimizer Walkthrough
CP Optimizer Walkthrough
PaulShawIBM
 
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three ProblemsIBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
Philippe Laborie
 
Day 5 application of graph ,biconnectivity fdp on ds
Day 5 application of graph ,biconnectivity fdp on dsDay 5 application of graph ,biconnectivity fdp on ds
Day 5 application of graph ,biconnectivity fdp on ds
GUNASUNDARISAPIIICSE
 
CHI 2014 talk by Antti Oulasvirta: Automated Nonlinear Regression Modeling fo...
CHI 2014 talk by Antti Oulasvirta: Automated Nonlinear Regression Modeling fo...CHI 2014 talk by Antti Oulasvirta: Automated Nonlinear Regression Modeling fo...
CHI 2014 talk by Antti Oulasvirta: Automated Nonlinear Regression Modeling fo...
Aalto University
 
Accurate Learning of Graph Representations with Graph Multiset Pooling
Accurate Learning of Graph Representations with Graph Multiset PoolingAccurate Learning of Graph Representations with Graph Multiset Pooling
Accurate Learning of Graph Representations with Graph Multiset Pooling
MLAI2
 
Introduction to Mahout
Introduction to MahoutIntroduction to Mahout
Introduction to Mahout
Ted Dunning
 
Modeling and Solving Resource-Constrained Project Scheduling Problems with IB...
Modeling and Solving Resource-Constrained Project Scheduling Problems with IB...Modeling and Solving Resource-Constrained Project Scheduling Problems with IB...
Modeling and Solving Resource-Constrained Project Scheduling Problems with IB...
Philippe Laborie
 
Low power & area efficient carry select adder
Low power & area efficient carry select adderLow power & area efficient carry select adder
Low power & area efficient carry select adder
Sai Vara Prasad P
 
Object Detection & Machine Learning Paper
 Object Detection & Machine Learning Paper Object Detection & Machine Learning Paper
Object Detection & Machine Learning Paper
Joseph Mogannam
 
Distributed Keyword Search over RDF via MapReduce
Distributed Keyword Search over RDF via MapReduceDistributed Keyword Search over RDF via MapReduce
Distributed Keyword Search over RDF via MapReduce
Antonio Maccioni
 
03 hdrf presentation
03 hdrf presentation03 hdrf presentation
03 hdrf presentation
AndreaCingolani
 
G-TAD: Sub-Graph Localization for Temporal Action Detection
G-TAD: Sub-Graph Localization for Temporal Action DetectionG-TAD: Sub-Graph Localization for Temporal Action Detection
G-TAD: Sub-Graph Localization for Temporal Action Detection
Mengmeng Xu
 
EFFINET - Initial Presentation
EFFINET - Initial PresentationEFFINET - Initial Presentation
EFFINET - Initial Presentation
Pantelis Sopasakis
 
High efficient carry skip adder in various multiplier structures
High efficient carry skip adder in various multiplier structuresHigh efficient carry skip adder in various multiplier structures
High efficient carry skip adder in various multiplier structures
Iaetsd Iaetsd
 
L5 Adders
L5 AddersL5 Adders
L5 Adders
ankitgoel
 
Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Pr...
Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Pr...Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Pr...
Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Pr...
MLAI2
 
Lgm saarbrucken
Lgm saarbruckenLgm saarbrucken
Lgm saarbrucken
Yasuo Tabei
 
Implementation of Low Power and Area Efficient Carry Select Adder
Implementation of Low Power and Area Efficient Carry Select AdderImplementation of Low Power and Area Efficient Carry Select Adder
Implementation of Low Power and Area Efficient Carry Select Adder
inventionjournals
 
Pretzel: optimized Machine Learning framework for low-latency and high throug...
Pretzel: optimized Machine Learning framework for low-latency and high throug...Pretzel: optimized Machine Learning framework for low-latency and high throug...
Pretzel: optimized Machine Learning framework for low-latency and high throug...
NECST Lab @ Politecnico di Milano
 
An introduction to CP Optimizer
An introduction to CP OptimizerAn introduction to CP Optimizer
An introduction to CP Optimizer
Philippe Laborie
 

What's hot (20)

CP Optimizer Walkthrough
CP Optimizer WalkthroughCP Optimizer Walkthrough
CP Optimizer Walkthrough
 
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three ProblemsIBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
 
Day 5 application of graph ,biconnectivity fdp on ds
Day 5 application of graph ,biconnectivity fdp on dsDay 5 application of graph ,biconnectivity fdp on ds
Day 5 application of graph ,biconnectivity fdp on ds
 
CHI 2014 talk by Antti Oulasvirta: Automated Nonlinear Regression Modeling fo...
CHI 2014 talk by Antti Oulasvirta: Automated Nonlinear Regression Modeling fo...CHI 2014 talk by Antti Oulasvirta: Automated Nonlinear Regression Modeling fo...
CHI 2014 talk by Antti Oulasvirta: Automated Nonlinear Regression Modeling fo...
 
Accurate Learning of Graph Representations with Graph Multiset Pooling
Accurate Learning of Graph Representations with Graph Multiset PoolingAccurate Learning of Graph Representations with Graph Multiset Pooling
Accurate Learning of Graph Representations with Graph Multiset Pooling
 
Introduction to Mahout
Introduction to MahoutIntroduction to Mahout
Introduction to Mahout
 
Modeling and Solving Resource-Constrained Project Scheduling Problems with IB...
Modeling and Solving Resource-Constrained Project Scheduling Problems with IB...Modeling and Solving Resource-Constrained Project Scheduling Problems with IB...
Modeling and Solving Resource-Constrained Project Scheduling Problems with IB...
 
Low power & area efficient carry select adder
Low power & area efficient carry select adderLow power & area efficient carry select adder
Low power & area efficient carry select adder
 
Object Detection & Machine Learning Paper
 Object Detection & Machine Learning Paper Object Detection & Machine Learning Paper
Object Detection & Machine Learning Paper
 
Distributed Keyword Search over RDF via MapReduce
Distributed Keyword Search over RDF via MapReduceDistributed Keyword Search over RDF via MapReduce
Distributed Keyword Search over RDF via MapReduce
 
03 hdrf presentation
03 hdrf presentation03 hdrf presentation
03 hdrf presentation
 
G-TAD: Sub-Graph Localization for Temporal Action Detection
G-TAD: Sub-Graph Localization for Temporal Action DetectionG-TAD: Sub-Graph Localization for Temporal Action Detection
G-TAD: Sub-Graph Localization for Temporal Action Detection
 
EFFINET - Initial Presentation
EFFINET - Initial PresentationEFFINET - Initial Presentation
EFFINET - Initial Presentation
 
High efficient carry skip adder in various multiplier structures
High efficient carry skip adder in various multiplier structuresHigh efficient carry skip adder in various multiplier structures
High efficient carry skip adder in various multiplier structures
 
L5 Adders
L5 AddersL5 Adders
L5 Adders
 
Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Pr...
Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Pr...Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Pr...
Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Pr...
 
Lgm saarbrucken
Lgm saarbruckenLgm saarbrucken
Lgm saarbrucken
 
Implementation of Low Power and Area Efficient Carry Select Adder
Implementation of Low Power and Area Efficient Carry Select AdderImplementation of Low Power and Area Efficient Carry Select Adder
Implementation of Low Power and Area Efficient Carry Select Adder
 
Pretzel: optimized Machine Learning framework for low-latency and high throug...
Pretzel: optimized Machine Learning framework for low-latency and high throug...Pretzel: optimized Machine Learning framework for low-latency and high throug...
Pretzel: optimized Machine Learning framework for low-latency and high throug...
 
An introduction to CP Optimizer
An introduction to CP OptimizerAn introduction to CP Optimizer
An introduction to CP Optimizer
 

Similar to Planning Evacuation Routes with the P-graph Framework

CFD Cornell Energy Workshop - M.F. Campuzano Ochoa
CFD Cornell Energy Workshop - M.F. Campuzano OchoaCFD Cornell Energy Workshop - M.F. Campuzano Ochoa
CFD Cornell Energy Workshop - M.F. Campuzano Ochoa
Mario Felipe Campuzano Ochoa
 
Применение машинного обучения для навигации и управления роботами
Применение машинного обучения для навигации и управления роботамиПрименение машинного обучения для навигации и управления роботами
Применение машинного обучения для навигации и управления роботами
Skolkovo Robotics Center
 
Aggregate Computing Platforms: Bridging the Gaps
Aggregate Computing Platforms: Bridging the GapsAggregate Computing Platforms: Bridging the Gaps
Aggregate Computing Platforms: Bridging the Gaps
Roberto Casadei
 
pam_1997
pam_1997pam_1997
pam_1997
Jacek Marczyk
 
Reducing Structural Bias in Technology Mapping
Reducing Structural Bias in Technology MappingReducing Structural Bias in Technology Mapping
Reducing Structural Bias in Technology Mapping
satrajit
 
Thesis+of+étienne+duclos.ppt
Thesis+of+étienne+duclos.pptThesis+of+étienne+duclos.ppt
Thesis+of+étienne+duclos.ppt
Ptidej Team
 
Efficient Design Exploration for Civil Aircraft Using a Kriging-Based Genetic...
Efficient Design Exploration for Civil Aircraft Using a Kriging-Based Genetic...Efficient Design Exploration for Civil Aircraft Using a Kriging-Based Genetic...
Efficient Design Exploration for Civil Aircraft Using a Kriging-Based Genetic...
Masahiro Kanazaki
 
Software tookits for machine learning and graphical models
Software tookits for machine learning and graphical modelsSoftware tookits for machine learning and graphical models
Software tookits for machine learning and graphical models
butest
 
Overlapping community detection in Large-Scale Networks using BigCLAM model b...
Overlapping community detection in Large-Scale Networks using BigCLAM model b...Overlapping community detection in Large-Scale Networks using BigCLAM model b...
Overlapping community detection in Large-Scale Networks using BigCLAM model b...
Thang Nguyen
 
Simulation Watch Window.pdf
Simulation Watch Window.pdfSimulation Watch Window.pdf
Simulation Watch Window.pdf
Brij Consulting, LLC
 
Graph Matching
Graph MatchingGraph Matching
Graph Matching
graphitech
 
Simulation Watch Window Parts I,II,III.pdf
Simulation Watch Window Parts I,II,III.pdfSimulation Watch Window Parts I,II,III.pdf
Simulation Watch Window Parts I,II,III.pdf
Brij Consulting, LLC
 
Portofolio Control Version SN
Portofolio Control Version SNPortofolio Control Version SN
Portofolio Control Version SN
Samuel Narcisse
 
Real time traffic management - challenges and solutions
Real time traffic management - challenges and solutionsReal time traffic management - challenges and solutions
Real time traffic management - challenges and solutions
Institute for Transport Studies (ITS)
 
CLIM: Transition Workshop - Statistical Emulation with Dimension Reduction fo...
CLIM: Transition Workshop - Statistical Emulation with Dimension Reduction fo...CLIM: Transition Workshop - Statistical Emulation with Dimension Reduction fo...
CLIM: Transition Workshop - Statistical Emulation with Dimension Reduction fo...
The Statistical and Applied Mathematical Sciences Institute
 
Relief Clipping Planes (SIGGRAPH ASIA 2008)
Relief Clipping Planes (SIGGRAPH ASIA 2008)Relief Clipping Planes (SIGGRAPH ASIA 2008)
Relief Clipping Planes (SIGGRAPH ASIA 2008)
Matthias Trapp
 
critico planilla de analisis para poder desarrolar proyectos.pdf
critico planilla de analisis para poder desarrolar proyectos.pdfcritico planilla de analisis para poder desarrolar proyectos.pdf
critico planilla de analisis para poder desarrolar proyectos.pdf
Alan Steeven Suárez Quimí
 
R studio
R studio R studio
R studio
Kinza Irshad
 
Lecture16 xing
Lecture16 xingLecture16 xing
Lecture16 xing
Tianlu Wang
 
Arev05c icfca05lessonslearned
Arev05c icfca05lessonslearnedArev05c icfca05lessonslearned
Arev05c icfca05lessonslearned
Ahmed Mohamed
 

Similar to Planning Evacuation Routes with the P-graph Framework (20)

CFD Cornell Energy Workshop - M.F. Campuzano Ochoa
CFD Cornell Energy Workshop - M.F. Campuzano OchoaCFD Cornell Energy Workshop - M.F. Campuzano Ochoa
CFD Cornell Energy Workshop - M.F. Campuzano Ochoa
 
Применение машинного обучения для навигации и управления роботами
Применение машинного обучения для навигации и управления роботамиПрименение машинного обучения для навигации и управления роботами
Применение машинного обучения для навигации и управления роботами
 
Aggregate Computing Platforms: Bridging the Gaps
Aggregate Computing Platforms: Bridging the GapsAggregate Computing Platforms: Bridging the Gaps
Aggregate Computing Platforms: Bridging the Gaps
 
pam_1997
pam_1997pam_1997
pam_1997
 
Reducing Structural Bias in Technology Mapping
Reducing Structural Bias in Technology MappingReducing Structural Bias in Technology Mapping
Reducing Structural Bias in Technology Mapping
 
Thesis+of+étienne+duclos.ppt
Thesis+of+étienne+duclos.pptThesis+of+étienne+duclos.ppt
Thesis+of+étienne+duclos.ppt
 
Efficient Design Exploration for Civil Aircraft Using a Kriging-Based Genetic...
Efficient Design Exploration for Civil Aircraft Using a Kriging-Based Genetic...Efficient Design Exploration for Civil Aircraft Using a Kriging-Based Genetic...
Efficient Design Exploration for Civil Aircraft Using a Kriging-Based Genetic...
 
Software tookits for machine learning and graphical models
Software tookits for machine learning and graphical modelsSoftware tookits for machine learning and graphical models
Software tookits for machine learning and graphical models
 
Overlapping community detection in Large-Scale Networks using BigCLAM model b...
Overlapping community detection in Large-Scale Networks using BigCLAM model b...Overlapping community detection in Large-Scale Networks using BigCLAM model b...
Overlapping community detection in Large-Scale Networks using BigCLAM model b...
 
Simulation Watch Window.pdf
Simulation Watch Window.pdfSimulation Watch Window.pdf
Simulation Watch Window.pdf
 
Graph Matching
Graph MatchingGraph Matching
Graph Matching
 
Simulation Watch Window Parts I,II,III.pdf
Simulation Watch Window Parts I,II,III.pdfSimulation Watch Window Parts I,II,III.pdf
Simulation Watch Window Parts I,II,III.pdf
 
Portofolio Control Version SN
Portofolio Control Version SNPortofolio Control Version SN
Portofolio Control Version SN
 
Real time traffic management - challenges and solutions
Real time traffic management - challenges and solutionsReal time traffic management - challenges and solutions
Real time traffic management - challenges and solutions
 
CLIM: Transition Workshop - Statistical Emulation with Dimension Reduction fo...
CLIM: Transition Workshop - Statistical Emulation with Dimension Reduction fo...CLIM: Transition Workshop - Statistical Emulation with Dimension Reduction fo...
CLIM: Transition Workshop - Statistical Emulation with Dimension Reduction fo...
 
Relief Clipping Planes (SIGGRAPH ASIA 2008)
Relief Clipping Planes (SIGGRAPH ASIA 2008)Relief Clipping Planes (SIGGRAPH ASIA 2008)
Relief Clipping Planes (SIGGRAPH ASIA 2008)
 
critico planilla de analisis para poder desarrolar proyectos.pdf
critico planilla de analisis para poder desarrolar proyectos.pdfcritico planilla de analisis para poder desarrolar proyectos.pdf
critico planilla de analisis para poder desarrolar proyectos.pdf
 
R studio
R studio R studio
R studio
 
Lecture16 xing
Lecture16 xingLecture16 xing
Lecture16 xing
 
Arev05c icfca05lessonslearned
Arev05c icfca05lessonslearnedArev05c icfca05lessonslearned
Arev05c icfca05lessonslearned
 

More from Juan Carlos García Ojeda

Enlace esteganografia
Enlace esteganografiaEnlace esteganografia
Enlace esteganografia
Juan Carlos García Ojeda
 
Discrecional Aprendizaje de Máquin Cádula Impar
Discrecional Aprendizaje de Máquin Cádula ImparDiscrecional Aprendizaje de Máquin Cádula Impar
Discrecional Aprendizaje de Máquin Cádula Impar
Juan Carlos García Ojeda
 
Discrecional Aprendizaje de Máquinas Cedula Par
Discrecional Aprendizaje de Máquinas Cedula ParDiscrecional Aprendizaje de Máquinas Cedula Par
Discrecional Aprendizaje de Máquinas Cedula Par
Juan Carlos García Ojeda
 
Exercicio k means
Exercicio k meansExercicio k means
Exercicio k means
Juan Carlos García Ojeda
 
Segundo parcialsimulacro
Segundo parcialsimulacroSegundo parcialsimulacro
Segundo parcialsimulacro
Juan Carlos García Ojeda
 
Taller Aprendizaje M´squina
Taller Aprendizaje M´squinaTaller Aprendizaje M´squina
Taller Aprendizaje M´squina
Juan Carlos García Ojeda
 
Solucion bano unisex
Solucion bano unisexSolucion bano unisex
Solucion bano unisex
Juan Carlos García Ojeda
 
Ejercicio sincronización
Ejercicio sincronizaciónEjercicio sincronización
Ejercicio sincronización
Juan Carlos García Ojeda
 
Sistemas Multiagente
Sistemas MultiagenteSistemas Multiagente
Sistemas Multiagente
Juan Carlos García Ojeda
 
Hilos semaforos
Hilos semaforosHilos semaforos
Hilos semaforos
Juan Carlos García Ojeda
 
Ejercicio ID3 Datos Numericos
Ejercicio ID3 Datos NumericosEjercicio ID3 Datos Numericos
Ejercicio ID3 Datos Numericos
Juan Carlos García Ojeda
 
Mineríade datos
Mineríade datosMineríade datos
Mineríade datos
Juan Carlos García Ojeda
 
1. introducción a Agentes
1. introducción a Agentes1. introducción a Agentes
1. introducción a Agentes
Juan Carlos García Ojeda
 

More from Juan Carlos García Ojeda (13)

Enlace esteganografia
Enlace esteganografiaEnlace esteganografia
Enlace esteganografia
 
Discrecional Aprendizaje de Máquin Cádula Impar
Discrecional Aprendizaje de Máquin Cádula ImparDiscrecional Aprendizaje de Máquin Cádula Impar
Discrecional Aprendizaje de Máquin Cádula Impar
 
Discrecional Aprendizaje de Máquinas Cedula Par
Discrecional Aprendizaje de Máquinas Cedula ParDiscrecional Aprendizaje de Máquinas Cedula Par
Discrecional Aprendizaje de Máquinas Cedula Par
 
Exercicio k means
Exercicio k meansExercicio k means
Exercicio k means
 
Segundo parcialsimulacro
Segundo parcialsimulacroSegundo parcialsimulacro
Segundo parcialsimulacro
 
Taller Aprendizaje M´squina
Taller Aprendizaje M´squinaTaller Aprendizaje M´squina
Taller Aprendizaje M´squina
 
Solucion bano unisex
Solucion bano unisexSolucion bano unisex
Solucion bano unisex
 
Ejercicio sincronización
Ejercicio sincronizaciónEjercicio sincronización
Ejercicio sincronización
 
Sistemas Multiagente
Sistemas MultiagenteSistemas Multiagente
Sistemas Multiagente
 
Hilos semaforos
Hilos semaforosHilos semaforos
Hilos semaforos
 
Ejercicio ID3 Datos Numericos
Ejercicio ID3 Datos NumericosEjercicio ID3 Datos Numericos
Ejercicio ID3 Datos Numericos
 
Mineríade datos
Mineríade datosMineríade datos
Mineríade datos
 
1. introducción a Agentes
1. introducción a Agentes1. introducción a Agentes
1. introducción a Agentes
 

Recently uploaded

NATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENT
NATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENTNATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENT
NATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENT
Addu25809
 
学校原版美国波士顿大学毕业证学历学位证书原版一模一样
学校原版美国波士顿大学毕业证学历学位证书原版一模一样学校原版美国波士顿大学毕业证学历学位证书原版一模一样
学校原版美国波士顿大学毕业证学历学位证书原版一模一样
171ticu
 
LLM Fine Tuning with QLoRA Cassandra Lunch 4, presented by Anant
LLM Fine Tuning with QLoRA Cassandra Lunch 4, presented by AnantLLM Fine Tuning with QLoRA Cassandra Lunch 4, presented by Anant
LLM Fine Tuning with QLoRA Cassandra Lunch 4, presented by Anant
Anant Corporation
 
Computational Engineering IITH Presentation
Computational Engineering IITH PresentationComputational Engineering IITH Presentation
Computational Engineering IITH Presentation
co23btech11018
 
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
shadow0702a
 
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTCHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
jpsjournal1
 
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
ecqow
 
Textile Chemical Processing and Dyeing.pdf
Textile Chemical Processing and Dyeing.pdfTextile Chemical Processing and Dyeing.pdf
Textile Chemical Processing and Dyeing.pdf
NazakatAliKhoso2
 
Material for memory and display system h
Material for memory and display system hMaterial for memory and display system h
Material for memory and display system h
gowrishankartb2005
 
Understanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine LearningUnderstanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine Learning
SUTEJAS
 
官方认证美国密歇根州立大学毕业证学位证书原版一模一样
官方认证美国密歇根州立大学毕业证学位证书原版一模一样官方认证美国密歇根州立大学毕业证学位证书原版一模一样
官方认证美国密歇根州立大学毕业证学位证书原版一模一样
171ticu
 
Embedded machine learning-based road conditions and driving behavior monitoring
Embedded machine learning-based road conditions and driving behavior monitoringEmbedded machine learning-based road conditions and driving behavior monitoring
Embedded machine learning-based road conditions and driving behavior monitoring
IJECEIAES
 
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesHarnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Christina Lin
 
john krisinger-the science and history of the alcoholic beverage.pptx
john krisinger-the science and history of the alcoholic beverage.pptxjohn krisinger-the science and history of the alcoholic beverage.pptx
john krisinger-the science and history of the alcoholic beverage.pptx
Madan Karki
 
Curve Fitting in Numerical Methods Regression
Curve Fitting in Numerical Methods RegressionCurve Fitting in Numerical Methods Regression
Curve Fitting in Numerical Methods Regression
Nada Hikmah
 
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
Yasser Mahgoub
 
Certificates - Mahmoud Mohamed Moursi Ahmed
Certificates - Mahmoud Mohamed Moursi AhmedCertificates - Mahmoud Mohamed Moursi Ahmed
Certificates - Mahmoud Mohamed Moursi Ahmed
Mahmoud Morsy
 
ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024
Rahul
 
Introduction to AI Safety (public presentation).pptx
Introduction to AI Safety (public presentation).pptxIntroduction to AI Safety (public presentation).pptx
Introduction to AI Safety (public presentation).pptx
MiscAnnoy1
 
spirit beverages ppt without graphics.pptx
spirit beverages ppt without graphics.pptxspirit beverages ppt without graphics.pptx
spirit beverages ppt without graphics.pptx
Madan Karki
 

Recently uploaded (20)

NATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENT
NATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENTNATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENT
NATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENT
 
学校原版美国波士顿大学毕业证学历学位证书原版一模一样
学校原版美国波士顿大学毕业证学历学位证书原版一模一样学校原版美国波士顿大学毕业证学历学位证书原版一模一样
学校原版美国波士顿大学毕业证学历学位证书原版一模一样
 
LLM Fine Tuning with QLoRA Cassandra Lunch 4, presented by Anant
LLM Fine Tuning with QLoRA Cassandra Lunch 4, presented by AnantLLM Fine Tuning with QLoRA Cassandra Lunch 4, presented by Anant
LLM Fine Tuning with QLoRA Cassandra Lunch 4, presented by Anant
 
Computational Engineering IITH Presentation
Computational Engineering IITH PresentationComputational Engineering IITH Presentation
Computational Engineering IITH Presentation
 
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
 
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTCHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
 
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
 
Textile Chemical Processing and Dyeing.pdf
Textile Chemical Processing and Dyeing.pdfTextile Chemical Processing and Dyeing.pdf
Textile Chemical Processing and Dyeing.pdf
 
Material for memory and display system h
Material for memory and display system hMaterial for memory and display system h
Material for memory and display system h
 
Understanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine LearningUnderstanding Inductive Bias in Machine Learning
Understanding Inductive Bias in Machine Learning
 
官方认证美国密歇根州立大学毕业证学位证书原版一模一样
官方认证美国密歇根州立大学毕业证学位证书原版一模一样官方认证美国密歇根州立大学毕业证学位证书原版一模一样
官方认证美国密歇根州立大学毕业证学位证书原版一模一样
 
Embedded machine learning-based road conditions and driving behavior monitoring
Embedded machine learning-based road conditions and driving behavior monitoringEmbedded machine learning-based road conditions and driving behavior monitoring
Embedded machine learning-based road conditions and driving behavior monitoring
 
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesHarnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
 
john krisinger-the science and history of the alcoholic beverage.pptx
john krisinger-the science and history of the alcoholic beverage.pptxjohn krisinger-the science and history of the alcoholic beverage.pptx
john krisinger-the science and history of the alcoholic beverage.pptx
 
Curve Fitting in Numerical Methods Regression
Curve Fitting in Numerical Methods RegressionCurve Fitting in Numerical Methods Regression
Curve Fitting in Numerical Methods Regression
 
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
 
Certificates - Mahmoud Mohamed Moursi Ahmed
Certificates - Mahmoud Mohamed Moursi AhmedCertificates - Mahmoud Mohamed Moursi Ahmed
Certificates - Mahmoud Mohamed Moursi Ahmed
 
ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024
 
Introduction to AI Safety (public presentation).pptx
Introduction to AI Safety (public presentation).pptxIntroduction to AI Safety (public presentation).pptx
Introduction to AI Safety (public presentation).pptx
 
spirit beverages ppt without graphics.pptx
spirit beverages ppt without graphics.pptxspirit beverages ppt without graphics.pptx
spirit beverages ppt without graphics.pptx
 

Planning Evacuation Routes with the P-graph Framework

  • 1. Planning Evacuation Routes with the P- graph Framework Juan C. Garcia-Ojeda*, Botond Bertok, Ferenc Friedler, and Mate Hegyhati University of Pannonia, Veszprém, Hungary * Autonomous University of Bucaramanga, Colombia PRES 2012 August 25-29, 2012 Prague, Czech Republic
  • 2. OutlineOutline  Evacuation route planning problem  Illustrative example  Process-network synthesis (PNS) by P-graph framework  Evacuation route planning by process-network synthesis  Results and discusion 2www.p-graph.com
  • 3. Evacuation Route PlanningEvacuation Route Planning ProblemProblem  Aim is to ensure safest and fastest movement of individuals away from any threat (e.g., bomb threat, taking of hostages) or the actual occurrence of a hazard (e.g., traffic, industrial, or nuclear accidents; natural disasters, fire, viral outbreak) /Stringfield, 1996/ www.p-graph.com 3
  • 4. Evacuation Route PlanningEvacuation Route Planning Problem (Cont’d)Problem (Cont’d)  Evacuation plans lack flexibility. This may lead individuals into dangerous situations (e.g., blocked exits, or spaces with gas leakage) /NFPA, 1996; Pu and Zlatanova, 2005/  Optimization software for supporting human decisions is essential /Cova and Johnson, 2003; Dimakis et al., 2010; Pu and Zlatanova, 2005/  Optimal or near optimal evacuation plan may imply the evaluation of a myriad of evacuation routes because of the combinatorial nature of the problem /Cova and Johnson, 2003; Hamacher and Tjandra, 2002; Kim et al., 2008/ www.p-graph.com 4
  • 5. Evacuation Route Planning:Evacuation Route Planning: Illustrative ExampleIllustrative Example www.p-graph.com 5 Room A: 3/5 Room B: 4/8 Room C: 3/20 Number of evacuees / Room capacity Door AC: 2/1 Door BC: 2/1 Door BO: 3/2 Outside: safe area Door AB: 2/1 Door CO: 2/1 Door capacity: evacuees / time unit Question: Evacuation plan Given: Floor map
  • 6. Process-Network Synthesis:Process-Network Synthesis: Problem DefinitionProblem Definition  Inputs:  A set P of demands to be satisfied  A set R of resources (available)  A set O of potential activities (manufacturing, transportation, etc.)  Cost data and capacity constraints  Output:  A ranked list of the n-best networks 6www.p-graph.com
  • 7.  Optimization Methodology  „P-graph framework” (F. Friedler & L.T. Fan, 1990)  Algorithmic model generation (MIP) Process-Network SynthesisProcess-Network Synthesis 7 Problem Generation of the Mathematical Model Solver Mathematical model Solution 7www.p-graph.com
  • 8. P-graph FrameworkP-graph Framework (F. Friedler & L. T. Fan, 1990)(F. Friedler & L. T. Fan, 1990)  Three cornerstones of the P-graph Framework  Structural representation: P-graph  Axioms of the combinatorially feasible process networks  Algorithms for - Generating the rigorous superstructure - Generating the combinatorially feasible process structures - Generating optimal or n-best networks 8www.p-graph.com
  • 9. P-graph Framework:P-graph Framework: Structural RepresentationStructural Representation  Unambiguous representation of structural properties Process element P-graph representation Resource or precursor Final target Intermediate entity Activity 9www.p-graph.com
  • 10. P-graph Framework:P-graph Framework: Structural Representation (Cont’d)Structural Representation (Cont’d)  Bipartite graph Activities Inputs and outputs (entities) Input: Resources or precondition mj Output: Effect or target Activity Oi 10www.p-graph.com
  • 11. P-graph Framework:P-graph Framework: Structural Representation (Cont’d)Structural Representation (Cont’d)  Clear logical interpretation Each precondition (E AND F) has to be satisfied to operate an activity (O2) Any of the activities (O2 OR O3) having the same effect can potentially be sufficient to initiate the consecutive step (O1) OR AND 11www.p-graph.com
  • 12. Axioms of Combinatorialy Feasible ProcessAxioms of Combinatorialy Feasible Process Structures (Friedler et al., 1992)Structures (Friedler et al., 1992) (S1) Every final target is represented in the structure. (S2) An entity represented in the structure has no input to if and only if it represents a precursor. (S3) Every activity represented in the structure is defined in the synthesis problem. (S4) Any activity represented in the structure has at least one path leading to a final target. (S5) If an entity belongs to the structure, it must be an activating entity to or resulting entity from at least one activity represented in the structure. 12www.p-graph.com
  • 13. P-graph Framework:P-graph Framework: Reduction of the Search SpaceReduction of the Search Space Feasible structures Search Space Combinatorially feasible structures Optimal structure 2nd best structure 3rd best structure 13www.p-graph.com
  • 14. P-graph Framework: AlgorithmsP-graph Framework: Algorithms (Friedler et al., 1992, 1993, 1995)(Friedler et al., 1992, 1993, 1995)  Algorithm MSG (Maximal Structure Generation) generates the rigorous superstructure: the union of the combinatorially feasible structures.  Algorithm SSG (Solution-Structure Generator) generates each combinatorially feasible structure exactly once.  Algorithm ABB (Accelerated Branch and Bound) generates the n-best solutions of the problem while the search space is reduced to the set of combinatorially feasible structures. 14www.p-graph.com
  • 15. Problem Definition:Problem Definition: Software PNS-DrawSoftware PNS-Draw 15www.p-graph.com
  • 16. Problem Definition:Problem Definition: Software PNS-StudioSoftware PNS-Studio 16www.p-graph.com
  • 17. MINLP vs. P-graph FrameworkMINLP vs. P-graph Framework www.p-graph.com 17 MINLP P-graph framework Problem given by Variables, Constraints Resources, Targets, Potential activities Generation of the math. model Manual Automatic Structural properties of process-networks Hidden in the math. model Exploited Number of solutions Single Multiple Handling special constraints Can be incorporated to the math. model May require modifications of the model generator and solver
  • 18. Evacuation Route Planning byEvacuation Route Planning by Process-Network SynthesisProcess-Network Synthesis 18 PNS Problem P-graph Framework Solution 18www.p-graph.com Evacuation Route Planning Problem Model Transformation
  • 19. Process-Network Synthesis ProblemProcess-Network Synthesis Problem of the Building Evacuationof the Building Evacuation  Resources: Evacuees at their initial locations  Activities: Movement of evacuees  Targets: Evacuees at safe locations  Objective: As soon as possible www.p-graph.com 19
  • 20. Steps of Model TransformationSteps of Model Transformation 1. Transform floor map to P-graph representation 2. Estimate the time horizon (hazard spreading) 3. Determine the time unit 4. Multiplication of the graph of floor map for each time unit 5. Formulate PNS problem based on the time extended graph 6. Simplify the problem by algorithm MSG 7. Assign penalty more on later evacuations 8. Generate alternative evacuation plans by algorithm ABB www.p-graph.com 20
  • 21. Process-Network Synthesis ProblemProcess-Network Synthesis Problem of the Illustrative Exampleof the Illustrative Example  Resources:  Evacuees at their initial locations: A, B, C  Targets:  Evacuees outside the building at time 1, 2, 3…: - D1, D2, D3…  Activities:  Movement of evacuees at time 1, 2, 3…: - Leaving Room A at time 1 and arriving in Room B at time 2: A_B_1_2 …  Stay of evacuees at time 1, 2, 3…: - Staying in Room A from time 1 to time 2: A_A_1_2 … www.p-graph.com 21
  • 22. Process-Network Synthesis ProblemProcess-Network Synthesis Problem of the Illustrative Example (Cont’d)of the Illustrative Example (Cont’d) www.p-graph.com 22 Activity Precondition Result Upper bound A_A_0_1 A A_1 9 A_B_0_1 A B_1 2 A_C_0_1 A C_1 2 B_B_0_1 B B_1 8 B_C_0_1 B C_1 2 B_D_0_2 B D_2 2 C_C_0_1 C C_1 20 C_D_0_1 C D_1 2 A_A_1_2 A_1 A_2 5 A_C_1_2 A_1 C_2 2 B_C_1_2 B_1 C_2 2 B_D_1_3 B_1 D_3 3 C_C_1_2 C_2 C_3 20 C_D_1_2 C_1 D_2 2
  • 23. Maximal Structure for the IllustrativeMaximal Structure for the Illustrative Example Considering 3 Units of TimeExample Considering 3 Units of Time www.p-graph.com 23 Time 1 Time 2 D_1 Time 3 Room A Room B Room C Outside Stay Move
  • 24. Solution #1 provided by Algorithm ABBSolution #1 provided by Algorithm ABB www.p-graph.com 24 Time 0  Time 1     Time 2      Time 3   
  • 25. Solution #2 provided by Algorithm ABBSolution #2 provided by Algorithm ABB www.p-graph.com 25 Time 0  Time 1     Time 2      Time 3    
  • 26. Solution #3 provided by Algorithm ABBSolution #3 provided by Algorithm ABB www.p-graph.com 26 Time 0  Time 1     Time 2      Time 3    
  • 27. Solution #4 provided by Algorithm ABBSolution #4 provided by Algorithm ABB www.p-graph.com 27 Time 0  Time 1    Time 2      Time 3   
  • 28. Concluding RemarksConcluding Remarks  Evacuation Route Planning Problem can be converted to PNS problem and solved by the P- graph framework  P-graph software generates optimal and n-best alternative evacuation plan  Alternative evacuation plans can be evaluated by in-depth analysis  P-graph software is available from p-graph.com  The computational time required is typically a few seconds or minutes 28www.p-graph.com
  • 29. AcknowledgementAcknowledgement Authors acknowledge the support of the Hungarian Research Fund under project OTKA 81493 K. 29www.p-graph.com
  • 30. Call for PartitipationCall for Partitipation Veszprém Optimization Conference: Advanced Algorithms 11-14 December, 2012 University of Pannonia, Veszprém, Hungary Deadline for Abstract Submission: September 17, 2012 http://vocal.dcs.vein.hu 30www.p-graph.com
  • 31. Thank you for your attention!Thank you for your attention!