A Heuristic Algorithm for Constrained Multi-Source Location Problem with Closest Distance under Gauge: The Variational Inequality Approach. (27th October 2013)

• Record Type: Journal Article
• Authors: Jiang, Jian-Lin; Assani, Saeed; Cheng, Kun; Zhu, Xiao-Xing
• Other Names: Bnouhachem Abdellah Academic Editor.
• Is Part Of: Abstract and applied analysis. Volume 2013(2013)
• Publication Date: 2013-10-27
• Subjects: Mathematical analysis -- Periodicals; Mathematical analysis; Applied Mathematics; Mathematical Analysis; Periodicals; 515.05
• DOI: 10.1155/2013/624398
• Languages: English
• ISSNs: 1085-3375

Abstract

Abstract : This paper considers the locations of multiple facilities in the space R p, with the aim of minimizing the sum of weighted distances between facilities and regional customers, where the proximity between a facility and a regional customer is evaluated by the closest distance. Due to the fact that facilities are usually allowed to be sited in certain restricted areas, some locational constraints are imposed to the facilities of our problem. In addition, since the symmetry of distances is sometimes violated in practical situations, the gauge is employed in this paper instead of the frequently used norms for measuring both the symmetric and asymmetric distances. In the spirit of the Cooper algorithm (Cooper, 1964), a new location-allocation heuristic algorithm is proposed to solve this problem. In the location phase, the single-source subproblem with regional demands is reformulated into an equivalent linear variational inequality (LVI), and then, a projection-contraction (PC) method is adopted to find the optimal locations of facilities, whereas in the allocation phase, the regional customers are allocated to facilities according to the nearest center reclassification (NCR). The convergence of the proposed algorithm is proved under mild assumptions. Some preliminary numerical results are reported to show the effectiveness of the new algorithm.