Optimal Capacities in Discrete Facility Location Design Problem

Authors

  • Mohammad Reza Yadoolahpour Isfahan University of Tech.
  • Soheila Kavosh Isfahan University of Tech.
Abstract:

Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be an FLP (Facility Location Problem). However, if links can be added to the network at a reasonable cost, the problem will then be a combination of facility location and NDP (Network Design Problem) hence, called FLNDP (Facility Location Network Design Problem), a more general variant of FLP. In previous studies of this problem, capacity of facilities was considered to be a constraint while capacity of links was not considered at all. The proposed MIP model considers capacity of facilities and links as decision variables. This approach increases the utilization of facilities and links, and prevents the construction of links and location of facilities with low utilization. Furthermore, facility location cost (link construction cost) in the proposed model is supposed to be a function of the associated facility (link) capacity. Computational experiments as well as sensitivity analyses performed indicate the efficiency of the model.

Download for Free

Sign up for free to access the full text

Already have an account?login

similar resources

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 24  issue 1

pages  81- 89

publication date 2013-02

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