|
Brunel University Research Archive (BURA) >
University >
Publications >
Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/6680
|
| Title: | An oil pipeline design problem |
| Authors: | Brimberg, J Hansen, P Lih, KW Mladenović, N Breton, M |
| Keywords: | Networks/graphs, applications: Design problem-formulation and analysis Programming, integer, algorithms: Interactive branch-and-bound with valid inequalities Industries, petroleum/natural gas: Oil pipeline network design |
| Publication Date: | 2003 |
| Publisher: | INFORMS |
| Citation: | Operations Research, 51(2): 228 - 239, Mar 2003 |
| Abstract: | We consider a given set of offshore platforms and onshore wells producing known (or estimated) amounts of oil to be connected to a port. Connections may take place directly between platforms, well sites, and the port, or may go through connection points at given locations. The configuration of the network and sizes of pipes used must be chosen to minimize construction costs. This problem is expressed as a mixed-integer program, and solved both heuristically by Tabu Search and Variable Neighborhood Search methods and exactly by a branch-and-bound method. Two new types of valid inequalities are introduced. Tests are made with data from the South Gabon oil field and randomly generated problems. |
| Description: | Copyright @ 2003 INFORMS |
| Sponsorship: | The work of the first author was supported by NSERC grant #OGP205041. The work of the second author was supported by FCAR (Fonds pour la Formation des Chercheurs et l’Aide à la Recherche) grant #95-ER-1048, and NSERC grant #GP0105574. |
| URI: | http://or.journal.informs.org/content/51/2/228.short http://bura.brunel.ac.uk/handle/2438/6680 |
| DOI: | http://dx.doi.org/10.1287/opre.51.2.228.12786 |
| ISSN: | 0030-364X |
| Appears in Collections: | Mathematics Information Systems and Computing School of Information Systems, Computing and Mathematics Research Papers Publications
|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.
|