The Warehouse Location Problem in the Context of Vehicle Routing Problem in the Production Companies

Abstract

This paper presents warehouse location-routing problem in the logistics network. In order to solve this problem the location model was developed. The limitations and the optimization criterion of the model were determined. The optimization criterion refers to the distance between the facilities of the network. The final location of warehouse facilities was obtained using an ant algorithm. This paper describes the stages of the ant algorithm i.e. the stage of designating the probability of transition of ants to the other points of the route, update pheromone. In this paper the process of calibration of this algorithm was presented. The results of the ant algorithm were compared with the random results.