Lagrangian heuristics for the location-allocation problem with stochastic demand and congestion

Saini, Pratibha ; Jayaswal, Sachin ; Vidyarthi, Navneet

Document Type: Conference presentation
Year of publication: 2018
Conference title: European Conference on Operational Research
Location of the conference venue: Valencia, Spain
Date of the conference: July 8-11, 2018
Related URLs:
Publication language: English
Institution: Business School > Service Operations Management (Schön 2014-)
Subject: 650 Management
Keywords (English): Location-allocation , Stochastic demand , Queueing , Congestion , Lagrangian Relaxation , Lagrangian Decomposition
Abstract: Location-allocation problems with stochastic demand and congestion (LAPSDC) arise in several planning contexts that require deciding the location of service facilities and their capacities; and the allocation of the stochastic demand of the user zones to the located service facilities. Examples include location of emergency medical clinics; preventive healthcare centers; refuse collection and disposal centers; stores and service centers; bank branches and automated banking machines; internet mirror sites; web service providers (servers); and distribution centers in supply chains. The problem seeks to simultaneously determine the location and capacities of service facilities, and allocate user’s stochastic demand to these facilities such that the total cost, which consists of the fixed cost of opening facilities with sufficient capacities, the access cost of users’ travel to facilities, as well as the congestion cost at the facilities as a result of user’s waiting due to stochastic demand rate and service times, is minimized. We present two approaches, namely Lagrangian relaxation and Lagrangian decomposition, to obtain lower bounds to the problem. While lower bounds are provided by the Lagrangian sub-problems, two heuristics are proposed that uses the solution of the sub-problems to construct an over-all feasible solution. Computational results to test the two approaches in terms of lower bound and optimality gap are presented.

Metadata export


+ Search Authors in

+ Page Views

Hits per month over past year

Detailed information

You have found an error? Please let us know about your desired correction here: E-Mail

Actions (login required)

Show item Show item