Capacitated facility location problem with general setup cost

Capacitated facility location problem with general setup cost

0.00 Avg rating0 Votes
Article ID: iaor20071617
Country: United Kingdom
Volume: 33
Issue: 5
Start Page Number: 1226
End Page Number: 1241
Publication Date: May 2006
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics, programming: integer
Abstract:

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. Two equivalent mixed integer linear programming (MIP) models are formulated for the problem and solved by general MIP solver. A Lagrangian heuristic algorithm (LHA) is also developed to find approximate solutions for this NP-hard problem. Extensive computational experiments are taken on randomly generated data and also well-known existing data (with some necessary modifications). The detailed results are provided and the heuristic algorithm is shown to be efficient.

Reviews

Required fields are marked *. Your email address will not be published.