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

Authors:
Tunchan Cura
Affiliations:
Istanbul University, Faculty of Business Administration, Quantitative Methods, Turkey
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 3
Cited 2

On the quality of local search for the quadratic assignment problem

Discrete Applied Mathematics
Local Optimization and the Traveling Salesman Problem

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Solving the uncapacitated facility location problem using tabu search

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search

Theoretical entropy assessment of fingerprint-based Wi-Fi localization accuracy

Expert Systems with Applications: An International Journal
SCaNME: Location tracking system in large-scale campus Wi-Fi environment using unlabeled mobility map

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.