Use este identificador para citar ou linkar para este item: http://repositorio.ufc.br/handle/riufc/73627
Tipo: Artigo de Periódico
Título: A depth-first search algorithm for optimizing the gravity pipe networks layout
Autor(es): Rodrigues, Gustavo Paiva Weyne
Costa, Luis Henrique Magalhães
Farias, Guilherme Marques
Castro, Marco Aurélio Holanda de
Palavras-chave: Gravity pipe networks;Optimal layout;Depth-first search algorithm;Search algorithms
Data do documento: 2019
Instituição/Editor/Publicador: Water Resources Management
Citação: RODRIGUES, Gustavo Paiva Weyne; COSTA, Luis Henrique Magalhães; FARIAS, Guilherme Marques; CASTRO, Marco Aurélio Holanda de. A depth-first search algorithm for optimizing the gravity pipe networks layout. Water Resources Management, [S. l.], v. 33, p. 4583-4598, 2019.
Abstract: The layout is displayed in one of the most complex tasks in the gravity pipe network project because there are several factors to consider and often a choice of unassociated or smaller layout. Currently, the designer’s experience is needed so different layout alternatives be analyzed to reduce the depths of the network. Generally, this operation is manual and does not ensure the best result. For this research, a depth-first search algorithm was presented, which allows the optimization of the layout of a gravity pipe network, assessing the topographic conditions of the manholes (nodes), leading to a layout that has the sum of lower unfavorable slopes. A hypothetical and a real network were used. The computational time required was considered negligible. The results showed a robust model, which works for the complete layout of any network, of any size, resulting in the lowest possible depths.
URI: http://www.repositorio.ufc.br/handle/riufc/73627
ISSN: 1573-1650
Tipo de Acesso: Acesso Aberto
Aparece nas coleções:DEHA - Artigos publicados em revista científica

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
2019_art_gpwrodrigues1.pdf954,26 kBAdobe PDFVisualizar/Abrir


Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.