An oil pipeline design problem

被引:40
作者
Brimberg, J
Hansen, P
Lih, KW
Mladenovic, N
Breton, M
机构
[1] Royal Mil Coll Canada, Dept Business Adm, Kingston, ON K7K 7B4, Canada
[2] Ecole Hautes Etud Commerciales, Montreal, PQ H3T 2A7, Canada
[3] AT&T Labs Res, Middletown, NJ 07748 USA
[4] Serbian Acad Sci, Math Inst, Belgrade, Serbia
关键词
D O I
10.1287/opre.51.2.228.12786
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:228 / 239
页数:12
相关论文
共 53 条
[1]  
AARTS EHL, 1985, PHILIPS J RES, V40, P193
[2]  
[Anonymous], 1995, OPT DAYS MONTR
[3]  
[Anonymous], 1997, Tabu Search
[4]  
[Anonymous], PARTITIONING DATA SE
[5]   Network design using cut inequalities [J].
Barahona, F .
SIAM JOURNAL ON OPTIMIZATION, 1996, 6 (03) :823-837
[6]  
Bertele U, 1972, NONSERIAL DYNAMIC PR
[7]   Strong inequalities for capacitated survivable network design problems [J].
Bienstock, D ;
Muratore, G .
MATHEMATICAL PROGRAMMING, 2000, 89 (01) :127-147
[8]   Minimum cost capacity installation for multicommodity network flows [J].
Bienstock, D ;
Chopra, S ;
Gunluk, O ;
Tsai, CY .
MATHEMATICAL PROGRAMMING, 1998, 81 (02) :177-199
[9]  
Bienstock D., 1996, INFORMS Journal on Computing, V8, P243, DOI 10.1287/ijoc.8.3.243
[10]  
Bousba C., 1991, Annals of Operations Research, V33, P285, DOI 10.1007/BF02071977