چكيده به لاتين
Maintaining security and reducing route risks are critical challenges in planning and routing valuable goods. Cash is one of the most widely used types of valuable goods, which due to its nature, the transportation of this goods is threatened with risks such as attack and armed robbery., given its nature. Accordingly, keeping the transit process secure requires a special planning and routing. A more realistic look into real-world problems indicates that some current routes are not entirely independent and separate; they may share sections that affect each other. In other words, changing the status of one section of the street may affect multiple links simultaneously. In line with this new concept, this article presents a bi-objective cash-in-transit routing problem by considering overlapping links. The objectives of the model include minimizing cost and risk of routing. This article mainly addresses the overlapping of links as one of the crucial indicators impacting route risk. Also, a genetic algorithm is also designed to optimize the problem. Next, the efficiency and effectiveness of the proposed algorithm are evaluated in small-size and large-size problems. The obtained results show the superiority and high efficiency of the proposed algorithm compared to previous literature. In addition, sensitivity analysis is conducted on crucial parameters of the problem. Ultimately, a real case study on cash distribution in Tehran province of Iran is performed using the proposed model.
