Abstract
This paper presents an implementation of a specific genetic algorithm on a high performance computing cluster. The algorithm is designed to approximately solve the capacitated p-median problem. Since the p-median problem has been proven to be NP-hard, exact algorithms are not efficient in solving it in reasonable time. Therefore it is helpful to use metaheuristics like genetic algorithm. In an endeavor to obtain the best solution, even for large instances, we look for best ways how to use all computing power that is in our disposal. The obvious method to achieve that is to design parallel algorithm and let it run on a high performance computing cluster.
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.
