A parallel local search approach to solving the uncapacitated warehouse location problem

摘要

The uncapacitated warehouse location problem (UWLP) has been studied by many researchers. It has been solved using various approaches, including branch and bound linear programming, tabu search, simulated annealing, and genetic algorithms. This study presents a new local search (LS) approach to the UWLP that is quite simple and robust and is efficient in some cases. The algorithm was tested against standard OR Library benchmarks and M* instances, which have already been used to test other approaches. The results show that the only disadvantage of the algorithm is the exponential growth of its computation time with the problem size. However, the multi-search design suggested here enables the algorithm to run under multi-processor or multi-core systems, which are currently provided as part of standard PC configurations.