A mixed-integer linear formulation for a capacitated facility location problem in supply chain network design

2018 ◽  
Vol 33 (1) ◽  
pp. 32
Author(s):  
Nguyen Hung Bui ◽  
Vo Hung Duong
Keyword(s):  
Supply Chain ◽  
Location Problem ◽  
Facility Location Problem ◽  
Linear Formulation ◽  
Mixed Integer ◽  
Supply Chain Network Design ◽  
Supply Chain Network ◽  
Capacitated Facility Location Problem ◽  
Capacitated Facility Location ◽  
Mixed Integer Linear Formulation

Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem

2012 ◽  
Vol 1 (1) ◽  
pp. 59-71 ◽  
Author(s):  
Igor Litvinchev ◽  
Edith L. Ozuna
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Computational Study ◽  
Facility Location Problem ◽  
Mixed Integer ◽  
Variable Cost ◽  
Fixed Cost ◽  
Two Stage ◽  
Capacitated Facility Location Problem ◽  
Capacitated Facility Location

In the two-stage capacitated facility location problem, a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost associated with opening plants and depots, and variable cost associated with both transportation stages. In this work, two different mixed integer linear programming formulations are considered for the problem. Several Lagrangian relaxations are analyzed and compared, and a Lagrangian heuristic producing feasible solutions is presented. The results of a computational study are reported.

scholarly journals A Hybrid Approach Using an Artificial Bee Algorithm with Mixed Integer Programming Applied to a Large-Scale Capacitated Facility Location Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Guillermo Cabrera G. ◽  
Enrique Cabrera ◽  
Ricardo Soto ◽  
L. Jose Miguel Rubio ◽  
Broderick Crawford ◽  
...  
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Large Scale ◽  
Location Problem ◽  
Hybrid Approach ◽  
Optimal Solution ◽  
Facility Location Problem ◽  
Mixed Integer ◽  
Capacitated Facility Location Problem ◽  
Capacitated Facility Location

We present a hybridization of two different approaches applied to the well-known Capacitated Facility Location Problem (CFLP). The Artificial Bee algorithm (BA) is used to select a promising subset of locations (warehouses) which are solely included in the Mixed Integer Programming (MIP) model. Next, the algorithm solves the subproblem by considering the entire set of customers. The hybrid implementation allows us to bypass certain inherited weaknesses of each algorithm, which means that we are able to find an optimal solution in an acceptable computational time. In this paper we demonstrate that BA can be significantly improved by use of the MIP algorithm. At the same time, our hybrid implementation allows the MIP algorithm to reach the optimal solution in a considerably shorter time than is needed to solve the model using the entire dataset directly within the model. Our hybrid approach outperforms the results obtained by each technique separately. It is able to find the optimal solution in a shorter time than each technique on its own, and the results are highly competitive with the state-of-the-art in large-scale optimization. Furthermore, according to our results, combining the BA with a mathematical programming approach appears to be an interesting research area in combinatorial optimization.

A simple and effective genetic algorithm for the two-stage capacitated facility location problem

2014 ◽  
Vol 75 ◽  
pp. 200-208 ◽  
Author(s):  
Diogo R.M. Fernandes ◽  
Caroline Rocha ◽  
Daniel Aloise ◽  
Glaydston M. Ribeiro ◽  
Enilson M. Santos ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Two Stage ◽  
Capacitated Facility Location Problem ◽  
Capacitated Facility Location
Sign in / Sign up

Export Citation Format

Share Document