PDF Computer Science Cacic 2018 24Th Argentine Congress Tandil Argentina October 8 12 2018 Revised Selected Papers Patricia Pesado Ebook Full Chapter

Computer Science CACIC 2018 24th
Argentine Congress Tandil Argentina

October 8 12 2018 Revised Selected
Papers Patricia Pesado
Visit to download the full and correct content document:
https://textbookfull.com/product/computer-science-cacic-2018-24th-argentine-congres
s-tandil-argentina-october-8-12-2018-revised-selected-papers-patricia-pesado/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Computer Science CACIC 2019 25th Argentine Congress of

Computer Science CACIC 2019 Río Cuarto Argentina
October 14 18 2019 Revised Selected Papers Patricia
Pesado
https://textbookfull.com/product/computer-science-
cacic-2019-25th-argentine-congress-of-computer-science-
cacic-2019-rio-cuarto-argentina-october-14-18-2019-revised-
selected-papers-patricia-pesado/
Computer Science CACIC 2019 25th Argentine Congress of

Computer Science CACIC 2019 Río Cuarto Argentina
October 14 18 2019 Revised Selected Papers 1st Edition
Patricia Pesado
cacic-2019-25th-argentine-congress-of-computer-science-
cacic-2019-rio-cuarto-argentina-october-14-18-2019-revised-
selected-papers-1st-edition-patricia-pesado/
Computer Science CACIC 2017 23rd Argentine Congress La

Plata Argentina October 9 13 2017 Revised Selected
Papers 1st Edition Armando Eduardo De Giusti (Eds.)
cacic-2017-23rd-argentine-congress-la-plata-argentina-
october-9-13-2017-revised-selected-papers-1st-edition-armando-
eduardo-de-giusti-eds/
Science of Cyber Security First International

Conference SciSec 2018 Beijing China August 12 14 2018
Revised Selected Papers Feng Liu
https://textbookfull.com/product/science-of-cyber-security-first-
international-conference-scisec-2018-beijing-china-
august-12-14-2018-revised-selected-papers-feng-liu/
DNA Computing and Molecular Programming 24th
International Conference DNA 24 Jinan China October 8
12 2018 Proceedings David Doty
https://textbookfull.com/product/dna-computing-and-molecular-
programming-24th-international-conference-dna-24-jinan-china-
october-8-12-2018-proceedings-david-doty/
Smart Cities First Ibero American Congress ICSC CITIES

2018 Soria Spain September 26 27 2018 Revised Selected
Papers Sergio Nesmachnow
https://textbookfull.com/product/smart-cities-first-ibero-
american-congress-icsc-cities-2018-soria-spain-
september-26-27-2018-revised-selected-papers-sergio-nesmachnow/
Computer Vision Applications Third Workshop WCVA 2018

Held in Conjunction with ICVGIP 2018 Hyderabad India
December 18 2018 Revised Selected Papers Chetan Arora
https://textbookfull.com/product/computer-vision-applications-
third-workshop-wcva-2018-held-in-conjunction-with-
icvgip-2018-hyderabad-india-december-18-2018-revised-selected-
papers-chetan-arora/
Coalgebraic Methods in Computer Science 14th IFIP WG 1

3 International Workshop CMCS 2018 Colocated with ETAPS
2018 Thessaloniki Greece April 14 15 2018 Revised
Selected Papers Corina Cîrstea
https://textbookfull.com/product/coalgebraic-methods-in-computer-
science-14th-ifip-wg-1-3-international-workshop-
cmcs-2018-colocated-with-etaps-2018-thessaloniki-greece-
april-14-15-2018-revised-selected-papers-corina-cirstea/
Computer Vision ACCV 2018 14th Asian Conference on

Computer Vision Perth Australia December 2 6 2018
Revised Selected Papers Part IV C.V. Jawahar
https://textbookfull.com/product/computer-vision-accv-2018-14th-
asian-conference-on-computer-vision-perth-australia-
december-2-6-2018-revised-selected-papers-part-iv-c-v-jawahar/
Patricia Pesado
Claudio Aciti (Eds.)
Communications in Computer and Information Science 995
Computer Science –
CACIC 2018
24th Argentine Congress
Tandil, Argentina, October 8–12, 2018
Revised Selected Papers
123
Communications
in Computer and Information Science 995
Commenced Publication in 2007
Founding and Former Series Editors:
Phoebe Chen, Alfredo Cuzzocrea, Xiaoyong Du, Orhun Kara, Ting Liu,
Krishna M. Sivalingam, Dominik Ślęzak, Takashi Washio, and Xiaokang Yang
Editorial Board Members

Simone Diniz Junqueira Barbosa
Pontifical Catholic University of Rio de Janeiro (PUC-Rio),
Rio de Janeiro, Brazil
Joaquim Filipe
Polytechnic Institute of Setúbal, Setúbal, Portugal
Ashish Ghosh
Indian Statistical Institute, Kolkata, India
Igor Kotenko
St. Petersburg Institute for Informatics and Automation of the Russian
Academy of Sciences, St. Petersburg, Russia
Junsong Yuan
University at Buffalo, The State University of New York, Buffalo, NY, USA
Lizhu Zhou
Tsinghua University, Beijing, China
More information about this series at http://www.springer.com/series/7899
Patricia Pesado Claudio Aciti (Eds.)
•
Computer Science –
CACIC 2018
24th Argentine Congress
Tandil, Argentina, October 8–12, 2018
Revised Selected Papers
123
Editors
Patricia Pesado Claudio Aciti
National University of La Plata National University of Buenos Aires Center
La Plata, Argentina Buenos Aires, Argentina
ISSN 1865-0929 ISSN 1865-0937 (electronic)

Communications in Computer and Information Science
ISBN 978-3-030-20786-1 ISBN 978-3-030-20787-8 (eBook)
https://doi.org/10.1007/978-3-030-20787-8
© Springer Nature Switzerland AG 2019

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now
known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this book are
believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors
give a warranty, expressed or implied, with respect to the material contained herein or for any errors or
omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in
published maps and institutional affiliations.
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
Welcome to the proceedings of the XXIV Argentina Congress of Computer Science

(CACIC 2018), held in Tandil, Buenos Aires, Argentina, during October 8–12, 2018.
CACIC 2018 was organized by the National University of the Center (Buenos Aires)
on behalf of the Network of National Universities with Computer Science Degrees
(RedUNCI).
CACIC is an annual congress dedicated to the promotion and advancement of all
aspects of computer science. Its aim is to provide a forum within which the development
of computer science as an academic discipline with industrial applications is promoted,
trying to extend the frontier of both the state of the art and the state of the practice. The
main audience for and participants of CACIC are seen as researchers in academic
departments, laboratories, and industrial software organizations.
CACIC 2018 covered the following topics: intelligent agents and systems;
distributed and parallel processing; software engineering; hardware architecture;
networks and operating systems; graphic computation, visualization, and image
processing; computer technology applied to education; databases and data mining;
innovation in software systems; computer security, innovation in computer science
education; signal processing and real-time system; digital governance and smart cities.
This year, we received 155 submissions. Each submission was reviewed by at least
two, and on average 3.2, Program Committee members and/or external reviewers.
A total of 116 full papers, involving 368 different authors from 52 universities, were
accepted. According to the recommendations of the reviewers, 26 of them were
selected for this book.
During CACIC 2018, special activities were also held, including two plenary
lectures, one discussion panel, four invited speakers, a special track on Digital
Governance and Smart Cities, and an International School with six courses.
Special thanks are extended to the members of the different committees for their
support and collaboration. Also, we would like to thank the local Organizing
Committee, reviewers, lecturers, speakers, authors, and all conference attendees.
Finally, we want to thank Springer for their support of this publication.
April 2019 Patricia Pesado

Organization
The XXIV Argentine Congress of Computer Science (CACIC 2018) was organized by
the School of Computer Science of the National University of the Center (UNICEN) on
behalf of the Network of National Universities with Computer Science Degrees
(RedUNCI).
Editors
Patricia Pesado National University of La Plata, Argentina
(RedUNCI Chair)
Claudio Aciti National University of Buenos Aires Center, Argentina
Editorial Assistant
Pablo Thomas National University of La Plata, Argentina
General Chair
Program Committee
Maria Jose Abásolo National University of La Plata, Argentina
Hugo Alfonso National University of La Pampa, Argentina
Jorge Ardenghi National University of South, Argentina
Marcelo Arroyo National University of Río Cuarto, Argentina
Hernan Astudillo Technical University Federico Santa María, Chile
Sandra Baldasarri University of Zaragoza, Spain
Javier Balladini National University of Comahue, Argentina
Luis Soares Barbosa University of Minho, Portugal
Rodolfo Bertone National University of La Plata, Argentina
Oscar Bria National University of La Plata, Argentina
Nieves R. Brisaboa University of La Coruña, Spain
Carlos Buckle National University of Patagonia San Juan Bosco,
Argentina
Alberto Cañas University of West Florida, USA
Ana Casali National University of Rosario, Argentina
Silvia Castro National University of South, Argentina
Antonio Castro Lechtaler National University of Buenos Aires, Argentina
Alejandra Cechich National University of Comahue, Argentina
viii Organization
Edgar Chávez Michoacana University of San Nicolás de Hidalgo

