RT Journal Article
T1 Global search metaheuristics for planning transportation of multiple petroleum products in a multi-pipeline system
A1 Cruz García, Jesús Manuel de la
A1 Andrés Toro, Bonifacio de
A1 Herrán, A.
AB The objective of this work is to develop several metaheuristic algorithms to improve the efficiency of the MILP algorithm used for planning transportation of multiple petroleum products in a multi-pipeline system. The problem involves planning the optimal sequence of products assigned to each new package pumped through each polyduct of the network in order to meet product demands at each destination node before the end of the planning horizon. All the proposed metaheuristics are combinations of improvement methods applied to solutions resulting from different construction heuristics. These improvements are performed by searching the neighborhoods generated around the current solution by different Global Search Metaheuristics: Multi-Start Search, Variable Neighborhood Search, Taboo Search and Simulated Annealing. Numerical examples are solved in order to show the performance of these metaheuristics against a standard commercial solver using MILP. Results demonstrate how these metaheuristics are able to reach better solutions in much lower computational time. (C) 2011 Elsevier Ltd. All rights reserved.
PB Pergamon-Elsevier Science LTD
SN 0098-1354
YR 2012
FD 2012-02-10
LK https://hdl.handle.net/20.500.14352/43914
UL https://hdl.handle.net/20.500.14352/43914
LA eng
NO © 2011 Elsevier Ltd. The authors would like to thank the Spanish Science and Technology Ministry for their support through project DPI2002-02924 and Madrid
NO Spanish Science and Technology Ministry
NO Madrid Autonomous Community
DS Docta Complutense
RD 23 abr 2025