The Capacitated Location-Allocation Problem with Interval Parameters

Subject Areas : طراحی آزمایشات

Hassan  Shavandi ¹ (Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran,)

Received: 2008-12-03 Accepted : 2009-02-12 Published : 2010-02-07

Keywords: Location, Capacitated, Covering, Interval Parameters, Genetic Algorithms,

Abstract :

In this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. We also consider flexibility on distance standard for covering demand nodes by the servers. We use the satisfaction degree to represent the constraint of service capacity. The proposed model belongs to the class of mixed integer programming models. Our model can be reduced to the p-median problem in polynomial time so it is NP-Hard. A genetic algorithm is proposed to solve the developed model and experimental results of solving the model are presented.