Carlos Coello Coello CINVESTAV, Mexico
Uriel Cuckierman National Technological University, Argentina
Armando E. De Giusti National University of La Plata, Argentina
Laura De Giusti National University of La Plata, Argentina
Marcelo De Vincenzi Inter-American Open University, Argentina
Claudia Deco National University of Rosario, Argentina
Beatriz Depetris National University of Tierra del Fuego, Argentina
Javier Díaz National University of La Plata, Argentina
Juergen Dix TU Clausthal, Germany
Ramón Doallo University of La Coruña, Spain
Domingo Docampo University of Vigo, Spain
Jozo Dujmovic San Francisco State University, USA
Marcelo Estayno National University of Lomas de Zamora, Argentina
Elsa Estevez National University of South, Argentina
Marcelo A. Falappa National University of South, Argentina
Pablo Rubén Fillotrani National University of South, Argentina
Jorge Finocchieto CAECE University, Argentina
Daniel Fridlender National University of Cordoba, Argentina
Fernando Emmanuel Frati National University of Chilecito, Argentina
Carlos Garcia Garino National University of Cuyo, Argentina
Luis Javier García Villalba Complutense University of Madrid, Spain
Marcela Genero University of Castilla-La Mancha, Spain
Sergio Alejandro Gómez National University of South, Argentina
Eduard Groller Vienna University of Technology, Austria
Roberto Guerrero National University of San Luis, Argentina
Jorge Ierache National University of Buenos Aires, Argentina
Tomasz Janowski Danube University Krems, Austria
Ramiro Jordan University of New Mexico, USA
Horacio Kuna National University of Misiones, Argentina
Laura Lanzarini National University of La Plata, Argentina
Guillermo Leguizamón National University of San Luis, Argentina
Fernando Lopez Gil University of Zaragoza, Spain
Ron P. Loui Washington University, USA
Emilio Luque Fadón Autonomous University of Barcelona, Spain
Maria Cristina Madoz National University of La Plata, Argentina
Maria Alejandra National University of San Juan, Argentina
Malberti Riveros
Maria Malbrán National University of Buenos Aires, Argentina
Cristina Manresa University of Baleares Islands, Spain
Javier Marco University of Zaragoza, Spain
Mauricio Marin National University of Santiago de Chile, Chile
Ramon Mas Sanso University of Baleares Islands, Spain
Orlando Micolini National University of Cordoba, Argentina
Alicia Mon ITBA, Argentina
Regina Motz University of the Republic, Uruguay
Organization ix
Marcelo Naiouf National University of La Plata, Argentina

Antonio Navarro Martin Complutense University of Madrid, Spain
Jose Angel Olivas Varela University of Castilla-La Mancha, Spain
Ariel Pasini National University of La Plata, Argentina
Alvaro Pardo University of the Republic, Uruguay
Patricia Pesado National University of La Plata, Argentina
Mario Piattini Velthuis University of Castilla-La Mancha, Spain
María Fabiana Piccoli National University of San Luis, Argentina
Luis Piñuel Complutense University of Madrid, Spain
Marcela Printista National University of San Luis, Argentina
Enrico Puppo University of Genoa, Italy
Hugo Ramón National University of Buenos Aires North-West,
Argentina
Dolores Isabel Autonomous University of Barcelona, Spain
Rexachs del Rosario
Nora Reyes National University of San Luis, Argentina
Rosabel Roig Vila University of Alicante, Spain
Gustavo Rossi National University of La Plata, Argentina
Paolo Rosso Technical University of Valencia, Spain
Sonia V. Rueda National University of South, Argentina
Francisco Ruiz González University of Castilla-La Mancha, Spain
Claudia Russo National University of Buenos Aires North-West,
Argentina
Carolina Salto National University of La Pampa, Argentina
Cecilia Sanz National University of La Plata, Argentina
Guillermo Ricardo Simari National University of South, Argentina
Osvaldo Spositto National University of La Matanza, Argentina
Ralf Steinmetz TU Darmstadt, Germany
Remo Suppi Autonomous University of Barcelona, Spain
Liane Tarouco Federal University of Rio Grande du Sul, Brazil
Francisco Tirado Complutense University of Madrid, Spain
Luis Velho Federal University of Rio Grande du Sul, Brazil
Eduardo Vendrell Technical University of Valencia, Spain
Marcelo Vénere National University of Buenos Aires Center, Argentina
Horacio Villagarcía Wanza National University of La Plata, Argentina
Dante Zanarini National University of Rosario, Argentina
Sponsors
Network or Universities Secretary of Science, Art National University

with Careers in Computer and Technology of Center (UNICEN)
Science (RedUNCI) National University
of Center (UNICEN)
Commission for Scientific Chamber of Business of Municipality of Tandil,

Research Province of Buenos Software and Information Buenos Aires,
Aires (CIC) Service (CESSI) Argentina
Contents
Agents and Systems
Solving the Multi-Period Water Distribution Network Design Problem

with a Hybrid Simulated Anealling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Carlos Bermudez, Carolina Salto, and Gabriela Minetti
Distributed and Parallel Processing
Checkpoint and Restart: An Energy Consumption

Characterization in Clusters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
Marina Morán, Javier Balladini, Dolores Rexachs,
and Emilio Luque
Energy Consumption Analysis and Time Estimation Model

in GPU Cluster and MultiGPU in a High Computational
Demand Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
Erica Montes de Oca, Laura De Giusti, Armando De Giusti,
and Marcelo Naiouf
Technology Applied to Education
Advances in Test Personalization and Adaptation in a Virtual

Learning Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
Marcela Gonzalez, Delia Esther Benchoff, Constanza Huapaya,
Cristian Remon, Guillermo Lazzurri, Leonel Guccione,
and Franscisco Lizarralde
Learning Objects. Case Studies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62

María Lucía Violini and Cecilia Verónica Sanz
A Nomadic Testbed for Teaching Computer Architecture . . . . . . . . . . . . . . . 74

Pablo D. Godoy, Carlos G. García Garino, and Ricardo L. Cayssials
Graphic Computation, Images and Visualization
Evaluating an End-to-End Process for Herpetological

Heritage Digital Preservation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91
Nicolás Jofré, Graciela Rodríguez, Yoselie Alvarado,
Jacqueline Fernandez, and Roberto Guerrero
xii Contents
Color Image Enhancement Using a Multiscale Morphological Approach . . . . 109

Raul Mendez, Rodolfo Cardozo, José Luis Vázquez Noguera,
Horacio Legal-Ayala, Julio César Mello Román, Sebastian Grillo,
and Miguel García-Torres
An Approach to Automated Recognition of Pavement Deterioration

Through Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 124
Rodrigo Huincalef, Guillermo Urrutia, Gabriel Ingravallo,
and Diego C. Martínez
Software Engineering
White-Box Testing Framework for Object-Oriented Programming.

An Approach Based on Message Sequence Specification
and Aspect Oriented Programming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
Martín L. Larrea, Juan Ignacio Rodríguez Silva, Matías N. Selzer,
and Dana K. Urribarri
Proposal for a Model of a Computer Systems Implantation

Process (MoProIMP) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157
Marisa Panizzi, Rodolfo Bertone, and Alejandro Hossian
Storage Space Use in Mobile Applications . . . . . . . . . . . . . . . . . . . . . . . . . 171

Juan Fernández Sosa, Pablo Thomas, Lisandro Delía, Germán Cáseres,
Leonardo Corbalán, Fernando Tesone, and Verena Olsowy
Scrum Towards IRAM-ISO 9001:2015. Integrating

Documentation Required . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183
Julieta Calabrese, Silvia Esponda, Marcos Boracchia,
and Patricia Pesado
Databases and Data Mining
Discovering Association Rules Using R. A Case Study

on Retail’s Database . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199
Juan Manuel Báez Acuña, Clara Anuncia Paredes Cabañas,
Gustavo Sosa-Cabrera, and María E. García-Díaz
D3CAS: Distributed Clustering Algorithm Applied

to Short-Text Stream Processing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211
Roberto Molina, Waldo Hasperué, and Augusto Villa Monte
Market Segmentation Using Data Mining Techniques

in Social Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221
Eduin Olarte, Marisa Panizzi, and Rodolfo Bertone
Contents xiii
Hardware Architectures, Networks, and Operating Systems
Heuristic Variant for the Travelling Salesman Problem.

Application Case: Sports Fishing Circuit . . . . . . . . . . . . . . . . . . . . . . . . . . 235
Ana Priscila Martínez and Lidia Marina López
Contention Analysis of Congestion Control Mechanisms

in a Wireless Access Scenario . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 249
Diego R. Rodríguez Herlein, Carlos A. Talay, Claudia N. González,
Franco A. Trinidad, María L. Almada, and Luis A. Marrone
Innovation in Software Systems
Templates Framework for the Augmented Catalog System . . . . . . . . . . . . . . 267

Nahuel Mangiarua, Jorge Ierache, Martin Becerra, Hernán Maurice,
Santiago Igarza, and Osvaldo Spositto
Smart Assistance Spots for the Blind or Visually Impaired People. . . . . . . . . 277
Guillermo Arispe, Claudio Aciti, Matías Presso, and José Marone
Signal Processing and Real-Time Systems
Compound Interleaving Scheduling for SLM Transactions

in Mode S Surveillance Radar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 297
Oscar Bria, Javier Giacomantone, and Horacio Villagarcía Wanza
Position and Deformation-Checking Method Based

on Structured Illumination. External Radiotherapy Use . . . . . . . . . . . . . . . . 313
Leopoldo Garavaglia, Liliana Mairal, and Jorge Runco
Computer Security
Deep Convolutional Neural Networks for DGA Detection . . . . . . . . . . . . . . 327

Carlos Catania, Sebastian García, and Pablo Torres
Innovation in Computer Science Education
Computer Science and Schools: A Specific Didactics? . . . . . . . . . . . . . . . . . 343

Claudia Queiruga, Claudia Banchoff Tzancoff, Paula Venosa,
Soledad Gómez, and Glenda Morandi
Digital Governance and Smart Cities
Open Government Assessment Models Applied to Province’s Capital

Cities in Argentina and Municipalities in the Province of Buenos Aires . . . . . 355
Ariel Pasini, Juan Santiago Preisegger, and Patricia Pesado
xiv Contents
Combining Artificial Intelligence Services for the Recognition

of Flora Photographs: Uses in Augmented Reality and Tourism . . . . . . . . . . 367
Guillermo Feierherd, Federico González, Leonel Viera, Rosina Soler,
Lucas Romano, Lisandro Delía, and Beatriz Depetris
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 377

Agents and Systems
Solving the Multi-Period Water
Distribution Network Design Problem
with a Hybrid Simulated Anealling
Carlos Bermudez1 , Carolina Salto1,2 , and Gabriela Minetti1(B)

1
Facultad de Ingenierı́a, Universidad Nacional de La Pampa, Calle 110 Nro. 390,
General Pico, La Pampa, Argentina
bermudezc@yahoo.com,{saltoc,minettig}@ing.unlpam.edu.ar
2
CONICET, Buenos Aires, Argentina
Abstract. This work presents an optimization technique based on

Simulated Annealing (SA) to solve the Water Distribution Network
Design problem, considering multi-period restrictions with time varying
demand patterns. The design optimization of this kind of networks is an
important issue in modern cities, since a safe, adequate, and accessible
supply of potable water is one of the basic necessities of any human being.
Given the complexity of this problem, the SA is improved with a local
search procedure, yielding a hybrid SA, in order to obtain good quality
networks designs. Additionally, four variants of this algorithm based on
different cooling schemes are introduced and analyzed. A broad experi-
mentation using different benchmark networks is carried out to test our
proposals. Moreover, a comparison with an approach from the literature
reveals the goodness to solve this network design problem.
Keywords: Water Distribution Network Design · Optimization ·

