Variable Neighbourhood Search for Uncapacitated Warehouse Location Problems

Kemal Alaykiran, Mehmet Hacibeyoglu

Uncapacitated warehouse location problem (UWLP) is one of the basic problems of operations research and supply chain management literature. In this paper, four variations of variable neighbourhood search (VNS) algorithms are used where the first three are fundamental algorithms which are used and proposed in the literature where the fourth one is a hybrid use of iterated local search (ILS) and variable neighbourhood search (VNS), to solve the instances at a well-known and studied problem set. There are 15 problem instances with increasing number of potential warehouses and customers in this set. The results show that the proposed variation of the algorithm outperforms the traditional versions of variable neighbourhood search.