Minimization methods for non-differentiable functions
Minimization methods for non-differentiable functions
A cross decomposition algorithm for capacitated facility location
Operations Research
Lagrangean decomposition: A model yielding stronger lagrangean bounds
Mathematical Programming: Series A and B
A method for solving to optimality uncapacitated location problems
Annals of Operations Research
Optimal Order Allocation with Discount Pricing
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Video-on-demand server selection and placement
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Computers and Operations Research
Expert Systems with Applications: An International Journal
A computational study of a nonlinear minsum facility location problem
Computers and Operations Research
Determination of the locations and capacities of sugar cane loading stations in Thailand
Computers and Industrial Engineering
Applied p-median and p-center algorithms for facility location problems
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
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.