DocumentCode
518020
Title
Notice of Retraction
An improved scatter search algorithm for capacitated p-median problem
Author
Xianrui Xu ; Xiang Li ; Xiaojie Li ; Hui Lin
Author_Institution
Key Lab. of Geogr. Inf. Sci., East China Normal Univ., Shanghai, China
Volume
2
fYear
2010
fDate
16-18 April 2010
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
This paper proposes a heuristic algorithm to solve the capacitated p-median problem. First, initial solutions are constructed by a new method of assigning demand points through delineating medians´ service areas, and then a local search method based on contour-rectangle is adopted to promote the efficiency of neighborhood solution search. Finally, the path re-linking algorithm is combined to expand the searching scope of neighborhood solution to improve the quality of solution. We have designed two groups of experiments to validate the proposed algorithm.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
This paper proposes a heuristic algorithm to solve the capacitated p-median problem. First, initial solutions are constructed by a new method of assigning demand points through delineating medians´ service areas, and then a local search method based on contour-rectangle is adopted to promote the efficiency of neighborhood solution search. Finally, the path re-linking algorithm is combined to expand the searching scope of neighborhood solution to improve the quality of solution. We have designed two groups of experiments to validate the proposed algorithm.
Keywords
optimisation; search problems; capacitated p-median problem; contour rectangle; delineating medians service areas; heuristic algorithm; improved scatter search algorithm; local search method; neighborhood solution search; path re-linking algorithm; Algorithm design and analysis; Clustering algorithms; Computer networks; Electronic mail; Geoscience; Heuristic algorithms; Information science; Partitioning algorithms; Scattering; Search methods; λ-Interchange; CPMP; Neighborhood Solution; Scatter Search; Shift-Insertion;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Engineering and Technology (ICCET), 2010 2nd International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-6347-3
Type
conf
DOI
10.1109/ICCET.2010.5485454
Filename
5485454
Link To Document