This paper, proposes an exact algorithm for the problem of locating a pipeline between two points of a network, as well as a set of safety valves which help control the damage caused by possible spills along the pipeline. A labelling approach is developed to determine simultaneously the optimal pipeline and valve locations, with the objective of optimising an impact measure that depends on the average number of accidents and their cost. Computational experiments on grid and random instances are presented in order to evaluate the algorithm's performance and to compare its results to the solutions provided by sequential approaches. Copyright © 2012 Inderscience Enterprises Ltd.
The pipeline and valve location problem
Pascoal M.
2012-01-01
Abstract
This paper, proposes an exact algorithm for the problem of locating a pipeline between two points of a network, as well as a set of safety valves which help control the damage caused by possible spills along the pipeline. A labelling approach is developed to determine simultaneously the optimal pipeline and valve locations, with the objective of optimising an impact measure that depends on the average number of accidents and their cost. Computational experiments on grid and random instances are presented in order to evaluate the algorithm's performance and to compare its results to the solutions provided by sequential approaches. Copyright © 2012 Inderscience Enterprises Ltd.| File | Dimensione | Formato | |
|---|---|---|---|
|
12EJIE.pdf
Accesso riservato
:
Publisher’s version
Dimensione
398.83 kB
Formato
Adobe PDF
|
398.83 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
