BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260625T105810Z
UID:Seminar-networks-639@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Giorgos Christodoulou:MAILTO:G.Christodoulou@liverpool.ac.uk
DTSTART:20180419T140000
DTEND:20180419T150000
SUMMARY:Networks and Distributed Computing Series
DESCRIPTION:Xiaohui Zhu: Optimal design of water quality monitoring network\n\nThe optimal design of a water quality monitoring network not only minimizes the pollution detection time and maximizes the detection probability in river systems, but also reduces the redundant monitoring locations. In addition, it saves the investment and costs for building and operating the monitoring system as well as satisfies the management requirement.\n\nWe use the beneficial features of Multi-objective Discrete Particle Swarm Optimization to optimize the design of water quality monitoring network. Four optimization objectives are used in the algorithm which are minimum pollution detection time, maximum pollution detection probability, maximum centrality of monitoring locations and satisfying the management requirement of reservation for special monitoring locations. In order to guide the convergence process to keep reserved monitoring locations in Pareto frontier, we use a binary matrix to denote the reserved monitoring locations. Moreover, a new particle initialization procedure and the discrete velocity and position functions are also developed to support the reservation for monitoring locations.\n\nWe use the Storm Water Management Model (SWMM) to model a hypothetical river network which was studied in the literature for comparative analysis of our work. We define 3 pollution detection thresholds and simulate pollution events respectively to obtain all the pollution detection time for all the potential monitoring locations when a pollution event occurs randomly at any potential monitoring location. Experiment results are confirmed by an enumeration search method and show that our algorithm can obtain the Pareto frontier of optimization monitoring network design as well as satisfy the management requirement of reservation for monitoring locations.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=639
LOCATION:
END:VEVENT
END:VCALENDAR