scholarly journals Rebirthing genetic algorithm for storm sewer network design

2012 ◽  
Vol 19 (1) ◽  
pp. 11-19 ◽  
Author(s):  
M.H. Afshar
2011 ◽  
Vol 64 (1) ◽  
pp. 247-254 ◽  
Author(s):  
S. A. Sun ◽  
S. Djordjević ◽  
S. T. Khu

It is widely recognised that flood risk needs to be taken into account when designing a storm sewer network. Flood risk is generally a combination of flood consequences and flood probabilities. This paper aims to explore the decision making in flood risk based storm sewer network design. A multi-objective optimization is proposed to find the Pareto front of optimal designs in terms of low construction cost and low flood risk. The decision making process then follows this multi-objective optimization to select a best design from the Pareto front. The traditional way of designing a storm sewer system based on a predefined design storm is used as one of the decision making criteria. Additionally, three commonly used risk based criteria, i.e., the expected flood risk based criterion, the Hurwicz criterion and the stochastic dominance based criterion, are investigated and applied in this paper. Different decisions are made according to different criteria as a result of different concerns represented by the criteria. The proposed procedure is applied to a simple storm sewer network design to demonstrate its effectiveness and the different criteria are compared.


Water ◽  
2017 ◽  
Vol 9 (10) ◽  
pp. 747 ◽  
Author(s):  
Zhiyu Shao ◽  
Xiaoyuan Zhang ◽  
Shuang Li ◽  
Shihu Deng ◽  
Hongxiang Chai

2011 ◽  
Vol 8 (1) ◽  
pp. 13-27 ◽  
Author(s):  
Si'Ao Sun ◽  
Slobodan Djordjević ◽  
Soon-Thiam Khu

2015 ◽  
Vol 33 ◽  
pp. 150-169 ◽  
Author(s):  
Carlos E. Andrade ◽  
Mauricio G.C. Resende ◽  
Weiyi Zhang ◽  
Rakesh K. Sinha ◽  
Kenneth C. Reichmann ◽  
...  

2021 ◽  
Author(s):  
Ovidiu Cosma ◽  
Petrică C Pop ◽  
Cosmin Sabo

Abstract In this paper we investigate a particular two-stage supply chain network design problem with fixed costs. In order to solve this complex optimization problem, we propose an efficient hybrid algorithm, which was obtained by incorporating a linear programming optimization problem within the framework of a genetic algorithm. In addition, we integrated within our proposed algorithm a powerful local search procedure able to perform a fine tuning of the global search. We evaluate our proposed solution approach on a set of large size instances. The achieved computational results prove the efficiency of our hybrid genetic algorithm in providing high-quality solutions within reasonable running-times and its superiority against other existing methods from the literature.


Sign in / Sign up

Export Citation Format

Share Document