heuristic methods based on minlp formulation for reliable capacitated facility location problems

Authors

mohammad rohaninejad shahed university

amirhossein amiri shahed university

mahdi bashiri shahed university

abstract

this paper addresses a reliable facility location problem with considering facility capacity constraints. in reliable facility location problem some facilities may become unavailable from time to time. if a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. hence, the fail of facilities leads to disruptions in facility location decisions and this problem is an attempt to reducing the impact of these disruptions. in order to formulate the problem, a new mixed-integer nonlinear programming (minlp) model with the objective of minimizing total investment and operational costs is presented. due to complexity of minlp model, two different heuristic procedures based on mathematical model are developed. finally, the performance of the proposed heuristic methods is evaluated through executive numerical example. the numerical results show that the proposed heuristic methods are efficient and provide suitable solutions.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Heuristic Methods Based on MINLP Formulation for Reliable Capacitated Facility Location Problems

This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...

full text

An effective heuristic for large-scale capacitated facility location problems

The Capacitated Facility Location Problem (CFLP) consists of locating a set of facilities with capacity constraints to satisfy the demands of a set of clients at the minimum cost. In this paper we propose a simple and effective heuristic for largescale instances of CFLP. The heuristic is based on a Lagrangean relaxation which is used to select a subset of “promising” variables forming the core ...

full text

A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location

We consider a generalized version of the rooted Connected Facility Location Problem (ConFL) with capacities and prizes on clients as well as capacity constraints on potential facilities. Furthermore, we are interested in selecting and connecting the most profitable client subset (i.e. a prize collecting variant) instead of mandatorily connecting all clients. Connected Facility Location Problems...

full text

Uncapacitated and Capacitated Facility Location Problems

The uncapacitated facility location problem ( UFLP) involves locating an undetermined number of facilities to minimize the sum of the (annualized) fixed setup costs and the variable costs of serving the market demand from these facilities. UFLP is also known as the “simple” facility location problem SFLP, where both the alternative facility locations and the customer zones are considered discre...

full text

Capacitated facility location/network design problems

We introduce a combined facility location/network design problem in which facilities have constraining capacities on the amount of demand they can serve. This model has a number of applications in regional planning, distribution, telecommunications, energy management, and other areas. Our model includes the classical capacitated facility location problem (CFLP) on a network as a special case. W...

full text

Improved Approximation Algorithms for Capacitated Facility Location Problems

In a surprising result, Korupolu, Plaxton, and Rajaraman [13] showed that a simple local search heuristic for the capacitated facility location problem (CFLP) in which the service costs obey the triangle inequality produces a solution in polynomial time which is within a factor of 8+ ǫ of the value of an optimal solution. By simplifying their analysis, we are able to show that the same heuristi...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of industrial engineering and productional research-

جلد ۲۶، شماره ۳، صفحات ۲۲۹-۲۴۶

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023