离散p扩散问题的连续化算法.pdfVIP

Operations Research and Fuzziology 运筹与模糊学, 2014, 4, 7-14 /10.12677/orf.2014.41002 Published Online February 2014 (/journal/orf.html) An Efficient Lagrangian Smoothing Heuristic for the p-Dispersion-Sum Problem Yujun Gong, Huimin Zou School of Mathematics and System Sciences, Beihang University, Beijing Email: gyjgongzuo@163.com, 245278793@ Received: Apr. 24th , 2013; revised: May 5th , 2013; accepted: May 7th , 2013 Copyright © 2014 Yujun Gong, Huimin Zou. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. In accordance of the Creative Commons Attribution License all Copyrights © 2014 are reserved for Hans and the owner of the intellectual property Yujun Gong, Huimin Zou. All Copyright © 2014 are guarded by law and by Hans as a guardian. Abstract: In this article, we propose a Lagrangian smoothing algorithm for the p-dispersion-sum problem (PDSP), a problem to locate p facilities at some of n predefined locations by maximizing the distance sum between the p established facilities, where the continuation subproblems are solved by the truncated Frank- Wolfe algorithm. We make the iteration from Lagrangian function to penalty function by controlling a para- meter. We establish practical stopping criteria and prove that our algorithm finitely terminates at a KKT point. Compared to the discrete algorithm, the smoothing algorithm is free from the constraints of the number of nodes and more extensive. Numerical results indicate that our approach outperforms good and rapid for solv- ing randomly generated problems in dimensional n ≥ 100.