Hub location under hub congestion and demand uncertainty: The Brazilian case study

Pesquisa Operacional

Volumn 31, Issue 2, 2011, Pages 319-349

  de Miranda Junior, Gilberto ^a   de Camargo, Ricardo Saraiva ^a   Pinto, Luiz Ricardo ^a   Conceição, Samuel Vieira ^a   Ferreira, Ricardo Poley Martins ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Benders decomposition; Demand uncertainty; Hub and spoke networks; Large scale optimization; Mixed integer non linear programming

Indexed keywords

EID: 80051749330     PISSN: 01017438     EISSN: 16785142     Source Type: Journal    
DOI: 10.1590/S0101-74382011000200007     Document Type: Article

References (73)

1. Albareda-Sambola M, FERNANDEZ E & LAPORTE G. 2007. Heuristic and lower bound for a stochastic location-routing problem. European Journal of Operational Research, 179(3): 940-955.
2. ALUMUR S & KARA BY. 2008. Network hub location problems: The state of the art. European Journal of Operational Research, 190: 1-21.
3. AYKIN T. 1994. Lagragian relaxation based approaches to capacitated hub-and-spoke network design problem. European Journal of Operational Research, 79: 501-523.
4. AYKIN T. 1995. Network policies for hub-and-spoke systems with applications to the air transportation system. Transportation Science, 29: 201-221.
5. BALAS E & BERGTHALLER C. 1983. Benders method revisited. Journal of Computational and Applied Mathematics, 9: 3-12.
6. BENDERS JF. 1962. Partitioning procedures for solving mixed-variables programming problems. Numerisch Mathematik, 4: 238-252.
7. BOLAND N, KRISHNAMOORTHY M, ERNST A & EBERY J. 2004. Preprocessing and cutting for multiple allocation hub location problem. European Journal of Operational Research, 155: 638-653.
8. CAI X, MCKINNEY DC, LASDON LS & WATKINS JR DW. 2001. Solving large nonconvex water resources management models using generalized Benders decompositon. Operations Research, 49(2): 235-245.
9. CAMARGO RS, MIRANDA G & LUNA HPL. 2009. Benders decomposition for hub location problems with economies of scale. Transportation Science, 43: 86-97.
10. CAMARGO RS DE, MIRANDA JR G, FERREIRA RPM & LUNA HP. 2009. Multiple allocation hub-and-spoke network design under hub congestion. Computers and Operations Research, 36(12): 3097-3106.
11. CAMARGO RS DE, MIRANDA JR G & LUNA HP. 2008. Benders decomposition for the uncapacitated multiple allocation hub location problem. Computers and Operations Research, 35(4): 1047-1064.
12. CAMPBELL JF. 1994. Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72: 387-405.
13. CAMPBELL JF. 1994. A survey of network hub location. Studies in Locational Analysis, 6: 31-49.
14. CAMPBELL JF, ERNST AT & KRISHNAMOORTHY M. 2002. Hub location problems. In: DREZNER Z & HAMACHER HW (Eds.). Facility Location: Application and Theory, pages 373-407. Springer.
15. CAMPBELL JF, ERNST AT & KRISHNAMOORTHY M. 2005. Hub arc location problems: Part I - Introduction on results. Management Science, 51(10): 1540-1555.
16. CAMPBELL JF, ERNST AT & KRISHNAMOORTHY M. 2005. Hub arc location problems: Part II - Formulations and optimal algorithms. Management Science, 51(10): 1556-1571.
17. CAMPBELL JF, STIEHR G, ERNST AT & KRISHNAMOORTHY M. 2003. Solving hub arc location problems on a cluster of workstations. Parallel Computing, 29: 555-574.
18. CAMPBELL JF. 1992. Location and allocation for distribution systems with transshipments and transportation economies of scale. Annals of Operations Research, 40: 77-99.
19. CANTOR DG & GERLA M. 1974. Optimal routing in a packet-swiched computer network. IEEE Transations on Computers, c-23(10): 1062-1069, October.
20. CORDEAU JF, SOUMIS F & DESROSIERS J. 2000. A Benders decomposition approach for the locomotive and car assignment problem. Transportation Science, 34: 133-149.
21. CORDEAU JF, SOUMIS F & DESROSIERS J. 2001. Simultaneous assignment of locomotives and cars to passenger trains. Operations Research, 49(4): 531-548.
22. COSTA M DA G, CAPTIVO ME & CL ́I MACO J. 2008. Capacitated single allocation hub location problem - a bi-criteria approach. Computers and Operations Research, 35: 3671-3695.
23. EBERY J, KRISHNAMOORTHY M, ERNST A & BOLAND N. 2000. The capacitated multiple allocation hub location problema: Formulations and algorithms. European Journal of Operational Research, 120: 614-631.
24. ELHEDHLI S & HU FX. 2005. Hub-and-spoke network design with congestion. Computers & Operations Research, 32: 1615-1632.
25. ERNST AT & KRISHNAMOORTHY M. 1996. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4: 139-154.
26. ERNST AT & KRISHNAMOORTHY M. 1998. Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research, 104: 100-112.
27. ERNST AT & KRISHNAMOORTHY M. 1999. Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86: 141-159.
28. FRANÇA PM & LUNA HPL. 1982. Solving stochastic transportation-location problem by generalized benders decomposition. Transportation Science, 16(2): 113-126.
29. FRANK M & WOLFE P. 1956. An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3: 95-110.
30. FRATTA M, GERLA M & KLEINROCK L. 1973. The flow deviation method: An approach to storeand-forward communication network design. Networks, 3: 97-133.
31. GABOR AF & VAN OMMEREN JCW. 2006. An approximation algorithm for a facility location problem with stochastic demands and inventories. Operations Research Letters, 34(3): 257-263.
32. GEOFFRION AM & GRAVES GW. 1974. Multicomodity distribution system design by Benders decomposition. Management Science, 20: 822-844.
33. GEOFFRION AM. 1972. Generalized Benders decomposition. Journal of optimization Theory and Applications, 10(4): 237-260.
34. GERLA M. 1973. The Design of Store-and-Forward (S/F) Networks for Computer Communications. PhD thesis, University of California, Los Angeles, EUA.
35. GILLEN D & LEVINSON D. 1999. The full cost of air travel in the california corridor. In: PRESENTED IN THE 78th ANNUAL MEETING OF TRANSPORTATION RESEARCH BOARD, Washington, DC, January, 10-14.
36. GROVE GP & O'kelly ME. 1986. Hub networks and simultated schedule delay. Papers of the Regional Science Association, 59: 103-119.
37. HAMACHER HW, LABBÉ M, NICKEL S & SONNEBORN T. 2004. Adapting polyhedral properties from facility to hub location problems. Discrete Applied Mathematics, 145: 104-116.
38. HERAGU SS & CHEN J-S. 1998. Optimal solution of cellular manufacturing system design: Benders decomposition approach. European Journal of Operational Research, 107: 175-192.
39. HOANG HH. 2005. Topological optimization of networks: A nonlinear mixed integer model employing generalized benders decomposition. IEEE Transations on Automatic Control, AC-27: 164-169.
40. HOCHREITER R & PFLUG GC. 2007. Financial scenario generation for stochastic multistage decision processes as facility location problems. Annals of Operations Research, 152: 257-272.
41. KARA BY & TANSEL BC. 2003. The latest arrival hub location problem. Management Science, 47: 1408-1420.
42. KLINCEWICZ JG. 1998. Hub location in backbone/tributary network design: a review. Location Science, 6: 307-335.
43. KUBY MJ & ROBERT G. 1993. The hub network design problem with stopovers and feeders: The case of federal express. Transportation Research A, 27: 01-12.
44. LABBÉ M, YAMAN H & GOURDIN E. 2005. A branch and cut algorithm for hub location problems with single assignment. Mathematical Programming, 102: 371-405.
45. LAPORTE G, LOUVEAUX FV & MERCURE H. 1989. Models and exact-solutions for a class of stochastic location-routing problems. European Journal OF Operational Research, 39(1): 71-78.
46. LAPORTE G, LOUVEAUX FV & VANHAMME L. 1994. Exact solution to a location problem with stochastic demands. Transportation Science, 28(2): 95-103.
47. LASDON LS. 1970. Optimization Theory for Large Systems. Macmillan, London.
48. LOUVEAUX FV & PEETERS D. 1992. A dual-based procedure for stochastic facility location. Operations Research, 40(3): 564-573.
49. MAGNANTI TL, MIRCHANDANI P & WONG RT. 1986. Tailoring Benders decomposition for uncapacitated network design. Mathematical Programming Study, 26: 112-154.
50. MAGNANTI TL & WONG RT. 1981. Accelerating benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research, 29(3): 464-483.
51. MAHEY P, BENCHAKROUN A & BOYER F. 2001. Capacity and flow assignment of data networks by generalized benders decomposition. Journal of Global Optimization, 20(2): 169-189.
52. MAHEY P, OUOROU A, LEBLANC L & CHIFFLET J. 1998. A new proximal decomposition algorithm for routing in telecommunication networks. Networks, 31: 227-238.
53. MARIANOV V & SERRA D. 2003. Location models for airline hubs behaving as m/d/c queues. Computers and Operations Research, 30: 983-1003.
54. Marín A. 2005. Formulating and solving splittable capacitated multiple allocation hub location problems. Computer and Operations Research, 32: 3093-3109.
55. MARÍN A, CÁNOVAS L & LANDETE M. 2006. New formulations for the uncapacitated multiple allocation hub location problem. European Journal of Operational Research, 172: 274-292.
56. McDaniel D & DEVINE M. 1977. A modified Benders partitioning algorithm for mixed integer programming. Management Science, 24(3): 312-319, November.
57. MIRANDA G JR. 2004. Facility Location and Network Design with Congestion Costs and Interdependency. PhD thesis, Universidade Federal de Minas Gerais, Departamento de Cîencia da Computação.
58. O'kelly ME. 1986. The location of interacting hub facilities. Transportation Science, 20: 92-106.
59. O'kelly ME. 1987. A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32: 393-404.
60. O'kelly ME & BRYAN DL. 1998. Hub location with flow economies of scale. Transportation Research Part B, 32(8): 605-616.
61. O'kelly ME, BRYAN DL, Skorin-Kapov D & Skorin-Kapov J. 1996. Hub network design with single and multiple allocation: A computational study. Location Science, 4(3): 125-138.
62. O'kelly ME & MILLER HJ. 1994. The hub network design problem. Journal of Transport Geography, 2: 31-40.
63. OUOROU O, LUNA HPL & MAHEY P. 2001. Multicommodity network expansion under elastic demands. Optimization and Engineering, 2: 277-292.
64. RANDAZZO CD & LUNA HP. 2001. A comparison of optimal methods for local access uncapacitated network design. The Annals of Operations Research, 106: 263-286.
65. RODRIGUEZ V, ALVAREZ MJ & BARCOS L. 2007. Hub location under capacity constraints. Transportation Research Part E, 43: 495-505.
66. Rodriguez-Martin I & Salazar-Gonzalez JJ. 2008. Solving a capacitated hub location problem. European Journal of Operational Research, 184: 468-479.
67. ROSING KE & HODGSON MJ. 2002. Heuristic concentration for the p-median: an example demonstrating how and why it works. Computers and Operations Research, 29: 1317-1330.
68. ROSING KE & REVELLE CS. 1997. Heuristic concentration: two stage solution construction. European Journal of Operational Research, 97: 75-86.
69. SNYDER LV & DASKIN MS. 2006. Stochastic p-robust location problems. IIE Transactions, 38(11): 971-985.
70. SNYDER LV, DASKIN MS & TEO CP. 2007. The stochastic location model with risk pooling. European Journal of Operational Research, 179(3): 1221-1238.
71. SRIDHAR VV & PARK JS. 2000. Benders-and-cut algorithm for fixed-charge capacitated network design problem. European Journal of Operational Research, 125: 622-632.
72. YAMAN H & CARELLO G. 2005. Solving the hub location problem with modular link capacities. Computers and Operations Research, 32: 3227-3245.
73. YAMAN H, KARA BY & TANSEL BC. 2007. The latest arrival hub location problem for cargo delivery systems with stopovers. Transportation Research Part B, 41: 906-919.