This contribution focuses on the problem of optimal pump scheduling, a fundamental element in pursuing operation optimization of water distribution systems. A combined approach of multi-objective optimization and multi-criteria analysis is herein suggested to first find the Pareto front of non-dominated solutions and then to rank them based on a set of weighted criteria. The Non-Dominated Sorting Genetic Algorithm (NSGA-II) is proposed to solve the multi-objective problem, while the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) is used to achieve the final ranking.
Carpitella, S., Brentan, B., Montalvo, I., Izquierdo, J., Certa, A. (2018). Multi-objective and multi-criteria analysis for optimal pump scheduling in water systems. In EPiC Series in Engineering (pp. 364-371) [10.29007/vk44].
Multi-objective and multi-criteria analysis for optimal pump scheduling in water systems
Carpitella, Silvia
;Certa, Antonella
2018-01-01
Abstract
This contribution focuses on the problem of optimal pump scheduling, a fundamental element in pursuing operation optimization of water distribution systems. A combined approach of multi-objective optimization and multi-criteria analysis is herein suggested to first find the Pareto front of non-dominated solutions and then to rank them based on a set of weighted criteria. The Non-Dominated Sorting Genetic Algorithm (NSGA-II) is proposed to solve the multi-objective problem, while the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) is used to achieve the final ranking.File | Dimensione | Formato | |
---|---|---|---|
HIC_2018_FullPaper_364.pdf
Solo gestori archvio
Tipologia:
Pre-print
Dimensione
924.02 kB
Formato
Adobe PDF
|
924.02 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Multi-Objective_and_Multi-Criteria_Analysis_for_Optimal_Pump_Scheduling_in_Water_Systems.pdf
accesso aperto
Tipologia:
Versione Editoriale
Dimensione
701.01 kB
Formato
Adobe PDF
|
701.01 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.