Abstract
The objective of the p-dispersion problem is to choose p out of n given points, such that the minimum distance between any pair of chosen points is as large as possible. Possible application areas include location theory and multicriteria optimization. The p-dispersion problem is known to be NP-hard. In this paper, we examine 10 heuristic methods for solving this problem, and provide a comparison of them based on several criteria. We report our computational experience with the heuristics on randomly generated planar problems of different sizes. Most of the heuristics generate very good solutions with very little computational effort on a microcomputer. We suggest performing multiple applications of several heuristics to minimize the possibility of finding poor solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
