Many studies have been carried out on how to model problem types, develop problem hypotheses to adapt to real-world applications and create or develop problem-solving methods to reach better results. The present study intended to use the single-objective bat algorithm for the medicine distribution process in the Tabriz metropolis to solve the vehicle routing problem (VRP) with time windows. Given the continuous nature of the meta-heuristic algorithm, the generation and decoding method designs a new solution for routing that leads to the shortest transport route in the least possible time. Regarding this, the medicine distribution method by the medicine distribution company, which is a commercial-service company (non-technological), has been taken into account. Problems with various dimensions based on real problems associated with the transfer of medicines to pharmacies in Tabriz, which the medicine distribution company does, have been considered to evaluate the performance of the proposed method. The proposed method was implemented in MATLAB and GAMS software. According to the results obtained, the routing was carried out on various sets, the result was performed, and the cost spent for each of them was presented. Furthermore, GAMSsoftware was used to verify the reference paper showing that optimal routing is done considering the optimal nature of the meta-heuristic algorithm, and the costs incurred for this task have significantly reduced compared to previous similar ones.

Bat algorithm, routing, GAMS, MATLAB, Medicine Distribution, Shortest Path.