An approach for solving competitive location problems with variable demand using multicore systems

作者：Arrondo A G^*; Fernandez J; Redondo J L; Ortigosa P M

来源：Optimization Letters, 2014, 8(2): 555-567.

DOI：10.1007/s11590-012-0596-z

• Continuous location
• Variable demand
• Evolutionary algorithm
• Weiszfeld algorithm
• Parallel algorithms
• OpenMP

A planar competitive location and design problem with variable demand is considered. The assumption that the demand may vary depending on the conditions of the market makes the problem more realistic, but it also increases its complexity, and therefore, the computational effort needed to solve it. In this paper, a modification of a heuristic recently proposed to cope with the problem is presented, which allows, on the one hand, to obtain the same solutions as the original heuristic more quickly and, on the other hand, to handle larger size problems. Furthermore, a parallel version of the algorithm, suitable for being run in most of today%26apos;s personal computers, has also been proposed. The parallel algorithm has been implemented using the OpenMP library and the results show an ideal efficiency up to at least eight processors (the largest number of available processing elements). The effectiveness of the parallel algorithm has also been measured. From the computational results, it can be inferred that the proposed parallelization is robust.

• 出版日期2014-2