Capacitated Facility Location Problem with Variable Coverage Radius in Distribution System

Authors

  • B. Bankian Tabrizi Graduate student of Industrial Engineering, Iran University of Science and Technology
  • M. Moshref Javadi Graduate student of Industrial Engineering, Iran University of Science and Technology
  • M. S Jabalameli Associate Professor of Industrial Engineering, Iran University of Science and Technology
Abstract:

  The problem of locating distribution centers (DCs) is one of the most important issues in design of supply chain. In previous researches on this problem, each DC could supply products for all of the customers. But in many real word problems, DCs can only supply products for customers who are in a certain distance from the facility, coverage radius. Thus, in this paper a multi-objective integer linear programming (MOILP) model is proposed to locate DCs in a two-echelon distribution system. In this problem, customers who are in the coverage radius of the DCs can be supplied. Moreover, we suppose that the coverage radius of each DC can be controlled by decision maker and it is a function of the amount of money invested on the DC. Finally, a random generated problem is used to verify the model and the computational results are presented .

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Distribution Centers Reliability Cost in Capacitated Facility Location Problem

Recently studies in area of supply chain network (SCN) have focused on the disruption issues in distribution systems. Also this paper extends the previous literature by providing a new biobjective model for cost minimization of designing a three echelon SCN across normal and failure scenarios with considering multi capacity option for manufacturers and distribution centers. Moreover, in order t...

full text

Capacitated Facility Location With Distance-Dependent Coverage Under Demand Uncertainty

We consider a facility location problem to determine the points of dispensing medicine or supplies in a large-scale emergency. For this problem we consider capacitated facilities, a distance-dependent coverage function, and demand uncertainty. We formulate a special case of the maximal covering location problem (MCLP) with a loss function, to account for the distance-sensitive demand, and chanc...

full text

The Capacitated Mobile Facility Location Problem

The capacitated mobile facility location problem (CMFLP) arises in logistics planning of community outreach programs delivered via mobile facilities. It adds capacity restrictions to the mobile facility location problem introduced previously by Demaine et al. [2009], thereby extending the problem to a practical setting. In the problem, one seeks to relocate (or move) a set of existing facilitie...

full text

Capacitated facility location problem with general setup cost

This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered. The setup costs consist of a fixed term (site setup cost) plus a second term (facility setup costs). The facility setup cost functions are generally non-linear functions of the size of the facility in the same site. T...

full text

Approximation algorithms for Capacitated Facility Location Problem with Penalties

In this paper, we address the problem of capacitated facility location problem with penalties (CapFLPP) paid per unit of unserved demand. In case of uncapacitated FLP with penalties demands of a client are either entirely met or are entirely rejected and penalty is paid. In the uncapacitated case, there is no reason to serve a client partially. Whereas, in case of CapFLPP, it may be beneficial ...

full text

A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 21  issue 4

pages  231- 237

publication date 2010-12

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023