p.1352
p.1358
p.1362
p.1368
p.1376
p.1380
p.1387
p.1393
p.1397
A Computational Method for the Solution of Optimizing Facility Location Problem in the Non-Convex Set
Abstract:
Facility location problems arise for planning and stationing serve centers including waste disposal sites, hospitals, distribution centers, post offices, and fire stations. The single facility location problem can be modeled by a fixed point problem. Commonly the definition set of variables are requested as a convex set. In real world applications, the collection of feasible sites to locate always is non-convex set. The contribution of this paper is to apply the theorem of existence of the solution of fixed point problem to discuss the facility location problem in non-convex definition set of variables and obtain the computational result. Numerical example shows that the numerical method by tracing the homotopy pathway with predictor-corrector is an effective method to solving the facility location problem and a global optimal solution can be obtained.
Info:
Periodical:
Pages:
1376-1379
Citation:
Online since:
December 2014
Price:
Сopyright:
© 2015 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: