Parallel Genetic Algorithm for Capacitated P-median Problem

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, the authors look for best ways how to use all computing power that is in their disposal. The obvious method to achieve that is to design parallel algorithm and let it run on a high performance computing cluster.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01646545
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 26 2017 3:16PM