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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimizing Dynamic Warehouse Location Problems Using a Stochastic Search


    Contributors:


    Publication date :

    2023-08-25


    Size :

    446709 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    IDENTIFYING WAREHOUSE LOCATION USING HIERARCHICAL CLUSTERING

    Sebastjan ŠKERLIČ / Robert MUHA | DOAJ | 2016

    Free access

    A warehouse location-routing problem

    Perl, Jossef / Daskin, Mark S. | Elsevier | 1985


    WAREHOUSE LOCATION NUMBERING CONVERSION FOR AERIAL INVENTORY DRONE

    HONG SOON / KIM YOUNG | European Patent Office | 2024

    Free access

    WAREHOUSE LOCATION NUMBERING CONVERSION FOR AERIAL INVENTORY DRONE

    HONG SOON HAC / KIM YOUNG JOON | European Patent Office | 2024

    Free access

    Solving Hub Location Problems With Profits Using Variable Neighborhood Search

    Zhang, Chunxiao / Sun, Xiaoqian / Dai, Weibin et al. | Transportation Research Record | 2022