Document Type : Research Paper


1 Department of Industrial Management, Firoozkooh Branch, Islamic Azad University, Tehran, Iran.

2 Department of Industrial Engineering, South-Tehran Branch, Islamic Azad University, Tehran, Iran.


The process of transferring money from the treasury to the branches and returning it at specific and limited periods is one of the applications of the Vehicle Routing Problem (VRP). Many parameters affect it, but choosing the right route is the key parameter so that the money delivery process is carried out in a specific period with the least risk. In the present paper, new relationships are defined in the form of three concepts in order to minimize route risk. These concepts are: 1) the vehicle does not travel long routes in the first three movements, 2) a branch is not served at the same hours on two consecutive days, and 3) an arc should not be repeated on two consecutive days. The proposed model with real information received from Bank Shahr has been performed for all branches in Tehran. Because the  VRP is an NP-Hard problem, a genetic algorithm was used to solve the problem. Different issues in various production dimensions were solved with GAMS and MATLAB software to show the algorithm solution quality. The results show that the difference between the genetic algorithm and the optimal solution is an average of 1.09% and a maximum of 1.75%.


Main Subjects

[1]     England, N. (2019). Annual report and accounts. Verlag Nicht Ermittelbar.
[2]     European Central Bank. (2019). Annual report and accounts.
[3]     The Federal Reserve. (2019). Annual report and accounts.
[4]     Bruno, G., Genovese, A., & Improta, G. (2012). Routing problems: A historical perspective. The best writing in mathematics, 118-127.
[5]     Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management science, 6(1), 80–91.
[6]     Hoogeboom, M., & Dullaert, W. (2019). Vehicle routing with arrival time diversification. European journal of operational research, 275(1), 93–107.
[7]     Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016). The vehicle routing problem: State of the art classification and review. Computers & industrial engineering, 99, 300–313.
[8]     Nasr, N., Akhavan Niaki, S. T., Seifbarghy, M., & Husseinzadeh Kashan, A. (2022). An agri-fresh food supply chain network design with routing optimization: a case study of ETKA company. Advances in mathematical finance and applications, 7(1), 187–198.
[9]     Wang, J., Lv, J., Wang, C., & Zhang, Z. (2017). Dynamic route choice prediction model based on connected vehicle guidance characteristics. Journal of advanced transportation, 2017, 6905431.
[10]   Davis, L. C. (2017). Dynamic origin-to-destination routing of wirelessly connected, autonomous vehicles on a congested network. Physica a: statistical mechanics and its applications, 478, 93–102.
[11]   Davis, L. C. (2016). Improving traffic flow at a 2-to-1 lane reduction with wirelessly connected, adaptive cruise control vehicles. Physica A: statistical mechanics and its applications, 451, 320–332.
[12]   Shafiekhani, M., Rashidi Komijan, A., & Javanshir, H. (In Press). Optimizing the routing problem in the vehicle carrying cash considering the route risk (case study of Bank Shahr). Journal of applied research on industrial engineering.
[13]   Soriano, A., Vidal, T., Gansterer, M., & Doerner, K. (2020). The vehicle routing problem with arrival time diversification on a multigraph. European journal of operational research, 286(2), 564–575.
[14]   Ghannadpour, S. F., & Zandiyeh, F. (2020). A new game-theoretical multi-objective evolutionary approach for cash-in-transit vehicle routing problem with time windows (a real life case). Applied soft computing, 93, 106378.
[15]   Talarico, L., Sörensen, K., & Springael, J. (2017). A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector. International transactions in operational research, 24(1–2), 59–76.
[16]   Talarico, L., Sörensen, K., & Springael, J. (2015). Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem. European journal of operational research, 244(2), 457–470.
[17]   Talarico, L., Sörensen, K., & Springael, J. (2015). The k-dissimilar vehicle routing problem. European journal of operational research, 244(1), 129–140.
[18]   Talarico, L., Springael, J., Sörensen, K., & Talarico, F. (2017). A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem. Computers & operations research, 78, 547–556.
[19]   Yan, S., Wang, S.-S., & Wu, M. W. (2012). A model with a solution algorithm for the cash transportation vehicle routing and scheduling problem. Computers & industrial engineering, 63(2), 464–473.
[20]   Sadeghi Moghadam, M. R., Momeni, M., & Nalchigar, S. (2009). Material flow modeling in supply chain management with genetic algorithm approach. Industrial management journal, 1(2).
[21]   Ghannadpour, S. F., & Zandiyehh, F. (2019). A game theory based vehicle routing problem with risk minimizing of valuable commodity transportation. Quarterly journal of transportation, 11(1), 71–98.
[22]   Tavakkoli, M. R., Raziei, Z., & Tabrizian, S. (2015). Solving a bi-objective multi-product vehicle routing problem with heterogeneous fleets under an uncertainty condition. International journal of transportation engineering, 3(3), 207-225.
[23]   Akhtar, M., Manna, A. K., Duary, A., & Bhunia, A. K. (2022). A hybrid tournament differential evolution algorithm for solving optimisation problems and applications. International journal of operational research, 45(3), 300–343.
[24]   Setak, M., Azizi, V., & Karimi, H. (2015). Multi depots capacitated location-routing problem with simultaneous pickup and delivery and split loads: formulation and heuristic methods. Journal of industrial engineering research in production systems, 2(4), 67–81.