Abstract
In this article, a new PMACO algorithm is proposed for capacitated P-Median Problem (CPMP). It devised a set of performing strategies of Ant Colony Algorithm (ACO) in view of the characteristic of CPMP. These strategies include the selecting strategy of initial medians, the pheromone learning strategy of object-assignment means and pheromone-smoothness strategy. They insure the PMACO algorithm can solve the CPMP effectively, which was proved by the computational results. The comparability of Text Clustering Problem (TCP) and CPMP inspired us to employ the PMACO algorithm solving the TCP. As a result, we used the improved PMACO to solve the TCP and obtained preferable result. This exploited the new method of using the ACO to settle TCP self-adaptively.
Sign-in/Register to access full text options 
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.
