A TSSA algorithm based approach to enhance the performance of warehouse system

Abstract

Abstract-In this plethora of increased competitiveness and globalization the effective management of the warehouse system is a challenging task. Realizing that proper scheduling of the warehouses is necessary to outperform the competitors on cost, lead time, and customer service basis (Koster, 1998); the proposed research focuses on optimization of warehouse scheduling problems. This research aims to minimize the total tardiness so that the overall time involved in managing the inventory inside the warehouse could be effectively reduced. This research also deals with the vehicle routing issues in the warehousing scenario and considers various constraints, and decision variables, directly influencing the undertaken objective so as to make the model more realistic to the real world environment. The authors have also proposed a hybrid Tabu Sample-sort Simulated Annealing (TSSA) algorithm to reduce the tardiness as well as to enhance the performance of the warehousing system. The proposed TSSA algorithm inherits the merits of the Tabu Search and Sample-sort Annealing algorithm. The comparative analysis of the results of the TSSA algorithm with other algorithms such as Simulated Annealing (SA), Tabu Search (TS), and Hybrid Tabu Search algorithms indicates it's superiority over others, both in terms of computational time as well as total tardiness reduction.