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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.