2003
DOI: 10.1021/ie020586t
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Solution Approaches for the Multifloor Process Plant Layout Problem

Abstract: In this paper, two novel efficient solution approaches for the multifloor process plant layout problem are presented. The first one is a rigorous decomposition approach, and the second one is based on an iterative solution scheme. Both approaches, which are based on integer linear programming models, determine the number of floors, land area, floor allocation of each equipment item, and detailed layout for each floor. Their applicability is finally demonstrated by five illustrative examples.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0
1

Year Published

2008
2008
2024
2024

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 35 publications
(27 citation statements)
references
References 25 publications
0
26
0
1
Order By: Relevance
“…Papageorgiou & Rotstein extended this model to consider a continuous domain single floor MILP model (Papageorgiou and Rotstein, 1998). Patsiatzis & Papageorgiou then extended it further to multi floor (Patsiatzis and Papageorgiou, 2002a) and developed a decomposition and an iterative approach (Patsiatzis and Papageorgiou, 2003). The decomposition approach is largely more accurate and expensive in processing time, while the iterative approach is the reverse.…”
Section: Mathematical Programming Approachesmentioning
confidence: 99%
“…Papageorgiou & Rotstein extended this model to consider a continuous domain single floor MILP model (Papageorgiou and Rotstein, 1998). Patsiatzis & Papageorgiou then extended it further to multi floor (Patsiatzis and Papageorgiou, 2002a) and developed a decomposition and an iterative approach (Patsiatzis and Papageorgiou, 2003). The decomposition approach is largely more accurate and expensive in processing time, while the iterative approach is the reverse.…”
Section: Mathematical Programming Approachesmentioning
confidence: 99%
“…It is known that pressure and velocity of each branch pipeline are respectively equal at branch points by the fluid continuity property. For the branch point 1 and the branch i at branch point 1, the following equation can be obtained by equation (2), (4) and the relationship between fluid flow and fluid velocity.…”
Section: B Evaluation Model For Pipeline With Branches (Empb)mentioning
confidence: 99%
“…Generate the corresponding random sequence point according to Monte Carlo sampling model. 4. Map the random sequence points to the node and retain sampling.…”
Section: A the Monte Carlo Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…Previous simultaneous approaches were only able to solve layout problems having less than 11 units in reasonable computational times. Decomposition approaches (Patsiatzis and Papageorgiou, 2003), constructionbased methods (Xu and Papageorgiou, 2007) with improvement phases (Xu and Papageorgiou, 2009), and a number of evolutionary methods (Furuholmen et al, 2010, Kheirkhah et al, 2015, Nabavi et al, 2016, Park and Lee, 2015 have successfully addressed large-sized layout problems in shorter times, but globally optimal solutions are not guaranteed. Recently, more ecient multi-oor layout models were developed by Ejeh et al (2018a) incorporating connection, pumping, area-dependent land and oor construction costs in the layout design of process plants having tall equipment.…”
Section: Introductionmentioning
confidence: 99%