Cascaded Connection Queuing Model of Urban Drainage System Layout and Its Optimization Algorithm
CSTR:
Author:
Clc Number:

N949

  • Article
  • | |
  • Metrics
  • |
  • Reference [21]
  • |
  • Related [20]
  • | | |
  • Comments
    Abstract:

    Considering spatial and temporal features of urban storms, a proper surface runoff coefficient is selected to measure the quantity of flowing water, which will be collected by inlets. The sequence of drainage consists of rainfall collecting, conveying and discharge through inlets, pipes and pumps respectively, referred to a cascade connection queuing system. According to their importance, an urban district is divided into several areas whose rainfall should be drained out within a restricted time determined by their importance. The time, as well as the cost of building and the operation of the urban drainage system (UDS), is set as constraints of a biobjective optimization model for the pump location problem. Then we develop an optimization algorithm, genetic algorithm integrated with Tabu algorithm, to solve this complex nonlinear allocation problem. A practical case study reveals that multiple cascaded connection queuing method can simulate the UDS well, and the quantity and location of pump stations, as well as storm recurrence period, plays an important role in designing an UDS.

    Reference
    [1]Quan R S. Rainstorm waterlogging risk assessment in central urban area of Shanghai based on multiple scenario simulation[J]. Natural Hazards, 2014, 73(3):1569-1585.
    [2]Du S, Gu H, Wen J, et al. Detecting flood variations in Shanghai over 1949–2009 with Mann-Kendall tests and a newspaper-based database[J]. Water, 2015, 7:1808-1824.
    [3]Chandio A S, Lee T S, Mirjat M S. Simulation of horizontal and vertical drainage systems to combat waterlogging problems along the Rohri Canal in Khairpur District, Pakistan[J]. American Society of Civil Engineers, 2013, 139(9):710-717.
    [4]Ke J C, Chang F M. M [x] /(G 1 , G 2 )/1 retrial queue under Bernoulli vacation schedules with general repeated attempts and starting failures[J]. Applied Mathematical Modelling, 2009, 33(7):3186-3196.
    [5]Boxma O J. On a Tandem Queueing Model with Identical Service Times at Both Counters, I[J]. Advances in Applied Probability, 1979, 11(3):644-659.
    [6]Filipe J A, Ferreira M A M. Infinite Servers Queue Systems Busy Period - A Practical Case on Logistics Problems Solving[J]. Applied Mathematical Sciences, 2015, 9(25):1221-1228.
    [7]Hajipour V, Khodakarami V, Tavana M. The redundancy queuing-location-allocation problem: A novel approach[J]. IEEE Transactions on Engineering Management, 2014, 61(3):534-544.
    [8]Singer M, Donoso P. Assessing an ambulance service with queuing theory[J]. Computers Operations Research, 2008, 35(8):2549-2560.
    [9]Silva F, Serra D. Locating emergency services with different priorities: the priority queuing covering location problem[J]. Journal of the Operational Research Society, 2008, 59(9):1229-1238.
    [10]胡丹丹, 杨超. 在竞争环境中的拥塞设施截流选址问题[J]. 系统工程理论与实践, 2010, 30(1):68-72.Hu D., Yang C. Flow interception location problem of congestion facilities in competitive system[J]. Systems Engineering-Theory Practice, 2010, 30(1):68-72.
    [11]Mohammadi M, Jolai F, Rostami H. An M/M/c queue model for hub covering location problem[J]. Mathematical Computer Modelling, 2011, 54(11-12):2623–2638.
    [12]Vidyarthi N, Jayaswal S. Efficient solution of a class of location–allocation problems with stochastic demand and congestion[J]. Computers Operations Research, 2014, 48(7):20–30.
    [13]Rahmati S H A, Ahmadi A, Sharifi M, et al. A multi-objective model for facility location-allocation problem with immobile servers within queuing framework[J]. Computers Industrial Engineering, 2014, 74:1-10.
    [14]Shavandi H, Mahlooji H. A fuzzy queuing location model with a genetic algorithm for congested systems[J]. Applied Mathematics Computation, 2006, 181(1):440–456.
    [15]Zahiri B, Tavakkoli-Moghaddam R, Mohammadi M, et al. Multi-objective design of an organ transplant network under uncertainty[J]. Transportation Research Part E: Logistics Transportation Review, 2014, 72(C):101–124.
    [16]Pasandideh S H R, Niaki S T A. Genetic application in a facility location problem with random demand within queuing framework[J]. Journal of Intelligent Manufacturing, 2012, 23(3):651-659.
    [17]Vahdani B, Tavakkoli-Moghaddam R, Jolai F. Reliable design of a logistics network under uncertainty: A fuzzy possibilistic-queuing model[J]. Applied Mathematical Modelling, 2013, 37(5):3254–3268.
    [18]翟盘茂,倪允琪,陈阳. 我国持续性重大天气异常成因与预报方法研究回顾与未来展望[J]. 地球科学进展. 2013, 28(11):177-188.Zhai P., Ni Y., Chen Y.. Mechanism and Forecasting Method of Persistent Extreme Weather Events: Review and Prospect[J]. Advances in Earth Science, 2013, 28(11):177-188.
    [19]陈红. 淮河流域夏季极端降水事件的统计预测模型研究[J]. 气候与环境研究. 2013, 18 (2): 221–231.CHEN H., Statistical prediction model for summer extreme precipitation events over Huaihe River valley[J]. Climatic and Environmental Research (in Chinese), 2013, 18 (2): 221–231.
    [20]陈兴旺, 广义极值分布理论在重现期计算的应用[J]. 气象与减灾研究, 2008, 31(4):52-55.CHEN X., Application of Generalized Extreme Value Distribution Theory in Calculating Return Periods[J]. METEOROLOGY AND DISASTER REDUCTION RESEARCH, 2008, 31(4):52-55.
    [21]Azadeh A, Moghaddam M, Asadzadeh S M, et al. An integrated fuzzy simulation-fuzzy data envelopment analysis algorithm for job-shop layout optimization: The case of injection process with ambiguous data[J]. European Journal of Operational Research, 2011, 214(3):768–779.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

HU Wenfa, HE Xinhua. Cascaded Connection Queuing Model of Urban Drainage System Layout and Its Optimization Algorithm[J].同济大学学报(自然科学版),2018,46(01):0141~

Copy
Share
Article Metrics
  • Abstract:1496
  • PDF: 1208
  • HTML: 567
  • Cited by: 0
History
  • Received:December 19,2016
  • Revised:November 24,2017
  • Adopted:November 13,2017
  • Online: February 01,2018
Article QR Code