An oil pipeline design problem

Operations Research

Volumn 51, Issue 2, 2003, Pages

  Brimberg, Jack ^a,b   Hansen, Pierre ^c   Lih, Keh Wei ^d   Mladenović, Nenad ^b,e   Breton, Michèle ^b,c  

^a ROYAL MILITARY COLLEGE OF CANADA   (Canada)

^b GERAD   (Serbia)

^c HEC MONTRÉAL   (Canada)

^d AT AND T LABS RESEARCH   (United States)

^e MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

Industries, petroleum natural gas: oil pipeline network design; Networks graphs, applications: design problem formulation and analysis; Programming, integer, algorithms: interactive branch and bound with valid inequalities

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COSTS; CRUDE PETROLEUM; HYDROCARBONS; OIL FIELDS; OIL WELLS; OPTIMIZATION; PETROLEUM TRANSPORTATION; PROBLEM SOLVING; PRODUCT DESIGN;

OIL TRANSPORTATION; PIPELINE DESIGN; PRODUCTION MANAGEMENT;

PIPELINES;

EID: 4344657226     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.51.2.228.12786     Document Type: Article

References (53)

1. Aarts, E. H. L., P. J. M. van Laarhoven. 1985. Statistical cooling: A general approach to combinatorial optimization problems. Philips J. Res. 40 193.
2. Barahona, F. 1996. Network design using cut inequalities. SIAM J. Optim. 6 823-837.
3. Bertelè U., R Brioschi. 1972. Nonserial Dynamic Programming. Academic Press, New York.
4. Bienstock, D., O. Gunluk. 1996. Capacitated network design-Polyhedral structure and computation. INFORMS J. Comput. 8 243-260.
5. _, G. Muratore. 2000. Strong inequalities for capacitated survivable network design problems. Math. Programming, Ser. A 89 127-147.
6. _, S. Chopra, O. Gunluk, C-Y. Tsai. 1998. Minimum cost capacity installation for multicommodity network flows. Math. Programming 81 177-199.
7. Bousba, C., L. Wolsey. 1991. Finding minimum cost directed trees with demands and capacities. Ann. Oper. Res. 33 285-303.
8. Brimberg, J., N. Mladenović. 1996. A variable neighborhood algorithm for solving the continuous location-allocation problem. Stud. Locational Anal. 10 1-12.
9. Bulfin, R. L., C-Y. Liu. 1985. Optimal allocation of redundant components for large systems. IEEE Trans. Reliability R-34(3) 241-247.
10. Carter, R. G. 1998. Pipeline optimization: Dynamic programming after 30 years. Stoner Associates Inc., Houston, TX.
11. Chang, S-K. 1976. A model for distributed computer system design. IEEE Trans. Systems, Man, Cybernetics SMC-5(6) 344-359.
12. Chern, M-S., R-H. Jan. 1986. Reliability optimization problems with multiple constraints. IEEE Trans. Reliability R-35(4) 431-436.
13. Chu, Y., T. Liu. 1965. On the shortest arborescence of a directed graph. Sciencia Sinica 4 1396-1400.
14. Dolan, W. B., P. T. Cummings, M. D. LeVan. 1989. Process optimization via simulated annealing: Application to network design. AIChE J. 35(5) 725-736.
15. Edmonds, J. 1967. Optimum branching. J. Res. National Bureau Standards 71B 233-240.
16. Frisch, I. T. 1975. Technical problems in nationwide networking and interconnection. IEEE Trans. Comm. COM-23(1) 78-88.
17. Glover, F. 1989. Tabu search part I. ORSA J. Comput. 1(3) 190-206.
18. _. 1990. Tabu search part II. ORSA J. Comput. 2(1) 4-32.
19. _, M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Boston, MA.
20. _, H. Sherali, Y. Lee. 1997. Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming. Comput. Optim. Appl. 8(2) 151-172.
21. Golden, B., M. Ball, L. Bodin. 1981. Current and future research directions in network optimization. Comput. Oper. Res. 8(2) 71-81.
22. Guignard, M., M. B. Rosenwein. 1990. An application of Lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. Networks 20(3) 1087-1093.
23. Hansen, P., B. Jaumard. 1990. Algorithms for the maximum satisfiability problem. Computing 44(4) 279-303.
24. _, N. Mladenović. 2001. Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130 449-467.
25. _, B. Jaumard, N. Mladenović. 1994. How to choose k entities among n. I. Cox, P. Hansen, B. Julesz, eds. Partitioning Data Sets. DIMACS, Rutgers, NJ, 105-116.
26. _, E. Pedrosa Filho, C. Ribeiro.1992. Location and sizing of offshore platforms for oil exploration. Eur. J. Oper. Res. 58 202-214.
27. Hochbaum, D. S., A. Segev. 1989. Analysis of a flow problem with fixed charges. Networks 19(3) 291-312.
28. Huang, Z., A. Seireg. 1985. Optimization in oil and gas pipeline engineering. J. Energy Resources Tech. 107(2) 264-267.
29. Karp, R. M. 1971. A simple derivation of Edmond's algorithm for optimum branching. Networks 1 265-272.
30. _. 1972. Reducibility among combinatorial problems. R. E. Miller, J. W. Thatcher, eds. Complexity of Computer Computations. Plenum Press, New York, 85-103.
31. Kirkpatrick, S., C. D. Gelatt, M. P. Vecchi. 1983. Optimization by simulated annealing. Sciences 220 671-680.
32. Lih, K-W. 1993. Applications of zero-one linear programming with multiple-choice constraints. Ph.D. thesis, Rutgers University, Rutgers, NJ.
33. Mah, R. S., M. Shacham. 1978. Pipeline network design and synthesis. Adv. Chemical Engrg. 10 125-209.
34. McKeown, P. G., C. T. Ragsdale. 1990. A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems. Comput. Oper. Res. 17(1) 9-16.
35. Minoux, M. 1975. Multicommodity dynamic flows of minimal updated cost. Annales des Télécommunications 30(12) 51-58.
36. _. 1976. Minimum cost multicommodity flows with concave cost functions. Annales des Télécommunications 31(34) 77-92.
37. Mladenović, N. 1995. Variable neighborhood algorithm - A new metaheuristic for combinatorial optimization. Optim. Days. Montreal, Quebec, Canada, 112.
38. _, P. Hansen. 1997. Variable neighborhood search. Comput. Oper. Res. 24 1097-1100.
39. _, J. Petric, R. Gledhill. 1993. Spanning tree and arborescence at random. B. Papathanasiu, ed. Proc. Second Balkan Conf. Oper. Res. Thessaloniki, Greece, 611-620.
40. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley, New York.
41. Olorunniwo, F. O., P. A. Jensen. 1982a. Dynamic sizing and locationing of facilities on natural gas transmission networks. Engrg. Optim. 6 95-109.
42. _, _. 1982b. Optimal capacity expansion policy for natural gas transmission network: A decomposition approach. Engrg. Optim. 6 13-30.
43. Ragsdale, C. T., P. G. McKeown. 1991. An algorithm for solving fixed-charge problems using surrogate constraints. Comput. Oper. Res. 18(1) 87-96.
44. Rosenthal, A. 1982. Dynamic programming is optimal for nonserial optimization problems. SIAM J. Comput. 11(1) 47-59.
45. Rothfarb, B., M. Goldstein. 1971. The one-terminal telpak prob-lem. Oper. Res. 19 156-169.
46. _, H. Frank, D. M. Rosenbaum, K. Steiglitz, D. J. Kleitman. 1970. Optimal design of offshore natural-gas pipeline systems. Oper. Res. 18(6) 992-1020.
47. 2 ) simplex algorithm for a class of linear programs with tree structure. Eur. J. Oper. Res. 21(2) 225-232.
48. Stoer, M., G. Dahl. 1994. A polyhedral approach to multicommodity survivable network design. Numerische Mathematik 68 149-167.
49. Tarjan, R. E. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1 146-160.
50. Tinhofer, G. 1984. Rational solutions of the graphsack problem. Math. Programming 28(3) 337-348.
51. Toth, P., D. Vigo. 1995. An exact algorithm for the capacitated shortest spanning arborescence. Ann. Oper. Res. 61 121-141.
52. Winter, P. 1987. Steiner problem in networks: A survey. Networks 17 129-167.
53. Yoo, C., D. Tcha. 1986. A cross decomposition procedure for the facility location problem with a choice of facility type. Comput. Indus. Engrg. 10 283-290.