scholarly journals Firefighting Equipment Arrangement Optimization for an Offshore Platform Considering Travel Distances

2021 ◽  
Vol 9 (5) ◽  
pp. 503
Author(s):  
Byeong Cheol Lee ◽  
Youngsu Choi ◽  
Hyun Chung

The offshore plant, due to its characteristics, is subject to many restrictions on the material and design of the pipes. Because the design of the firefighting piping depends on the pre-set fire protection design, it is possible to reduce the cost of the piping design by optimizing the arrangement of the firefighting equipment. Existing studies have low accuracy in obtaining service areas under these conditions. In addition, the arrangement optimization problem is generally modeled as a set cover problem (SCP). However, except for the traditional greedy approximation, this problem is not well researched for general solutions. In this paper, first, a modified iterative-deepening search (MIDS), which accurately obtains a service area according to the travel distance in the grid space, is proposed before optimization. Additionally, this paper seeks to define a set cover problem by combining the subsets obtained by MIDS. Second, by using the traditional greedy algorithm, we obtained the initial arrangement of the firefighting equipment. Then, we proposed a method to obtain an approximate optimization solution using a modified greedy method including rearrangement. The validity of the proposed coverage area acquisition and arrangement optimization method is verified by comparing the performance with other algorithms. Finally, this study was applied to the drawings of an actual offshore platform.

2017 ◽  
Vol 689 ◽  
pp. 96-107 ◽  
Author(s):  
Stefan Dobrev ◽  
Jeff Edmonds ◽  
Dennis Komm ◽  
Rastislav Královič ◽  
Richard Královič ◽  
...  

1992 ◽  
Vol 114 (4) ◽  
pp. 524-531 ◽  
Author(s):  
J. S. Agapiou

The optimization problem for multistage machining systems has been investigated. Due to uneven time requirements at different stages in manufacturing, there could be idle times at various stations. It may be advantageous to reduce the values of machining parameters in order to reduce the cost at stations that require less machining time. However, optimization techniques available through the literature do not effectively utilize the idle time for the different stations generated during the balancing of the system. Proposed in this paper is an optimization method which utilizes the idle time to the full extent at all machining stations, with the intention of improving tool life and thus achieving cost reduction. The mathematical analysis considers the optimization of the production cost with an equality constraint of zero idle time for the stations with idle time. Physical constraints regarding the cutting parameters, force, power, surface finish, etc., as they arise in different operations, are also considered. The aforementioned problem has been theoretically analyzed and a computational algorithm developed. The advantages and effectiveness of the proposed approach are finally established through an example.


Author(s):  
Raghunath Reddy Madireddy ◽  
Subhas C. Nandy ◽  
Supantha Pandit

2010 ◽  
Vol 02 (01) ◽  
pp. 21-31 ◽  
Author(s):  
MARY V. ASHLEY ◽  
TANYA Y. BERGER-WOLF ◽  
WANPRACHA CHAOVALITWONGSE ◽  
BHASKAR DASGUPTA ◽  
ASHFAQ KHOKHAR ◽  
...  

In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary algorithms. An important subclass of such problems is the implicit set cover (or, equivalently, hitting set) problem in which the sets are not given explicitly but rather defined implicitly. For example, the well-known minimum feedback arc set problem is such a problem. In this paper, we consider such a cover problem that arises in the study of wild populations in biology in which the sets are defined implicitly via the Mendelian constraints and prove approximability results for this problem.


Sign in / Sign up

Export Citation Format

Share Document