In this paper, the dynamic warehouse location problem is considered. A Tabu search algorithm (TSA) is proposed to solve the problem. The procedure is tested on three generated benchmark problems. The small-sized problem includes 25 customers, 3 potential warehouse locations, and 3 planning horizon periods. The medium-sized problem consists of 50 customers, 5 potential warehouse locations, and 5 periods of the planning horizon. The large-sized problem consists of 100 customers, 10 potential warehouse locations, and 10 periods of the planning horizon. The proposed algorithm was compared with a solution method for mixed-integer linear programming in a cloud, CPLEX. The proposed algorithm provides reasonable solutions, while CPLEX could not provide solutions for medium and large problems in the limited computation time.
Optimizing Dynamic Warehouse Location Problems Using a Stochastic Search
2023-08-25
446709 byte
Conference paper
Electronic Resource
English
A warehouse location-routing problem
Elsevier | 1985
|WAREHOUSE LOCATION NUMBERING CONVERSION FOR AERIAL INVENTORY DRONE
European Patent Office | 2024
|WAREHOUSE LOCATION NUMBERING CONVERSION FOR AERIAL INVENTORY DRONE
European Patent Office | 2024
|Solving Hub Location Problems With Profits Using Variable Neighborhood Search
Transportation Research Record | 2022
|