The pallet-loading problem solution with the use of heuristic algorithms

Abstract

Abstract The paper focuses on solving the problems of scheduling and delivery problems using heuristic algorithms. The planning of delivery schedule and truck loading made by employees may not be optimal in terms of time and costs, which might lead to delays and excessive expenses. Such leads to a necessity of optimization these delivery problems with heuristic algorithms. As a solution of these problems was analysed a type of heuristic algorithm - Tabu Search. The goals of this work were to examine the possibility of applying this algorithm to improve the efficiency of the delivery service in general and to organize the pallets layout during delivery in particular. To validate and verify the effectiveness of the methodology, this work was carried out in cooperation with an enterprise that distributes cabinet furniture. The main task of delivery system in this case study was to determine the pallets organization in the luggage boot of a truck in a way of optimal correlation with a route. Based on the optimization results, it can be established that the reviewed method might be considered as satisfactorily successful. By comparing the optimized route and pallet layout with the one obtained by empirical and intuitive methods of route and organization, the former obtained a shorter delivery time, and consequently reduced logistics costs. This work demonstrate that heuristic algorithms can be used to find a solution close to optimal in a relatively short period of time and are acceptable from a practical point of view.