A bi-objective cash-in-transit pick-up and delivery problem with risk assessment methodology: a case study | ||
| Journal of Quality Engineering and Production Optimization | ||
| مقاله 1، دوره 8، شماره 2، اسفند 2023، صفحه 1-20 اصل مقاله (1.96 M) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22070/jqepo.2024.18159.1269 | ||
| نویسندگان | ||
| Reza Ramezanian* 1؛ Meysam Arjomandfar2؛ Darya Abbasi3 | ||
| 1Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran. | ||
| 2Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran | ||
| 3Department of Industrial Engineering and Management Systems, Amirkabir University of Technology, Tehran, Iran | ||
| چکیده | ||
| In this paper, the Risk-constrained Cash-In-Transit Vehicle Routing Problem (RCITVRP) is addressed with time windows, pickups, and deliveries. It is crucial for Cash-In-Transit (CIT) companies involved in transporting valuable or hazardous goods to identify risks. Therefore, owing to the high level of risk in CIT operations (e.g., armed robbery or attack), a bi-objective mixed-integer non-linear programming (MINLP) model is used to minimize travel costs and the risks associated with transporting valuables. For risk minimization, a new risk measure is developed, which includes: (i) the level of vulnerability for each vehicle, and (ii) the threat probability on each route. In addition, multiple vehicles are considered with capacity limitations. The epsilon-constraint method, a multi-objective exact solution approach, is implemented to solve the proposed model. Furthermore, several numerical examples are generated to evaluate the model and the solution method, which clearly show the best route with minimum cost and minimum risk (cost value = 112, risk value = 64,600). Eventually, a case study is provided to investigate the applicability of the proposed model. | ||
| کلیدواژهها | ||
| Cash-in-transit Problem؛ Mathematical modeling؛ multi-objective؛ RCITVRP؛ risk assessment؛ robbery | ||
| مراجع | ||
|
Bozkaya, B., Salman, F. S., & Telciler, K. (2017). An adaptive and diversified vehicle routing approach to reducing the security risk of cash‐in‐transit operations. Networks, 69(3), 256-269. Calvo, R. W., & Cordone, R. (2003). A heuristic approach to the overnight security service problem. Computers & Operations Research, 30(9), 1269-1287. Chankong, V., & Haimes, Y. Y. (1983). Multiobjective decision making theory and methodology. North Holland, New York. Ge, X., Jin, Y., & Zhang, L. (2023). Genetic-based algorithms for cash-in-transit multi depot vehicle routing problems: economic and environmental optimization. Environment, Development and Sustainability, 25(1), 557-586. Ghannadpour, S. F., & Zandiyeh, F. (2020). An adapted multi-objective genetic algorithm for solving the cash in transit vehicle routing problem with vulnerability estimation for risk quantification. Engineering Applications of Artificial Intelligence, 96, 103964. Krarup, J. (1995). The peripatetic salesman and some related unsolved problems. In Combinatorial programming: methods and applications (pp. 173-178). Springer, Dordrecht. Meiyi, W., Xiang, L., & Lean, Y. (2015). Time-dependent fuzzy random location-scheduling programming for hazardous materials transportation. Transportation Research Part C: Emerging Technologies, 57, 146-165. Momeni, M., Soleimani, H., & Mirzapour Al-e-Hashem, S. M. J. (2022). A nonlinear mathematical model for autonomous vehicle routing problem by considering traffic congestion for each route. Journal of Quality Engineering and Production Optimization, 7(2), 14-33. Ngueveu, S. U., Prins, C., & Calvo, R. W. (2009). A hybrid tabu search for the m-peripatetic vehicle routing problem. In Matheuristics (pp. 253-266). Springer, Boston, MA. Radojičić, N., Marić, M., & Takači, A. (2018). A new fuzzy version of the risk-constrained cash-in-transit vehicle routing problem. Information Technology and Control, 47(2), 321-337. Rezaeipanah, A., Ahmadi, G., Hajiani, M., & Darzi, M. R. (2019). An improved hybrid cuckoo search algorithm for vehicle routing problem with time windows. Journal of Quality Engineering and Production Optimization, 4(2), 189-208. Smith, L., & Louis, E. (2010). Cash in transit armed robbery in Australia. Trends and Issues in Crime and Criminal Justice, (397), 1-6. Soltanzadeh, S., Mardan, E., & Kamran Rad, R. (2020). An electric vehicle routing problem with battery swap and battery recharge approach. Journal of Quality Engineering and Production Optimization, 5(2), 1-20. Talarico, L., Sörensen, K., & Springael, J. (2013). The risk-constrained cash-in-transit vehicle routing problem with time window constraints. In 14th Workshop of the EURO Working Group (pp. 104-109). 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. 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. Tikani, H., Setak, M., & Demir, E. (2021). A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty. European Journal of Operational Research, 293(2), 703-730. Van Raemdonck, K., Macharis, C., & Mairesse, O. (2013). Risk analysis system for the transport of hazardous materials. Journal of Safety Research, 45, 55-63. Vahdat Zad, M. A. (2018). A mathematical programming for a special case of 2E-LRP in cash-in-transit sector having rich variants. International Journal of Industrial Engineering & Production Research, 29(2), 159-174. Xu, G., Li, Y., Szeto, W. Y., & Li, J. (2019). A cash transportation vehicle routing problem with combinations of different cash denominations. International Transactions in Operational Research. Yildiz, A., Guneri, A. F., Ozkan, C., Ayyildiz, E., & Taskin, A. (2022). An integrated interval-valued intuitionistic fuzzy AHP-TOPSIS methodology to determine the safest route for cash in transit operations: a real case in Istanbul. Neural Computing and Applications, 34(18), 15673-15688. | ||
|
آمار تعداد مشاهده مقاله: 220 تعداد دریافت فایل اصل مقاله: 84 |
||