Metaheuristic · Simulated Annealing
1 Introduction
A water distribution network consists of thousands of nodes with nonlinear
hydraulic behaviour, linked by thousands of interconnecting links. The inherent
problem associated with cost optimisation in the design of water distribution net-
works is due to the nonlinear relationship between flow and head loss and the dis-
crete nature of pipe sizes. As a consequence, the solution concerning the layout,
design, and operation of the network of pipes should result from good planning and
management procedures. In this way, this problem known as Water Distribution
Network Design (WDND) requires to manage an important number of variables
(pipes, pipe diameters, demand nodes, water pressure, reservoirs, etc.), and con-
straints (water velocity, pressure, etc.). This problem, even for simple networks,
is very difficult to solve, in particular it is classified as NP-hard [1].
Early research works in the WDND optimization area were focused on
the single-period, single-objective, gravity-fed design optimization problem.
c Springer Nature Switzerland AG 2019
P. Pesado and C. Aciti (Eds.): CACIC 2018, CCIS 995, pp. 3–16, 2019.
https://doi.org/10.1007/978-3-030-20787-8_1
4 C. Bermudez et al.
The first research works applied linear programming [2,3], and non-linear pro-
gramming [4,5]. After that, the metaheuristics have been used to solve these
problems, such as the trajectory-based ones: Simulated Annealing [6,7] and Tabu
Search [8]. Also population-based metaheuristics were applied, for example, Ant
Colony Optimization [9], Ant Systems [10], Genetic Algorithms [11–13] Scatter
Search [14], and Differential Evolution [15].
Recently, the single-period problem was extended to a multi-period setting in
which time varying demand patterns occur. Farmani et al. [16] formulated the
design problem as a multi-objective optimization problem and apply a multi-
objective evolutionary algorithm. In [12], a Genetic Algorithm was used to solve
six small instances considering velocity constraint on the water flowing through
the distribution pipes. This constraint was also taken into account in [17], but the
authors used mathematical programming on bigger, closer-to-reality instances. A
Differential Evolution (DE) algorithm was proposed in [18] to minimize the cost
of the water distribution network. Another version of a DE algorithm to solve this
problem was presented in [19]. An Iterative Local Search [20] was specifically-
designed in order to consider that every demand node has 24 hrs water demand
pattern and a new constraint, which imposes a limit on the maximal velocity of
water through the pipes.
Based on the problem formulation given by De Corte and Sörensen [20],
we propose an optimization technique, based on Simulated Annealing (SA), in
order to improve and optimize the distribution network design. Thus, this SA
is designed to obtain the optimal type of pipe connecting the supply, demand,
and junction nodes in the distribution network. This proposal incorporates a
local search procedure in order to improve the layout of the network, arising
the Hybrid Simulated Annealing (HSA). The HSA’s performance is compared
with algorithms present in the literature. This work constitutes an extension of
a previous work [21] and includes new content regarding an study and analysis
of the main control parameter of the HSA, known as temperature. Moreover,
we introduce and statistically compare four HSA’s variants, taking into account
different schemes to schedule the cooling process. We test the performance of
our proposals with a set of networks with different sizes expressed by number
of pipes and characteristics. The evaluation considers relevant aspects such as
efficiency and internal behavior.
The rest of this article is organized as follows. In Sect. 2, we introduce the
problem definition. Section 3 explains our algorithmic proposal, HSA, to solve the
WDND optimization problem and the four HSA’s variants. Section 4 describes
the experimental analysis and the methodology used. Then, we analyze the
results obtained by the variants and compare with the obtained by the ILS [20]
in Sects. 5 and 6, respectively. Finally, we present our principal conclusions and
future research lines.
2 Multi-Period Water Distribution Network Design

The objective of the WDND problem is to minimize the total investment cost
(TIC) in a water distribution network design. The problem can be characterized
Solving the Multi-Period Water Distribution Network Design Problem 5
as: simple-objective, multi-period, and gravity-fed. Two restrictions are consid-

ered: the limit of water speed in each pipe and the demand pattern that varies
in time. The network can be modeled by a connected graph, which is described
by a set of nodes N = {n1 , n2 , ...}, a set of pipes P = {p1 , p2 , ...}, a set of loops
L = {l1 , l2 , ...}, and a set of commercially available pipe types T = {t1 , t2 , ...} .
The TIC is obtained by the formula shown in Eq. 1,

min T IC = Lp ICt xp,t (1)
p∈P t∈T
where ICt is the cost of a pipe p of type t, Lp is the length of the tube, and xp,t
is the binary decision variable that determines whether the tube p is of type t
or not. The objective function is limited by: physical laws of mass and energy
conservation, minimum pressure demand in the nodes, and the maximum speed
in the pipes, for each time τ ∈ T . These laws are explained in the following
paragraphs.
Mass Conservation Law: It must be satisfied for each node N in each period
of time τ . This law establishes that the volume of water flowing towards a node
in a unit of time must be equal to the flow that leaves it (see Eq. 2),

Q(n1 ,n),τ − Q(n,n2 ),τ = W Dn,τ − W Sn,τ ∀n ∈ N ∀τ ∈ T (2)
n1 ∈N/n n2 ∈N/n
where Q(n1 ,n),τ is the flow from node n1 to node n at time τ , W Sn,τ is the
external water supplied and W Dn,τ is the external water demanded.
Energy Conservation Law: It states that the sum of pressure drops in a closed
circuit in an instant of time τ is zero. These drops can be approximated using
the Hazen-Williams equations with the parameters used in EPANET 2.0 [22]
(the hydraulic solver used in this paper), as indicated in Eq. 3.

