Solving Problem of Routing Drug Distribution Vehicle Routing in Tabriz City with Time Window by Bat Metabolism Algorithm

Document Type : Original Article

Authors

1 bonab

2 qazvin

Abstract

There have been many studies on how to model problem types, develop problem assumptions to adapt to real-world application conditions, and develop or develop problem-solving methods to obtain better results. In this paper, we aim to use single-target bat algorithm for drug distribution process in Tabriz metropolitan area in order to solve the problem of vehicle routing with time window. Due to the continuous nature of the metadata algorithm, how it is generated and decoded, a new routing solution is designed that gives the shortest transport path in the shortest possible time. In this regard, the distribution of the drug has been considered by Mohyadaru Distribution Company, a non-technical business-service company. In order to evaluate the performance of the proposed method, issues of different dimensions have been applied based on the actual issues related to drug delivery to existing pharmacies in the city of Tabriz by Mohyadaroo Company. The results show that the optimal routing is done due to the nature of the meta-algorithm optimization and the costs spent for this task are significantly reduced compared to the previous work.

Keywords