The facility location problem with Bernoulli demands

Omega

Volumn 39, Issue 3, 2011, Pages 335-345

  Albareda Sambola, Maria ^a   Fernández, Elena ^a   Saldanha da Gama, Francisco ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

Location; Stochastic programming

Indexed keywords

EID: 77957102816     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2010.08.002     Document Type: Article

References (37)

1. Albareda-Sambola M., Fernández E., Laporte G. Heuristic and lower bounds for a stochastic location routing problem. European Journal of Operational Research 2007, 179:940-955.
2. Albareda-Sambola M., van der Vlerk M.H., Fernández E. Exact solutions to a class of stochastic generalized assignment problems. European Journal of Operational Research 2006, 173:465-487.
3. Averbakh I., Berman O. Minimax regret p-center location on a network with demand uncertainty. Location Science 1997, 5:247-254.
4. Averbakh I., Berman O. Minmax regret median location on a network under uncertainty. INFORMS Journal on Computing 2000, 12:104-110.
5. Averbakh I., Berman O. An improved algorithm for the minmax regret median problem on a tree. Networks 2003, 41:97-103.
6. Balakrishnan J., Cheng C.H. The dynamic plant layout problem: incorporating rolling horizons and forecast uncertainty. OMEGA 2009, 37:165-177.
7. Berladi P., Bruni M.E. A probabilistic model applied to emergency service vehicle location. European Journal of Operational Research 2009, 196:323-331.
8. Berman O., Simchi-Levi D. Finding the optimal a priori tour and location of a traveling salesman with nonhomogeneous customers. Transportation Science 1988, 22:148-154.
9. Bianchi L., Campbell A.M. Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem. European Journal of Operational Research 2007, 176:131-144.
10. Brandeau M.L., Chiu S.S. An overview of representative problems in location research. Management Science 1989, 35:645-674.
11. Carrizosa E., Conde E., Muñoz M. Admission policies in loss queueing models with heterogeneous arrivals. Management Science 1998, 44:311-320.
12. Carrizosa E., Nickel S. Robust facility location. Mathematical Methods in Operations Research 2003, 58:331-349.
13. Conde E. A branch and bound algorithm for the minimax regret spanning arborescence. Journal of Global Optimization 2007, 37:467-480.
14. Conde E. Minmax regret location-allocation problem on a network under uncertainty. European Journal of Operational Research 2007, 179:1025-1039.
15. Contreras I, Díaz JA, Fernández E. Branch and price for large-scale capacitated hub location problems with single assignment. INFORMS Journal on Computing, 2010. doi:. http://10.1287/ijoc.1100.0391.
16. Díaz J.A., Fernández E. A branch-and-price algorithm for the single source capacitated plant location problem. Journal of the Operational Research Society 2002, 53:728-740.
17. Fernández E., Hinojosa Y., Puerto J. Filtering policies in loss queuing-location problems. Annals of Operations Research 2005, 136:259-283.
18. Hua Z., Li S. Impacts of demand uncertainty on retailers dominance and manufacturer-retailer supply chain cooperation. OMEGA 2008, 36:697-714.
19. ILOG concert technology 2.9 user's manual; 2009. http://www.ilog.com/products/optimization/tech/concert.cfm.
20. ILOG CPLEX 12.1 user's manual; 2009. http://www.ilog.fr/products/cplex/.
21. Jaillet P. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operations Research 1988, 36:929-936.
22. Kaya O. Outsourcing vs. in-house production: a comparison of supply chain contracts with effort dependent demand. Omega 39 (2011) 168-178.
23. Laporte G., Louveaux F.V., Mercure H. An exact solution for the a priori optimization of the probabilistic traveling salesman problem. Operations Research 1994, 42:543-549.
24. Laporte G., Louveaux F.V., Van Hamme L. Exact solution to a location problem with stochastic demands. Transportation Science 1994, 28:95-103.
25. Louveaux F. Stochastic location analysis. Location Science 1993, 1:127-154.
26. Louveaux F.V., Peeters D. A dual-based procedure for stochastic facility location. Operations Research 1992, 40:564-573.
27. Marianov V., ReVelle C. The queueing maximal availability location problem: a model for the siting of emergency vehicles. European Journal of Operational Research 1996, 93:110-120.
28. Pan K., Lai K.K., Liang L., Leung C.H. Two-period pricing and ordering policy for the dominant retailer in a two-echelon supply chain with demand uncertainty. OMEGA 2009, 37:919-929.
29. Reinelt G. Tsplib95 documentation; 2010. http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/.
30. ReVelle C. Review, extension and prediction in emergency service siting. European Journal of Operational Research 1989, 40:58-69.
31. Riis M, Andersen KA. Capacitated network design with uncertain demand. INFORMS Journal on Computing 2002;247-60.
32. Romeijn HE, Shu J, Teo CP. Designing two-echelon supply networks. European Journal of Operational Research 2007;449-62.
33. Shen Z.-J.M., Coullard C., Daskin M.S. A joint location-inventory model. Transportation Science 2003, 37:40-55.
34. Simchi-Levi D., Kaminsky P., Simchi-Levi E. Managing the supply chain: the definitive guide for the business professional 2004, McGraw-Hill.
35. Snyder L.V. Facility location under uncertainty: a review. IIE Transactions 2006, 38:537-554.
36. Toregas C., Swain R., ReVelle C. The location of emergency service facilities. Operations Research 1971, 19:1363-1373.
37. Wagner M.R., Bhadury J., Peng S. Risk management in uncapacitated facility location models with random demands. Computers & Operations Research 2009, 36:1002-1011.