10.6668yp,τ Qp,τ 1.852
Lp
1.852 D 4.871 = 0 ∀l ∈ L ∀τ ∈ T (3)
p∈l t∈T (xp,t Ct t
In Eq. 3, yp,τ is the sign of Qp,τ that indicates changes in the water flow direc-
tion relative to the defined flow directions, Qp,τ is the amount of water flowing
through pipe p in time τ , Lp is the pipe length, Ct is the Hazen-Williams rough-
ness coefficient of pipe type t, and Dt is the diameter of pipe type t.
Minimum Pressure Head Requirements: for each node n in each period of
time τ , it must be satisfied (see Eq. 4),
Hn,τ
min
≤ Hn,τ ∀n ∈ N ∀τ ∈ T (4)
being H min the minimum node pressure and Hn,τ the node’s current pressure.
Maximum Water Velocity: The water velocity vp,τ can not exceed the max-
imum stipulated speed vp,τ
max
. Equation 5 shows this relationship.
vp,τ ≤ vp,τ
max
∀p ∈ P ∀τ ∈ T (5)
Table 1. Different solutions or network designs in vector representation.
Solution Pipe ID 1 2 3 4 5 6 7 8 Feasibility

Length (m) 31 20 35 37 24 50 12 65 TIC
1 Diam. (mm) 150 150 80 80 100 60 60 80 Feasible
Cost 1550 1000 1225 1295 912 1100 264 2275 9621
2 Diam. (mm) 150 150 80 60 100 60 60 80 Infeasible
Cost 1550 1000 1225 814 912 1100 264 2275 9140
3 Our Proposal for the Multi-Period WDND Problem
Simulated Annealing (SA) [23], a simple trajectory-based metaheuristic, is based

on the principles of statistical thermodynamics, whereby the annealing process
requires heating and then slowly cooling the physical material until it solidi-
fies into a perfect crystalline structure. The SA algorithm simulates the energy
changes in a system subjected to a cooling process until it converges to an equi-
librium state (steady frozen state), where the physical material states correspond
to problem solutions, the energy of a state to cost of a solution, and the tem-
perature to a control parameter.
At the beginning (with a high temperature), SA accepts solutions with high
cost values under a certain probability in order to explore the search space
and to escape from local optima. During the annealing process this probability
decreases according to temperature cooling; intensifying the search and reducing
the exploration in order to exploit a restricted area of a search space.
Simulated annealing evolves by a sequence of transitions between states and
these transitions are generated by transition probabilities. Consequently, SA
can be mathematically modeled by Markov chains, where a sequence of chains is
generated by a transition probability, which is calculated involving the current
temperature.
The proposal consists in adapting and hybridizing the SA algorithm to
solve the Multi-Period WDND optimization problem, arising Hybrid Simulated
Annealing (HSA) algorithm. A solution to this problem is a network, as shown
in Fig. 1(a) and (b). A network or a solution is represented by a vector, where
each element is the diameter selected for that pipe, as can be seen in Table 1.
In this table the vectors that represent the candidate solutions in Fig. 1(a) and
(b) are shown. The total investment cost for each solution is calculated by the
Eq. 1, using the input data from tables (c) and (d) of Fig. 1. The first solution
is hydraulically feasible (satisfying all constraints mentioned in Sect. 2) and the
second one is infeasible (violating the minimum pressure constraint in node 7).
In Algorithm 1, we show a pseudo-code of the HSA algorithm to solve the
WDND optimization problem. HSA uses the EPANET 2.0 toolkit [22] to solve
the hydraulic equations, since this hydraulic solver is applied in most existing
works. HSA generates a feasible initial solution S0 applying both HighCost and
Lowcost mechanisms proposed in [20] (line 2). After the evaluation of the initial
(a) (b)
Pipe ID Length (m)

1 31 Diam. Roughness
2 20 (mm) unitless Cost
3 35 60 130 22
4 37 80 130 35
5 24 100 130 38
6 50 150 130 50
7 12 200 130 61
8 65 (d)
(c)
Fig. 1. Different solutions or network designs. (a) Solution 1; (b) solution 2; (c) pipe
lengths; (d) available pipe types with their corresponding costs.
Algorithm 1. HSA Algorithm to solve the WDND optimization Problem

1: k = 0;
2: initialize T and S0 ; {temperature and initial solution}
3: evaluate S0 in T IC0 ;
4: repeat
5: repeat
6: k = k + 1;
7: generate S1 from S0 applying the MP-GRASP Local Search;
9: if T IC1 < T IC0 then
10: S0 = S1 ; T IC0 = T IC1
11: end if
12: generate S2 from S0 applying the perturbation operator;
14: if (T IC2 < T IC0 ) or (exp((T IC2 − T IC0 )/T ) > random(0, 1)) then
15: S0 = S2 ; T IC0 = T IC2
16: end if
17: until (k mod MCL) == 0
18: update T ;
19: until stop criterion is met
20: return S0 ;
solution (line 3), an iterative process starts (lines 4 to 19). As a first step in the
iteration, the hybridization is carried out in order to intensify the search into the
current region of the solution space. In this way a feasible solution, S1 , is obtained
by applying the MP-GRASP local search [20] to S0 (line 7), and then a greedy
selection mechanism is performed (lines 9–11). As a consequence, S0 can be
replaced by S1 if this is better than S0 . In the next step a perturbation operator
is used to obtain a feasible neighbor, S2 , from S0 (line 12), in order to explore
another areas of the search space. This perturbation randomly changes some
pipe diameters. If S2 is worse than S0 , S2 can be accepted under the Boltzmann
probability (line 14, second condition). In this way, at high temperatures (T ) the
exploration of the search space is strengthened. In contrast, at low temperatures
the algorithm only exploits a promising region of the solution space, intensifying
the search. In order to update T , a cooling schedule [23] is used (line 18) and
it is applied after a certain number of iterations (k) given by the Markov Chain
Length (M CL) (line 17). Finally, SA ends the search when the total evaluation
number is reached or the T = 0.
Most features in SA, such as search space, perturbation operator, and cost
(evaluation) function, are fixed by the problem definition. The only feature that
is variable during the process is the temperature. Therefore one of the most
important features in simulated annealing is the choice of the annealing schedule,
and many attempts have been made to derive or suggest good schedules [24].
In this work, we study the behavior of the most known cooling process in the
literature to solve the Multi-Period WDND optimization problem, arising three
new HSA variants as explained in the following.
– HSAP r op applies the proportional cooling scheme, also called geo-
metric schedule [23], in order to reduce the temperature, as the Eq. 6 shows:
Tk+1 = α ∗ Tk (6)
where α is a constant close to, but smaller than, 1. Particularly, we calculate
α as follows:
k
α= (7)
k+1
This scheme is the most popular cooling function because, the temperature
decay is not too slow neither too fast allowing to achieve an equilibrium
between exploitation and exploration.
– HSAE xp uses the exponential cooling scheme [23] to produce the tem-
perature decay. The Eq. 8 describes these process, where the constant αk < 1
is calculated in the Eq. 9. This schedule quickly cools the temperature reduc-
ing the required time and iterations to converge to a good solution. In big and
complex problems, this becomes in a disadvantage, given that the equilibrium
between the exploitation and exploration is broken.
Tk+1 = Tk ∗ αk (8)
ek
αk = (9)
e1+k
Table 2. Information on the HydroGen networks.
Network Meshedness Pipes Demand Water Network Meshedness Pipes Demand Water
coefficient nodes reservoirs coefficient nodes reservoirs
HG-MP-1 0.2 100 73 1 HG-MP-9 0.1 295 247 2
HG-MP-2 0.15 100 78 1 HG-MP-10 0.2 397 285 2
HG-MP-3 0.1 99 83 1 HG-MP-11 0.15 399 308 2
HG-MP-4 0.2 198 143 1 HG-MP-12 0.1 395 330 3
HG-MP-5 0.15 200 155 1 HG-MP-13 0.2 498 357 2
HG-MP-6 0.1 198 166 1 HG-MP-14 0.15 499 385 3
HG-MP-7 0.2 299 215 2 HG-MP-15 0.1 495 413 3
HG-MP-8 0.15 300 232 2
– HSALog employs the logarithmic cooling scheme [25], which modifies

the temperature, as shown in Eq. 10. In this Equation, the chain converges to
a global and minimal energy value, where the constant C is computed as the
Eq. 11 shows. This schedule is too slow to be applied in practice but has the
property of the convergence proof to a global optimum [26].
Tk+1 = C ∗ Tk (10)
ln(k)
C= (11)
ln(1 + k)
Furthermore, we propose a fourth HSA variant, named HSARan d . This new

variant combines the three previous explained cooling schemes in only one sched-
ule process. In each iteration, HSARand randomly selects one of these schemes
in order to reduce the temperature. In this way, we try to enhance the HSA by
aggregating the advantages of these three schemes and mitigating their disad-
vantages.
4 Experimental Design
In this section, we introduce the experimental design used in this approach,

the execution environment, and the result analysis. In order to evaluate HSA,
the HydroGen instances of WDND optimization problem [27] are solved. These
instances, HG-MP-i, arise from 15 different distribution networks (see Table 2).
A set of 16 different pipe types is used and their characteristics and costs can be
found in Table 3. The demand nodes are divided into five categories (domestic,
industrial, energy, public services, and commercial demand nodes), each one
with a corresponding base load and demand pattern1 . In this way, five different
instances are considered for each HG-MP-i network, totalling 75 instances.
The computational environment used in this work to carry out the exper-
imentation consists of computers with INTEL I7 3770 K quad-core proces-
sors 3.5 GHz, 8 GB RAM, and the Slackware Linux with 3.2.29 kernel version.
1
The base loads can be found in the EPANET input files of the instances.
Table 3. Available pipe types and their corresponding costs.
Number Diam. (mm) Roughness Cost Number Diameter Roughness Cost

1 20 130 15 9 200 130 116
2 30 130 20 10 250 130 150
3 40 130 25 11 300 130 201
4 50 130 30 12 350 130 246
5 60 130 35 13 400 130 290
6 80 130 38 14 500 130 351
7 100 130 50 15 600 130 528
8 150 130 61 16 1,000 130 628
Because of the stochastic nature of the algorithms, we performed 30 indepen-

dent runs of each instance to gather meaningful experimental data and apply
statistical confidence metrics to validate our results and conclusions. As a result,
a total of 9000 executions (75 × 4 × 30) were carried out. Before performing the
statistical tests, we first checked whether the data followed a normal distribution
by applying the Shapiro-Wilks test. Where the data was distributed normally,
we later applied an ANOVA test. Otherwise, we used the Kruskal–Wallis (KW)
test. This statistical study allows us to assess whether or not there were mean-
ingful differences between the compared algorithms with a confidence level of
99%.
5 Analysis of the Results Obtained by Our Proposals
In this section, we summarize and analyze the results of using the four proposed
HSA’s variants (HSAP rop , HSAExp , HSALog , and HSARand ) on all the problem
instances, following the next methodology. First, we analyze the behavior of
these variants considering the results shown in the Table 4. The columns 2–5
show the average of the best cost values found by these four variants for the
75 instances grouped by their corresponding distribution network. The minimal
cost values found by each group are boldfaced. In the last column, the results of
the Kruskall-Wallis test are summarized, where the symbol “+” indicates that
the behavior of the four HSA’s variants are statistically similar, while the symbol
“-” specifies that these behaviors are significantly different. Secondly, we analyze
the temperature decay for each proposed HSA taking into account the variation
of the temperature parameter during the search, as shown in the Fig. 2.
Regarding the quality point of view, HSAP rop finds the best cost in many
more instances than the rest of variants, i.e. HSAP rop achieves the best solu-
tions in eight instances, followed by HSAExp with three, HSARand with two,
and HSALog with only one instance (see the boldfaced values in the Table 4).
These differences between the behaviors are supported by the KW results, which
indicate that the cooling schemes drive the search in significant different ways,
Table 4. Averages of the best cost values found by each proposed variant, which are
grouped by network.
Network HSAP rop HSAExp HSALog HSARand KW

HG-MP-1 335882,80 338817,60 338223,00 338250,60 –
HG-MP-2 298842,40 304934,80 298651,80 297241,60 –
HG-MP-3 387088,80 371490,40 386142,80 386133,60 –
HG-MP-4 690033,40 698058,60 691564,60 697496,40 –
HG-MP-5 722217,60 722878,00 718754,80 724301,00 –
HG-MP-6 741638,20 747825,80 751994,80 742786,60 –
HG-MP-7 817261,80 825763,40 831011,80 812428,20 –
HG-MP-8 855478,60 862003,00 867300,00 866820,20 –
HG-MP-9 834821,40 841512,20 842372,60 845829,40 –
HG-MP-10 788422,20 796010,80 801549,60 809821,60 –
HG-MP-11 909037,80 915537,80 915997,20 912114,80 –
HG-MP-12 1046426,00 1043728,20 1054274,40 1058030,60 –
HG-MP-13 1179568,00 1196634,00 1190972,00 1189460,00 –
HG-MP-14 1085194,80 1092782,40 1087786,20 1087889,40 –
HG-MP-15 1161200,00 1155254,00 1166694,00 1170664,00 –
Fig. 2. Average temperature decay during the search.
strengthening the search when the proportional scheme is used. This scheme pro-
duces a temperature decay that allow an adequate exploration at the beginning,
enabling a greater exploitation at the ending of the search.
If the Fig. 2 is analyzed, no quick temperature convergence to zero is observed
when HSAP rop and HSALog are executed, but the temperature decay is greater
in the first one. This last property is the reason of the HSAP rop ’s success to find
the minimal cost values in more than 50% of the instances. Conversely, regarding
Table 5. Average of the best TIC values obtained by ILS and HSAP rop for all instances
grouped by the corresponding network. The best values are boldfaced.
Network ILS HSAProp Network ILS HSAProp

HG-MP-1 339200 335883 HG-MP-9 831200 834821
HG-MP-2 303800 298842 HG-MP-10 790600 788422
HG-MP-3 389200 387089 HG-MP-11 907000 909038
HG-MP-4 694200 690033 HG-MP-12 1022800 1046426
HG-MP-5 728200 722218 HG-MP-13 1190400 1179568
HG-MP-6 750400 741638 HG-MP-14 1070200 1085195
HG-MP-7 818000 817262 HG-MP-15 1122600 1161200
HG-MP-8 851600 855479
HSAExp and HSARand , the temperature converges quickly to values close to zero
restricting the exploration at the beginning of the search, although HSAExp
outperforms HSARand when the solution quality is analysed. It is remarkable
that, the stop condition is achieved by all HSA’s variants when the number of
evaluations (EPANET calls) is equal to 1,500,000 but the temperature remains
greater than zero.
Summarizing, the proportional cooling scheme allows HSAP rop outperforms
the remaining HSA’s variants, by balancing the exploitation and exploration
during the search. As a consequence, HSAP rop obtains the best networks designs
doing the same computational effort than the others variants.
6 Comparison of HSAP rop and the Literature Approaches
Regarding that HSAP rop obtained the best results, we select this variant to com-
pare its performance with the ILS proposed in [20]. This metaheuristic is chosen
from literature for this comparison, since its authors also used the HydroGen
instances to test it. In this way, our results can be compared with ones of the
state-of-the-art, allowing to know the level of quality reached by our proposal.
The methodology used to analyze the results is described in the following.
First, we study the HSA behavior comparing the best cost values found by
HSAP rop and ILS [20] for the 75 instances, grouped by their corresponding dis-
tribution network, as presented in the Table 5. Secondly, we analyze the HSAP rop
convergence, in comparison with ILS, taking into account the cost values found
at the 1e+05, 3e+05, 5e+05, 10e+05, and 15e+05 EPANET calls (evaluations),
as shown in the Fig. 3. Besides, the HSA’s execution times (in seconds) to carry
out the maximum number of evaluations for each test case, grouped by network,
are shown in the Fig. 4. Note that, we only present the HSA’s total execution
time for all test cases, because no data about this metric are reported by De
Corte and Sörensen in [20].
Analyzing the Table 5, we detect that HSAP rop finds solutions with less TIC
values than the ones of ILS in nine networks. As a consequence, in 60% of the
problem instances better cost values are found when they are solved by HSAP rop .
The HSA advantage arises out of the Boltzmann probability application to accept
high TIC values, which allows to diversify the search to escape from local optima.
From the convergence point of view, we observe that HSAP rop finds solutions
with TIC values near to the best ones in 80% of the instances, with only 1e+05
evaluations. Instead, ILS needs at least 3e+05 evaluations for that, besides this
is achieved in only 66% of the test cases.
HG−MP−1 HG−MP−2 HG−MP−3 HG−MP−4 HG−MP−5

340000
393000
750000
310000
650000
310000
390000
Cost
Cost
Cost
Cost
Cost
720000
500000
300000
280000
690000
387000
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
Evaluations Evaluations Evaluations Evaluations Evaluations

1050000
960000
950000
950000
900000
770000
950000
Cost
Cost
Cost
Cost
Cost
850000
840000
800000
850000
740000
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06

1500000
1200000
1400000
1600000
900000 1000000
Cost
Cost
Cost
Cost
Cost
1200000
1050000
1100000
1200000
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
1.0e+05
3.0e+05
5.0e+05
1.0e+06
1.5e+06
Fig. 3. Evolution of the TIC values during the search for all instances.
500
time (sec.)
300
100
0
HG−MP−1
HG−MP−2
HG−MP−3
HG−MP−4
HG−MP−5
HG−MP−6
HG−MP−7
HG−MP−8
HG−MP−9
HG−MP−10
HG−MP−11
HG−MP−12
HG−MP−13
HG−MP−14
HG−MP−15
Networks
Fig. 4. Average of the total HSAP rop execution times for all instances grouped by the
corresponding network.
Evaluating both the Fig. 4 and the Table 2 together, we notice that the HSA’s
execution time is affected by the number of pipes and demand nodes. In this way,
five groups of three networks can be formed exhibiting similar execution times.
These instances have consecutive numbers, e.g. the set of the HG-MP-1, 2, and 3
networks have similar number of pipes and demand nodes, and so on. Being the set
formed by the HG-MP-13, 14, and 15 networks the most expensive cases to solve.
Furthermore, analyzing what happened into each set of networks, the network with
more demand nodes consumes less execution time than the other two, since more
feasible solutions exist and HSA needs less time to find one of them.
Summarizing, HSAP rop outperforms ILS for the 60% of the problem instances
when the result quality is considered. Moreover, a quick convergence to good
solutions is also evidenced by our proposal in most of the problem instances.
Furthermore, the HSA’s runtime is affected by the growing and combination of
the number of pipes and demand nodes.
7 Conclusions
In this paper, we have proposed water distribution network designs consider-

ing the multi-period settings with time varying demand patterns. The tech-
nique proposed to obtain these network designs is a hybrid Simulated Anneal-
ing algorithm, called HSA, which solves the hydraulic equations by using the
EPANET 2.0 toolkit. HSA combines an WDND-adapted SA with the MP-
GRASP local search [20]. Furthermore, four different HSA’s variants (HSAP rop ,
HSAExp , HSALog , and HSARand ) have been created by applying the propor-
tional, exponential, logarithmic, and random cooling schemes respectively. For
this study, we have tested 75 instances that come from 15 different HydroGen
networks.
An important point is that all the proposed HSA’s variants had an equiva-
lent computational effort, because all of them carried out the same number of
evaluations. In this context HSAP rop , the algorithm that uses the proportional
cooling scheme to reduce the temperature, found the best networks designs out-
performing the remaining proposals.
Moreover, HSAP rop ’s results were compared with the obtained by the ILS
proposed in [20] to solve this problem. As a consequence, we observed that this
HSA variant also outperformed the results obtained by ILS in more than half
(60%) of instances. Additionally, HSA achieved a better exploration than ILS,
because of the Boltzmann probability application to accept solutions that can
explore new areas of the search space. This advantage combined with the local
search allowed HSA to converge quickly on the best solutions.
For future works, we will improve the HSA to solve the multi-period WDND
optimization problem, by introducing changes in the initialization method of
the temperature. We are also interested in testing larger dimension instances, as
close as possible to real scenarios.
Acknowledgments. The authors acknowledge the support of Universidad Nacional

de La Pampa and the Incentive Program from MINCyT. The second author is also
funded by CONICET.
References
1. Yates, D.F., Templeman, A.B., Boffey, T.B.: The computational complexity of the
problem of determining least capital cost designs for water supply networks. Eng.
Optim. 7(2), 143–155 (1984)
2. Alperovits, A., Shamir, U.: Design of optimal water distribution systems. Water
Resour. Res. 13(6), 885–900 (1977)
3. Kessler, A., Shamir, U.: Analysis of the linear programming gradient method for
optimal design of water supply networks. Water Resour. Res. 25(7), 1469–1480
(1989)
4. Fujiwara, O., Khang, D.: A two-phase decomposition method for optimal design
of looped water distribution networks. Water Resour. Res. 26(4), 539–549 (1990)
5. Duan, N., Mays, L.W., Lansey, K.E.: Optimal reliability-based design of pumping
and distribution systems. J. Hydraul. Eng. 116(2), 249–268 (1990)
6. Loganathan, G., Greene, J., Ahn, T.: Design heuristic for globally minimum cost
water-distribution systems. J. Water Res. Plan. Manag. 121(2), 182–192 (1995)
7. da Conceicao Cunha, M., Sousa, J.: Hydraulic infrastructures design using simu-
lated annealing. J. Infrastruct. Syst. 7(1), 32–39 (2001)
8. da Conceicao Cunha, M., Ribeiro, L.: Tabu search algorithms for water network
optimization. Eur. J. Oper. Res. 157(3), 746–758 (2004)
9. Maier, H.R., et al.: Ant colony optimization for design of water distribution sys-
tems. J. Water Resour. Plan. Manag. 129(3), 200–209 (2003)
10. Zecchin, A.C., Simpson, A.R., Maier, H.R., Nixon, J.B.: Parametric study for an
ant algorithm applied to water distribution system optimization. IEEE Transact.
Evol. Comput. 9(2), 175–191 (2005)
11. Dandy, G.C., Simpson, A.R., Murphy, L.J.: An improved genetic algorithm for
pipe network optimization. Water Resour. Res. 32(2), 449–458 (1996)
12. Gupta, I., Gupta, A., Khanna, P.: Genetic algorithm for optimization of water
distribution systems. Environ. Model. Softw. 14(5), 437–446 (1999)
13. Bi, W., Dandy, G.C., Maier, H.R.: Improved genetic algorithm optimization of
water distribution system design by incorporating domain knowledge. Environ.
Model. Softw. 69, 370–381 (2015)
14. Lin, M.-D., Liu, Y.-H., Liu, G.-F., Chu, C.-W.: Scatter search heuristic for least-
cost design of water distribution networks. Eng. Optim. 39(7), 857–876 (2007)
15. Vasan, A., Simonovic, S.P.: Optimization of water distribution network design
using differential evolution. J. Water Resour. Plan. Manag. 136(2), 279–287 (2010)
16. Farmani, R., Walters, G.A., Savic, D.A.: Trade-off between total cost and reliability
for anytown water distribution network. J. Water Resour. Plan. Manag. 131(3),
161–171 (2005)
17. Bragalli, C., D’Ambrosio, C., Lee, J., Lodi, A., Toth, P.: On the optimal design
of water distribution networks: a practical MINLP approach. Optim. Eng. 13(2),
219–246 (2012)
18. Uma, R.: Optimal design of water distribution network using differential evolution.
Int. J. Sci. Res. (IJSR) 5(11), 1515–1520 (2016)
19. Mansouri, R., Mohamadizadeh, M.: Optimal design of water distribution system
using central force optimization and differential evolution. Int. J. Optim. Civil Eng.
7(3), 469–491 (2017). http://ijoce.iust.ac.ir/article-1-310-en.html
20. De Corte, A., Sörensen, K.: An iterated local search algorithm for water distribu-
tion network design optimization. Network 67(3), 187–198 (2016)
21. Bermudez, C.A., Minetti, G.F., Salto, C.: SA to optimize the multi-period water
distribution network design. In: XXIX Congreso Argentino de Ciencias de la Com-
putación, CACIC 2018, pp. 12–21 (2018)
22. Rossman, L.A.: The EPANET Programmer’s Toolkit for Analysis of Water Distri-
bution Systems (1999)
23. Kirkpatrick, S., Jr, C.G., Vecchi, M.: Optimization by simulated annealing. Science
220, 671–680 (1983)
24. Talbi, E.-G.: Metaheuristics: From Design to Implementation. Wiley, Hoboken
(2009)
25. Hajek, B.: Cooling schedules for optimal annealing. Math. Oper. Res. 13(2), 311–
329 (1988)
26. Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the
Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6(6),
721–741 (1984). https://doi.org/10.1109/TPAMI.1984.4767596
27. De Corte, A., Sörensen, K.: Hydrogen. http://antor.uantwerpen.be/hydrogen.
Accessed on 27 June 2018
Another random document with
no related content on Scribd:
A furious gust of wind now came tearing down the valley, bending the
trees and snapping the branches, and the lightning flashed incessantly on
every side. The scouting-party hastened to get out of the woods as
quickly as possible. It was evident, even to David, that nothing could be
done till the storm was over.
Jeduthun Cooke had been one of the most active of the scouters, and he
came home wearied and wet enough, to find that Keziah had provided
him with a hot supper, and laid out dry clothes all ready for him. He
changed his wet garments, drank a cup of coffee, and then threw himself
on the bed to catch a little sleep. He had not slept, as it seemed to him,
more than five minutes, when he was wakened by Keziah:
"'Duthun! I say, 'Duthun! Nobody has thought of looking in the vault!"
Jeduthun was on his feet, wide awake, in an instant.
"The vault!" he exclaimed. "What's gone and put that in your head,
Kissy?"
"I dunno," replied Kissy. "I got up to see if the storm was over, and it
come to me all at once."
"But Osric says they did not go to the funeral, and I'm sure I didn't see
'em there. To be sure, David Parsons mistrusted all the time that Osric
didn't tell the truth, but then I should think somebody would have seen
them."
"I can't help that," said Kissy, positively. "I'm just as sure as I can be, that
that poor child is in General Dent's vault this very minute. I feel that for
sure and certain."
When Kissy felt things "for sure and certain," there was no use in arguing
with her, as Jeduthun knew from long experience. Moreover, he was struck
with the idea himself.
"It don't seem very likely, and yet it is just possible," said he. "If I had the
key, I'd go up there this minute. Come to think of it, I have got it, or
what's as good," he exclaimed, starting up again. "Our grainery key fits
the vault-lock. I know, because the old general said so one day when he
was down at the mill. He saw me have the key, and said it looked like
his'n, and he and Mr. Antis tried it, and it just fitted. Put on your rubbers,
Kissy, and we'll go and see, anyhow. The storm's over now."
Kissy lost no time in getting ready, but she detained her husband while
she put some wood in her stove and set on a kettleful of water.
"If he's been in that damp, cold place all night, he'll be about chilled
through," she explained to her husband. "The first thing to do, will be to
put him in a warm bed and give him hot tea."
"It takes women-folks to think of everything all in a minute," said

Jeduthun, admiring his wife's talents as usual; "but suppose the young
one isn't there, after all?"
"There ain't never no harm done by getting things ready," returned

Keziah, who always liked to make her sentences as strong as possible.
"Besides, he is there! I'm just as sure as if I saw him this minute. Come
on."
But by this time, succour was approaching Christopher from another

quarter. Elsie, who had gone to bed and to sleep early, was wakened by
the lightning, which flashed sharply in at her uncurtained window. Elsie
was not afraid of lightning. She lay quietly watching the flashes and
listening to the rapidly approaching thunder, wondering where Christopher
could be, and whether they had found him.
Elsie felt very unhappy both on her own account and her brother's. She
was sorry to have Osric disgraced and punished, but she was grieved
above all that he had been so wicked. Elsie did not believe Osric's story
any more than David did. As she thought the matter over, she
remembered that Osric had come, not from the direction of the woods,
but exactly the other way, from the village. She did not believe that
Christopher would undertake to go home alone through the woods,
especially as the old story of the wild cat had been revived and talked
over only the day before. As she lay pondering over these matters, she
was started by a tremendous flash and roar coming, as it seemed, at the
same moment, and then she heard Osric, whose room was next her own,
burst into a loud fit of crying. Forgetful of all his unkindness, Elsie jumped
out of bed at once and went to her brother, whom she found burying his
head under the bedclothes and crying bitterly.
"What's the matter, Ozzy?" said she, sitting down on the bed. "Are you
afraid?"
"Yes," sobbed Osric. "The house will be struck; I know it will."
"But, Ozzy, you know that God can take care of us, even if the house is
struck. Don't you know the pretty verse we learned last Sunday?—
"'Ye winds of heaven, your force combine;
Without His high behest
Ye cannot in the mountain-pine
Disturb the sparrow's nest!'
"He will take care of us, if we ask him."
"He won't take care of me," sobbed Osric, "I have been so wicked. You
don't know how wicked I have been, Elsie. I am sorry I told such a lie
about you."
"Never mind me," said Elsie. "I am sorry you told the lie, because that
was wicked, but I don't mind about myself. But, Ozzy, if you have not told
the truth about Christopher, do tell it now!"
"Oh what a flash!" exclaimed Osric, shrinking once more. "It seemed to
come right into the window."
"It is very near," said Elsie.
"There, again! Oh, the house will be struck, I know it will, and we shall all
be killed, and what will become of Christopher?"
"Christopher!" exclaimed Elsie, catching at the words. "Oh, Ozzy, do you

know where he is? Do tell the truth, if you know. Just think how his poor
mother is feeling about him! Do tell!"
"I am afraid father will punish me again," said Osric, shrinking. "Oh dear!
What shall I do?"
"Oh, Ozzy, don't be such a coward," said Elsie, disgusted in spite of

herself. "Suppose he does? Wouldn't you rather be punished, even, than
to have poor Christopher out in this storm, and perhaps dying of fright?
Just think! If he dies in consequence of your keeping back the truth, you
will be the cause of his death. Come, do tell me! Where did you and
Christopher go?"
"We went to the funeral," said Osric, reluctantly, at last. "We watched till
Isaac went away, and then hid in the vault to see the coffin. Then Chris
was scared, and cried, and went and hid in the farther end of the vault,
and I slipped out with the bearers, and hid in a bush till the people went
away, and—and—"
"But didn't Christopher come out?" asked Elsie, struck with horror.
"I don't know whether he did or not. I never saw him. I did not think
anything about him, till you asked where he was. Oh, Elsie, where are you
going?" cried Osric as Elsie rose and went towards the door. "Don't go
away and leave me alone! Suppose the lightning should strike me!"
"I can't help it, Ozzy. I must tell father this minute, so that he can know
what to do. And if you are afraid, just think what poor Christopher must
be. How would you feel if you were shut up in the burial-vault, instead of
being safe at home? The best thing you can do is to get up and come and
tell father yourself."
"Oh, I can't! I durstn't!" cried Osric. "Elsie, do come back! Only wait till
morning, and I will tell him."
Osric cried and pleaded, but in vain. Elsie had had enough of
concealments, and she felt how much might depend on the little boy's
having timely assistance. She went down to her father's room and told
him the story. Mr. Dennison came up and questioned Osric himself, and
felt convinced that Elsie's suspicions were correct, and that Christopher
had been left in the vault.
As soon as the storm abated, he harnessed his horse, drove down to the
village as fast as possible, and seeing a light in Jeduthun's cottage, he
went straight to his door, and arrived there just as Jeduthun and Kissy
came out.
"There!" said Jeduthun, as soon as he heard the story. "Kissy, she waked
me up half an hour ago. She felt it for 'sure and certain' that Christopher
was in there, and started me out to see."
"How shall we get in?" asked Mr. Dennison.
Jeduthun explained that he had a key which would unlock the vault.
"You'd better hitch the horse under the shed," said he. "That road always
washes badly with such a heavy rain, and we shall get on faster a-foot."
"Seeing you've got company, I'll stay at home and have everything
ready," said Kissy. "You had better bring him right here the first thing. I'm
as sure you will find him, as if I see him this minute."
Three or four minutes brought the two men to the door of the vault.
Jeduthun unlocked it without difficulty, and entered, holding up his
lantern. The next moment he uttered a suppressed exclamation:
"Here he is, sure enough! Softly, squire! 'Twon't do to wake him too
sudden. See how he lies, poor lamb! Tired himself out worrying and
crying, I suppose."
Jeduthun knelt down and took the child's hand, saying gently:
"Why, Christie, what brought you here?"
But the next moment, he looked up, pale as ashes, and said in a half
whisper, "Squire, we're too late. I'm dreadful afraid he's dead."
"Dead! He can't be," exclaimed Mr. Dennison, hardly knowing what he

said. "What could kill him?"
"Fright, as likely as anything," replied Jeduthun. "But we won't give up

hope," he added as he raised Christopher's apparently lifeless body gently
in his arms. "Maybe there is life in him yet. Anyhow, we will give him a
chance."
In a few minutes, Christopher was undressed and laid in a warm bed,

while Kissy surrounded him with hot-water bottles and rubbed him
vigorously with her strong hands. David Parsons, abroad at the first dawn,
had seen Mr. Dennison and Jeduthun issue from the vault with the child,
and was at the cottage as soon as they. Mr. Dennison went for the doctor,
though there seemed little hope of his doing any good, and Mr. Parsons
rode in the other direction to fetch his sister-in-law.
Before the poor mother arrived, Christopher showed signs of returning

life, but he knew no one, and it was hard to rouse him sufficiently to
swallow the hot drinks that Kissy gave him.
Mrs. Parsons would have taken her son home, but the doctor declared
that he must not be moved, since everything depended on the most
perfect quietness.
When Christopher began to recover his strength, he showed such signs of

terror, that Doctor Henry feared for his reason. He knew no one about
him, not even his mother,—she, poor woman! was almost overcome,—but
kept calling for Osric, and begging him not to go away and leave him
alone.
"Suppose I should bring my son over to see him?" said Mr. Dennison to
the doctor.
"It can do no harm, that is certain," said Doctor Henry, "and it may be
good for him, if not for Christopher."
Osric cried, and begged to be allowed to stay at home at first, but he
yielded when his father represented to him that he might perhaps save
Christopher's life by going to see him. He shrank back in the carriage as
they drove through the village, and burst out crying at the sight of Mrs.
Parsons's pale face and the sound of Christopher's voice from the room
beyond.
"Listen to me, Osric," said Mrs. Parsons, sitting down and drawing Osric
towards her. "I am not going to reproach you. I am sure your own
conscience does that. We want you to go in and speak gently to
Christopher, and try to quiet him and make him sleep. But to do this you
must be very quiet yourself—not cry or be afraid. Will you try?"
"Yes, ma'am," answered Osric, choking down his sobs. "Oh, Mrs. Parsons,
I am so sorry that I led Christopher off!"
"I hope you are, my poor boy! Now see what you can do to repair your
fault."
The moment Christopher's eyes fell on Osric, he stretched out his hand to
him.
"Oh, Ozzy, I knew you wouldn't leave me all alone to die. But what made
you stay so long?"
"Never mind that now, Christopher," said his mother. "You see he has
come back."
"And you won't leave me again, will you?" continued Christopher, holding
Osric's hand tightly in his own. "It was very wicked to tell a lie and run
away from school, but we will confess our sins and say our prayers, and
when the angels come to take Miss Lilla to heaven, perhaps they will let
us out if we ask them. Don't you believe they will, Ozzy?"
Osric could not bear these words, and he burst into tears, and hid his face
on the pillow. His tears seemed to have a quieting effect on Christopher,
who said, soothingly, "There! Don't cry. Maybe we shall get out, after all. I
wish you could sing, Ozzy. It would make the time pass quicker. I would,
but my voice seems all gone away."
Jeduthun looked inquiringly at the doctor, who nodded in return, and he

began to sing, very softly and gently, the old lulling tune of Amsterdam.
Christopher listened with evident pleasure. His eyelids presently began to
droop, and at last he fell asleep, holding fast to Osric's hand.
"That is worth everything," whispered the doctor. "I hope he will have a
good sleep, and wake up himself. Some of you must watch and keep
everything quiet outside. Don't try to draw your hand away, Osric. Sit
quite still, and, Kissy, have some broth ready to give him, the moment he
wakes. I will come over again towards evening, and see how he gets on."
"Don't you think he will live, doctor?" whispered Osric.
"I don't know, my boy. I can tell better when he wakes. He has had a
great shock, and we cannot foresee the effects."
As Osric sat by Christopher's bed through the long morning hours, he

thought more earnestly than he had ever done before in all his life. He
saw how mean and wicked he had been—how selfish and cowardly. He
remembered how he had treated his kind little sister the night before, and
how he had lied about her. Somehow or other, Osric had always been in
the habit of thinking himself rather a good boy, because he did not swear
and use bad words, like some of the boys, or fly into a passion at every
little thing, like Tom Badger, or sulk, like his brother. But now he saw
himself in some degree as he really was, and he was ashamed and
disgusted at the sight.
"Oh how mean I have been!" he said to himself. "I wonder if I ever could
be as good as Elsie, if I were to try? Perhaps I could if I were to pray and
read the Bible as she does. I will try, anyway;" and Osric made a good
beginning by laying his head down, confessing his sins to his heavenly
Father, and begging for forgiveness and help for his Redeemer's sake.
When Christopher awoke, he was perfectly sensible, but so weak that the
doctor thought he would hardly live through the night. He rallied a little
towards morning, but for many days, he hovered between life and death,
sometimes insensible, at other times deranged and thinking himself again
in the burial-vault.
At these times, no one could quiet him like Osric. Osric stayed at
Jeduthun's cottage day and night, always at the sick boy's call, never
seeming to care for rest or amusement, or anything else, but waiting on
Christopher. These days, dreary and anxious as they were, proved the
turning-point in Osric Dennison's life. He had many long and profitable
talks with Jeduthun and Mrs. Parsons, and learned a great deal. His
devotion to his friend was of service to him in another way. Even David,
who had thought at first that he never would forgive Osric, felt his heart
soften towards him as he saw how thin and pale Ozzy grew day by day,
and how careful he was never to go out of calling distance from the
cottage, lest Christopher should want him.
David told the story to the other boys, and they all agreed that when
Osric came among them once more, they would never reproach him with
his faults, but would try and help him to be a good boy.
At last, Christopher was so much better, that the doctor said that he could
be taken home. He begged hard that Osric might go with him, and Mr.
Dennison consented, thinking justly that the lesson his son was learning
was worth more to him than any he would lose in school. Osric stayed all
summer at Mrs. Parsons's, who became much attached to him. He on his
part, was never weary of waiting on her, and Mr. Ezra Parsons said one
day that his sister had lost one son to find two.
The society of the Parsons boys was of great benefit to Osric. They were
brave, truthful, manly lads, good both at work and play, and they did their
best to make a man of him. Every one noticed the improvement when
Osric went back to school in the winter, and no one rejoiced in it more
than Elsie.
Children, when any one tries to make you do wrong by laughing at or

threatening you, remember that "the fear of man bringeth a snare," while
"the fear of God is the beginning of wisdom," and that no man can really
hurt you while you put your trust in him.
THE END.
*** END OF THE PROJECT GUTENBERG EBOOK THE DARK
NIGHT ***
Updated editions will replace the previous one—the old editions will
be renamed.
Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States copyright in
these works, so the Foundation (and you!) can copy and distribute it
in the United States without permission and without paying copyright
royalties. Special rules, set forth in the General Terms of Use part of
this license, apply to copying and distributing Project Gutenberg™
electronic works to protect the PROJECT GUTENBERG™ concept
and trademark. Project Gutenberg is a registered trademark, and
may not be used if you charge for an eBook, except by following the
terms of the trademark license, including paying royalties for use of
the Project Gutenberg trademark. If you do not charge anything for
copies of this eBook, complying with the trademark license is very
easy. You may use this eBook for nearly any purpose such as
creation of derivative works, reports, performances and research.
Project Gutenberg eBooks may be modified and printed and given
away—you may do practically ANYTHING in the United States with
eBooks not protected by U.S. copyright law. Redistribution is subject
to the trademark license, especially commercial redistribution.
START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK
To protect the Project Gutenberg™ mission of promoting the free

distribution of electronic works, by using or distributing this work (or
any other work associated in any way with the phrase “Project
Gutenberg”), you agree to comply with all the terms of the Full
Project Gutenberg™ License available with this file or online at
www.gutenberg.org/license.
Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand, agree
to and accept all the terms of this license and intellectual property
(trademark/copyright) agreement. If you do not agree to abide by all
the terms of this agreement, you must cease using and return or
destroy all copies of Project Gutenberg™ electronic works in your
possession. If you paid a fee for obtaining a copy of or access to a
Project Gutenberg™ electronic work and you do not agree to be
bound by the terms of this agreement, you may obtain a refund from
the person or entity to whom you paid the fee as set forth in
paragraph 1.E.8.
1.B. “Project Gutenberg” is a registered trademark. It may only be

used on or associated in any way with an electronic work by people
who agree to be bound by the terms of this agreement. There are a
few things that you can do with most Project Gutenberg™ electronic
works even without complying with the full terms of this agreement.
See paragraph 1.C below. There are a lot of things you can do with
Project Gutenberg™ electronic works if you follow the terms of this
agreement and help preserve free future access to Project
Gutenberg™ electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright law in
the United States and you are located in the United States, we do
not claim a right to prevent you from copying, distributing,
performing, displaying or creating derivative works based on the
work as long as all references to Project Gutenberg are removed. Of
course, we hope that you will support the Project Gutenberg™
mission of promoting free access to electronic works by freely
sharing Project Gutenberg™ works in compliance with the terms of
this agreement for keeping the Project Gutenberg™ name
associated with the work. You can easily comply with the terms of
this agreement by keeping this work in the same format with its
attached full Project Gutenberg™ License when you share it without
charge with others.
1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside the
United States, check the laws of your country in addition to the terms
of this agreement before downloading, copying, displaying,
performing, distributing or creating derivative works based on this
work or any other Project Gutenberg™ work. The Foundation makes
no representations concerning the copyright status of any work in
any country other than the United States.
1.E. Unless you have removed all references to Project Gutenberg:
1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project Gutenberg™
work (any work on which the phrase “Project Gutenberg” appears, or
with which the phrase “Project Gutenberg” is associated) is
accessed, displayed, performed, viewed, copied or distributed:
This eBook is for the use of anyone anywhere in the United
States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it away
or re-use it under the terms of the Project Gutenberg License
included with this eBook or online at www.gutenberg.org. If you
are not located in the United States, you will have to check the
laws of the country where you are located before using this
eBook.
1.E.2. If an individual Project Gutenberg™ electronic work is derived

from texts not protected by U.S. copyright law (does not contain a
notice indicating that it is posted with permission of the copyright
holder), the work can be copied and distributed to anyone in the
United States without paying any fees or charges. If you are
redistributing or providing access to a work with the phrase “Project
Gutenberg” associated with or appearing on the work, you must
comply either with the requirements of paragraphs 1.E.1 through
1.E.7 or obtain permission for the use of the work and the Project
Gutenberg™ trademark as set forth in paragraphs 1.E.8 or 1.E.9.
1.E.3. If an individual Project Gutenberg™ electronic work is posted

with the permission of the copyright holder, your use and distribution
must comply with both paragraphs 1.E.1 through 1.E.7 and any
additional terms imposed by the copyright holder. Additional terms
will be linked to the Project Gutenberg™ License for all works posted
with the permission of the copyright holder found at the beginning of
this work.
1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files containing a
part of this work or any other work associated with Project
Gutenberg™.
1.E.5. Do not copy, display, perform, distribute or redistribute this

electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1 with
active links or immediate access to the full terms of the Project
Gutenberg™ License.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if you
provide access to or distribute copies of a Project Gutenberg™ work
in a format other than “Plain Vanilla ASCII” or other format used in
the official version posted on the official Project Gutenberg™ website
(www.gutenberg.org), you must, at no additional cost, fee or expense
to the user, provide a copy, a means of exporting a copy, or a means
of obtaining a copy upon request, of the work in its original “Plain
Vanilla ASCII” or other form. Any alternate format must include the
full Project Gutenberg™ License as specified in paragraph 1.E.1.
1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™ works
unless you comply with paragraph 1.E.8 or 1.E.9.
1.E.8. You may charge a reasonable fee for copies of or providing

access to or distributing Project Gutenberg™ electronic works
provided that:
• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”
• You provide a full refund of any money paid by a user who

notifies you in writing (or by e-mail) within 30 days of receipt that
s/he does not agree to the terms of the full Project Gutenberg™
License. You must require such a user to return or destroy all
copies of the works possessed in a physical medium and
discontinue all use of and all access to other copies of Project
Gutenberg™ works.
• You provide, in accordance with paragraph 1.F.3, a full refund of

any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.
• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.
1.E.9. If you wish to charge a fee or distribute a Project Gutenberg™

electronic work or group of works on different terms than are set
forth in this agreement, you must obtain permission in writing from
the Project Gutenberg Literary Archive Foundation, the manager of
the Project Gutenberg™ trademark. Contact the Foundation as set
forth in Section 3 below.
1.F.
1.F.1. Project Gutenberg volunteers and employees expend

considerable effort to identify, do copyright research on, transcribe
and proofread works not protected by U.S. copyright law in creating
the Project Gutenberg™ collection. Despite these efforts, Project
Gutenberg™ electronic works, and the medium on which they may
be stored, may contain “Defects,” such as, but not limited to,
incomplete, inaccurate or corrupt data, transcription errors, a
copyright or other intellectual property infringement, a defective or
damaged disk or other medium, a computer virus, or computer
codes that damage or cannot be read by your equipment.
1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES - Except

for the “Right of Replacement or Refund” described in paragraph
1.F.3, the Project Gutenberg Literary Archive Foundation, the owner
of the Project Gutenberg™ trademark, and any other party
distributing a Project Gutenberg™ electronic work under this
agreement, disclaim all liability to you for damages, costs and
expenses, including legal fees. YOU AGREE THAT YOU HAVE NO
REMEDIES FOR NEGLIGENCE, STRICT LIABILITY, BREACH OF
WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE
PROVIDED IN PARAGRAPH 1.F.3. YOU AGREE THAT THE
FOUNDATION, THE TRADEMARK OWNER, AND ANY
DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE
TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL,
PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE
NOTICE OF THE POSSIBILITY OF SUCH DAMAGE.
1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND - If you

discover a defect in this electronic work within 90 days of receiving it,
you can receive a refund of the money (if any) you paid for it by
sending a written explanation to the person you received the work
from. If you received the work on a physical medium, you must
return the medium with your written explanation. The person or entity
that provided you with the defective work may elect to provide a
replacement copy in lieu of a refund. If you received the work
electronically, the person or entity providing it to you may choose to
give you a second opportunity to receive the work electronically in
lieu of a refund. If the second copy is also defective, you may
demand a refund in writing without further opportunities to fix the
problem.
1.F.4. Except for the limited right of replacement or refund set forth in
paragraph 1.F.3, this work is provided to you ‘AS-IS’, WITH NO
OTHER WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.
1.F.5. Some states do not allow disclaimers of certain implied

warranties or the exclusion or limitation of certain types of damages.
If any disclaimer or limitation set forth in this agreement violates the
law of the state applicable to this agreement, the agreement shall be
interpreted to make the maximum disclaimer or limitation permitted
by the applicable state law. The invalidity or unenforceability of any
provision of this agreement shall not void the remaining provisions.
1.F.6. INDEMNITY - You agree to indemnify and hold the
Foundation, the trademark owner, any agent or employee of the
Foundation, anyone providing copies of Project Gutenberg™
electronic works in accordance with this agreement, and any
volunteers associated with the production, promotion and distribution
of Project Gutenberg™ electronic works, harmless from all liability,
costs and expenses, including legal fees, that arise directly or
indirectly from any of the following which you do or cause to occur:
(a) distribution of this or any Project Gutenberg™ work, (b)
alteration, modification, or additions or deletions to any Project
Gutenberg™ work, and (c) any Defect you cause.
Section 2. Information about the Mission of

Project Gutenberg™
Project Gutenberg™ is synonymous with the free distribution of
electronic works in formats readable by the widest variety of
computers including obsolete, old, middle-aged and new computers.
It exists because of the efforts of hundreds of volunteers and
donations from people in all walks of life.
Volunteers and financial support to provide volunteers with the

assistance they need are critical to reaching Project Gutenberg™’s
goals and ensuring that the Project Gutenberg™ collection will
remain freely available for generations to come. In 2001, the Project
Gutenberg Literary Archive Foundation was created to provide a
secure and permanent future for Project Gutenberg™ and future
generations. To learn more about the Project Gutenberg Literary
Archive Foundation and how your efforts and donations can help,
see Sections 3 and 4 and the Foundation information page at
www.gutenberg.org.
Section 3. Information about the Project

Gutenberg Literary Archive Foundation
The Project Gutenberg Literary Archive Foundation is a non-profit
501(c)(3) educational corporation organized under the laws of the
state of Mississippi and granted tax exempt status by the Internal
Revenue Service. The Foundation’s EIN or federal tax identification
number is 64-6221541. Contributions to the Project Gutenberg
Literary Archive Foundation are tax deductible to the full extent
permitted by U.S. federal laws and your state’s laws.
The Foundation’s business office is located at 809 North 1500 West,

Salt Lake City, UT 84116, (801) 596-1887. Email contact links and up
to date contact information can be found at the Foundation’s website
and official page at www.gutenberg.org/contact
Section 4. Information about Donations to

the Project Gutenberg Literary Archive
Foundation
Project Gutenberg™ depends upon and cannot survive without
widespread public support and donations to carry out its mission of
increasing the number of public domain and licensed works that can
be freely distributed in machine-readable form accessible by the
widest array of equipment including outdated equipment. Many small
donations ($1 to $5,000) are particularly important to maintaining tax
exempt status with the IRS.
The Foundation is committed to complying with the laws regulating

charities and charitable donations in all 50 states of the United
States. Compliance requirements are not uniform and it takes a
considerable effort, much paperwork and many fees to meet and
keep up with these requirements. We do not solicit donations in
locations where we have not received written confirmation of
compliance. To SEND DONATIONS or determine the status of
compliance for any particular state visit www.gutenberg.org/donate.
While we cannot and do not solicit contributions from states where

we have not met the solicitation requirements, we know of no
prohibition against accepting unsolicited donations from donors in
such states who approach us with offers to donate.
International donations are gratefully accepted, but we cannot make

any statements concerning tax treatment of donations received from
outside the United States. U.S. laws alone swamp our small staff.
Please check the Project Gutenberg web pages for current donation
methods and addresses. Donations are accepted in a number of
other ways including checks, online payments and credit card
donations. To donate, please visit: www.gutenberg.org/donate.
Section 5. General Information About Project

Gutenberg™ electronic works
Professor Michael S. Hart was the originator of the Project
Gutenberg™ concept of a library of electronic works that could be
freely shared with anyone. For forty years, he produced and
distributed Project Gutenberg™ eBooks with only a loose network of
volunteer support.
Project Gutenberg™ eBooks are often created from several printed

editions, all of which are confirmed as not protected by copyright in
the U.S. unless a copyright notice is included. Thus, we do not
necessarily keep eBooks in compliance with any particular paper
edition.
Most people start at our website which has the main PG search
facility: www.gutenberg.org.
This website includes information about Project Gutenberg™,

including how to make donations to the Project Gutenberg Literary
Archive Foundation, how to help produce our new eBooks, and how
to subscribe to our email newsletter to hear about new eBooks.

PDF Computer Science Cacic 2018 24Th Argentine Congress Tandil Argentina October 8 12 2018 Revised Selected Papers Patricia Pesado Ebook Full Chapter

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

PDF Computer Science Cacic 2018 24Th Argentine Congress Tandil Argentina October 8 12 2018 Revised Selected Papers Patricia Pesado Ebook Full Chapter

Uploaded by

Copyright:

Available Formats

Computer Science CACIC 2018 24th

Argentine Congress Tandil Argentina

Computer Science CACIC 2019 25th Argentine Congress of

Computer Science CACIC 2019 25th Argentine Congress of

Computer Science CACIC 2017 23rd Argentine Congress La

Science of Cyber Security First International

Smart Cities First Ibero American Congress ICSC CITIES

Computer Vision Applications Third Workshop WCVA 2018

Coalgebraic Methods in Computer Science 14th IFIP WG 1

Computer Vision ACCV 2018 14th Asian Conference on

Communications in Computer and Information Science 995

Editorial Board Members

ISSN 1865-0929 ISSN 1865-0937 (electronic)

© Springer Nature Switzerland AG 2019

Welcome to the proceedings of the XXIV Argentina Congress of Computer Science

April 2019 Patricia Pesado

Edgar Chávez Michoacana University of San Nicolás de Hidalgo

Marcelo Naiouf National University of La Plata, Argentina

Network or Universities Secretary of Science, Art National University

Commission for Scientiﬁc Chamber of Business of Municipality of Tandil,

Agents and Systems

Solving the Multi-Period Water Distribution Network Design Problem

Distributed and Parallel Processing

Checkpoint and Restart: An Energy Consumption

Energy Consumption Analysis and Time Estimation Model

Technology Applied to Education

Advances in Test Personalization and Adaptation in a Virtual

Learning Objects. Case Studies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62

A Nomadic Testbed for Teaching Computer Architecture . . . . . . . . . . . . . . . 74

Graphic Computation, Images and Visualization

Evaluating an End-to-End Process for Herpetological

Color Image Enhancement Using a Multiscale Morphological Approach . . . . 109

An Approach to Automated Recognition of Pavement Deterioration

White-Box Testing Framework for Object-Oriented Programming.

Proposal for a Model of a Computer Systems Implantation

Storage Space Use in Mobile Applications . . . . . . . . . . . . . . . . . . . . . . . . . 171

Scrum Towards IRAM-ISO 9001:2015. Integrating

Databases and Data Mining

Discovering Association Rules Using R. A Case Study

D3CAS: Distributed Clustering Algorithm Applied

Market Segmentation Using Data Mining Techniques

Hardware Architectures, Networks, and Operating Systems

Heuristic Variant for the Travelling Salesman Problem.

Contention Analysis of Congestion Control Mechanisms

Innovation in Software Systems

Templates Framework for the Augmented Catalog System . . . . . . . . . . . . . . 267

Signal Processing and Real-Time Systems

Compound Interleaving Scheduling for SLM Transactions

Position and Deformation-Checking Method Based

Deep Convolutional Neural Networks for DGA Detection . . . . . . . . . . . . . . 327

Innovation in Computer Science Education

Computer Science and Schools: A Specific Didactics? . . . . . . . . . . . . . . . . . 343

Digital Governance and Smart Cities

Open Government Assessment Models Applied to Province’s Capital

Combining Artificial Intelligence Services for the Recognition

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 377

Carlos Bermudez1 , Carolina Salto1,2 , and Gabriela Minetti1(B)

Abstract. This work presents an optimization technique based on

Keywords: Water Distribution Network Design · Optimization ·

2 Multi-Period Water Distribution Network Design

as: simple-objective, multi-period, and gravity-fed. Two restrictions are consid-

Table 1. Diﬀerent solutions or network designs in vector representation.

Solution Pipe ID 1 2 3 4 5 6 7 8 Feasibility