المستخلص: |
Logistic problem is a hot topic in today's research. This is why this study is designed to explore the shortest routes truck drivers can follow in order to minimize distance traveled, time on the street, decrease congestion and CO2 emissions. Finding the best route is a difficult and inaccurate task by relying only on drivers’ experiences. However, shortest routes can be best achieved by measuring the distances between producers and retailers then use the Traveling Salesman Problem (TSP) software to calculate the shortest distance truck drivers should follow between these two nodes. Google maps can help in measuring these distances. After collecting the distances, it was entered on an excel sheet and then a TSP program was applied, which was the Excel Solver. The results of this study on the As Salam area showed that, by using TSP applications in the pharmaceutical and dairy logistics in Amman area, distance traveled by truck drivers was reduced by 60.8% and the overall delivery process became more efficient. This percent is calculated by taking the median between maximum distance traveled (42.6 km) and minimum distance traveled (10.36 km) between pharmacies, which is (26.48 km) as an average distance for most drivers not using any optimization program and then taking this median and calculate the reduction in distance traveled when using Traveler Salesman Problem Software.
|