A robust optimization model for p-median problem with uncertain edge lengths
- 262 Downloads
In this paper, we propose a p-median problem with uncertain edge lengths where uncertainty is characterized by given intervals. The uncertainty in edge lengths may appear in transportation costs or travel times along the edges in any network location problem. Minimax regret approach is a promising tool to cope with uncertainty in network location problems. However, minimax regret algorithms normally suffer from complexity, and they are time consuming. We propose a robust optimization approach to obtain the robust linear counterpart for the same class of the nominal p-median problem. The performance of the proposed model is compared with minimax regret approach through a simple but illustrative example, and results are discussed in more details.
KeywordsLocation Networks Robust optimization Linearization
Unable to display preview. Download preview PDF.
- 5.Handler GY, Mirchandani PB (1979) Location on networks, theory and applications. MIT Press, Cambridge, MAGoogle Scholar
- 6.Berman O, Krass D (2002) Facility location problems with stochastic demands and congestion. In: Drezner Z, Hamacher HW (eds) Location analysis: applications and theory, 329–371 (Chapter 11)Google Scholar
- 8.Berman O, Wang J (2006) The 1-median and 1-antimedian with uniform distributed demand. INFORGoogle Scholar
- 14.Kouvelis P, Vairaktarakis G, Yu G (1994) Robust 1-median location on a tree in the presence of demand and transportation cost uncertainty. Working Paper 93/94-3-4, Department of Management Science and Information Systems, Graduate School of Business, The University of Texas at Austin, Austin, TXGoogle Scholar
- 24.Wu TH, Low C, Wu WT (2004) A tabu search approach to the cell formation problem. The International Journal of Advanced Manufacturing 23:916–924Google Scholar
- 33.ReVelle C, Swain RW (1970) Central facilities location. Geogr Anal 2:30–42Google Scholar