Parallelization of an Algorithm for Finding Facility Locations for an Entering Firm Under Delivered Pricing.
Juana L. Redondo, I. García, Pilar M. Ortigosa, Blas Pelegrı́n, Pascual Fernández · 2005
This work presents the parallelization of an algorithm for finding facility locations for an entering firmwhich has to make decisions on the locations of its facilities as well as on its price setting in order to maximize profit. This combinatorial location problem is solved by GASUB, a new multimodal genetic algorithm with subpopulation support. The high computational requirements of the location problem demands the parallelization of the method. In this work two standard strategies have been implemented and compared. The first one follows a master-slave model, and the second strategy is a coarse-grain parallelization.