The Euclidean multifacility location problem
Operations Research
Mathematical Programming: Series A and B
Dynamic Programming
A continuous analysis framework for the solution of location-allocation problems with dense demand
Computers and Operations Research
| Hi-index | 0.00 |
In this paper, we extend the ordinary discrete type facility location problems to continuous type ones. Unlike the discrete type facility location problem in which the objective function isn‘t everywhere differentiable, the objective function in the continuous type facility location problem is strictly convex and continuously differentiable. An algorithm without line search for solving the continuous type facility location problems is proposed and its global convergence, linear convergence rate is proved. Numerical experiments illustrate that the algorithm suggested in this paper have smaller amount of computation, quicker convergence rate than the gradient method and conjugate direction method in some sense.