The dynamic uncapacitated hub location problem

Transportation Science

Volumn 45, Issue 1, 2011, Pages 18-32

  Contreras, Ivan ^a,b   Cordeau, Jean François ^a,b   Laporte, Gilbert ^a,b  

^a HEC MONTRÉAL   (Canada)

^b INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Branch and bound; Dynamic hub location; Lagrangian relaxation

Indexed keywords

BRANCH AND BOUND METHOD; LAGRANGE MULTIPLIERS; TREES (MATHEMATICS);

BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL BURDEN; HUB LOCATION; HUB LOCATION PROBLEMS; LAGRANGIAN FUNCTIONS; LAGRANGIAN RELAXATION; LOWER AND UPPER BOUNDS; NUMERICAL RESULTS;

LOCATION;

EID: 79951885279     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1100.0326     Document Type: Article

References (27)

1. Albareda-Sambola, M., E. Fernández, Y. Hinojosa, J. Puerto. 2008. The multi-period incremental service facility location problem. Comput. Oper. Res. 36 1356-1375.
2. Alumur, S., B. Y. Kara. 2008. Network hub location problems: The state of the art. Eur. J. Oper. Res. 190 1-21. (Pubitemid 351434635)
3. Billionnet, A., S. Elloumi. 1992. Placement de tâches dans un système distribué et dualité lagrangienne. RAIRO (Recherche Opérationelle) 26 83-97.
4. Brännlund, U. 1995. A generalized subgradient method with relaxation step. Math. Programming 71 207-219.
5. Camerini, P. M., L. Fratta, F. Maffioli. 1975. On improving relaxation methods by modified gradient techniques. Math. Programming Stud. 3 26-34.
6. Campbell, J. F. 1990. Locating transportation terminals to serve an expanding demand. Transportation Res. Part B 3 173-192.
7. Campbell, J. F. 1994. Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72 387-405.
8. Campbell, J. F., A. T. Ernst, M. Krishnamoorthy. 2002. Hub location problems. Z. Drezner, H. W. Hamacher, eds. Facility Location: Applications and Theory. Springer, Heidelberg, Germany, 373-408.
9. Cánovas, L., M. Landete, A. Marín. 2006. New formulations for the uncapacitated multiple allocation hub location problem. Eur. J. Oper. Res. 172 274-292.
10. Chardaire, P., A. Sutter, M. C. Costa. 1996. Solving the dynamic facility location problem. Networks 28 117-124.
11. Contreras, I., J. A. Díaz, E. Fernández. 2009. Lagrangian relaxation for the capacitated hub location problem. Oper. Res. Spectrum 31 483-505.
12. Crowder, H. 1976. Computational improvements for subgradient optimization. Symposia Mathematica (Convegno sulla Programmazione Matematica e sue Applicazioni, INDAM, Roma, 1974), Vol. 19. Academic Press, London.
13. Current, J. R., S. J. Ratick, C. S. ReVelle. 1998. Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach. Eur. J. Oper. Res. 110 597-609.
14. Drezner, Z. 1995. Dynamic facility location: The progressive p-median problem. Location Sci. 3 1-7. (Pubitemid 26432190)
15. Ernst, A., M. Krishnamoorthy. 1998. Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res. 104 100-112. (Pubitemid 128392273)
16. Hamacher, H. W., M. Labbé, S. Nickel, T. Sonneborn. 2004. Adapting polyhedral properties from facility to hub location problems. Discrete Appl. Math. 145 104-116.
17. Marín, A. 2005. Uncapacitated Euclidean hub location: Strengthened formulation, new facets and a relax-and-cut algorithm. J. Global Optim. 33 393-422. (Pubitemid 41641503)
18. Melo, M. T., S. Nickel, F. Saldanha da Gama. 2006. Dynamic multicommodity capacitated facility location: A mathematical modeling framework for strategic supply chain planning. Comput. Oper. Res. 33 181-208. (Pubitemid 40915206)
19. O'Kelly, M. E. 1986. The location of interacting hub facilities. Transportation Sci. 20 92-106.
20. O'Kelly, M. E. 1992. Hub facility location with fixed costs. Papers in Regional Sci. 20 293-306. (Pubitemid 23370291)
21. O'Kelly, M. E., D. L. Bryan. 1992. Hub location with flow economies of scale. Transportation Res. Part B 32 605-616.
22. Rhys, J. 1970. A selection problem of shared fixed costs and networks. Management Sci. 17 200-207.
23. Savelsbergh, M. 2009. Dynamic load planning for less-thantruckload carriers. Transportation and Logistics Workshop. Chile.
24. Sherali, H. D., O. Ulular. 1989. A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems. Appl. Math. Optim. 20 193-221. (Pubitemid 20656373)
25. Skorin-Kapov, D., J. Skorin-Kapov, M. E. O'Kelly. 1997. Tight linear programming relaxations of uncapacitated p-hub median problems. Eur. J. Oper. Res. 94 582-593. (Pubitemid 126391963)
26. Van Roy, T. J., D. Erlenkotter. 1982. A dual-based procedure for dynamic facility location. Management Sci. 28 1091-1105.
27. Warszawski, A. 1973. Multi-dimensional location problems. Oper. Res. Quart. 24 165-179.