Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem

Author(s):  
Geraldo Regis Mauri ◽  
Fabrício Lacerda Biajoli ◽  
Rômulo Louzada Rabello ◽  
Antônio Augusto Chaves ◽  
Glaydston Mattos Ribeiro ◽  
...  
2014 ◽  
Vol 75 ◽  
pp. 200-208 ◽  
Author(s):  
Diogo R.M. Fernandes ◽  
Caroline Rocha ◽  
Daniel Aloise ◽  
Glaydston M. Ribeiro ◽  
Enilson M. Santos ◽  
...  

2012 ◽  
Vol 1 (1) ◽  
pp. 59-71 ◽  
Author(s):  
Igor Litvinchev ◽  
Edith L. Ozuna

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.


Sign in / Sign up

Export Citation Format

Share Document