Article ID: | iaor20033231 |
Country: | United States |
Volume: | 51 |
Issue: | 2 |
Start Page Number: | 228 |
End Page Number: | 239 |
Publication Date: | Mar 2003 |
Journal: | Operations Research |
Authors: | Hansen Pierre, Brimberg Jack, Lih Keh-Wei, Mladenovi Nenad, Breton Michle |
Keywords: | optimization, programming: branch and bound |
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.