Using Routing Heuristics to Improve Cost Interoperability: Strategy, Modelling Annotations, and Dynamism

Farid Morsidi

doi:10.56225/ijgoia.v2i2.182

Authors

Farid Morsidi Faculty of Computing and Meta-Technology, Universiti Pendidikan Sultan Idris, Tanjong Malim, Perak, Malaysia

DOI:

https://doi.org/10.56225/ijgoia.v2i2.182

Keywords:

cost interoperability, routing optimization, distribution network, scheduling systems, cost optimality

Abstract

Routing systems mechanisms have piqued researchers' interest in heuristic components for routing problems that could alter problem complexity. As a result, myriad routing strategies were proposed that minimize deployment costs while maximizing traversal coverage. Several constraints were considered, including deployment times, load capacities, and projected coverage. Research into routing systems has focused on heuristics to optimize complex routing problems. Multiple strategies have been proposed to optimize deployment costs and maximize route coverage, focusing on deployment times, load capacities, and coverage. This literature study examines data interpolation for cost optimization features coupled with relative scheduling systems, with the primary purpose of supporting heterogeneity subjugation towards cost interoperability based on varied goals and objective functions. A total of 250 papers were analyzed for relevance regarding routing scheduling from relevant academic-based user-accessed scientific journal databases such as Scopus, Web of Science, Hindawi, ACM, and Google Scholar to perform a concise analysis of the relative cost interoperability measures in routing strategies, including single objective purposes undertakings. The research evaluated the application, niche problem-solving methodologies, and viability for future refinement or integration with comparable solutions. This qualitative study aims to present an information synthesis based on the PRISMA (Systematic Literature Review) framework on various recognized developments and trends for routing heuristic research works that will serve as a benchmark for refining improvisation on current solution strategies. Ultimately, this study presents a comprehensive review of the applicable field, an analysis of existing problem-solving strategies, and a comprehensive overview of the possibilities for incorporating them into further research.

References

Akararungruangkul, R., Chokanat, P., Pitakaso, R., Supakdee, K., & Sethanan, K. (2018). Solving vehicle routing problem for maintaining and repairing medical equipment using differential evolution algorithm: a case study in ubon ratchathani public health office. International Journal of Applied Engineering Research, 13(10), 8035–8045.

Alem, D., Clark, A., & Moreno, A. (2016). Stochastic network models for logistics planning in disaster relief. European Journal of Operational Research, 255(1), 187–206. https://doi.org/10.1016/j.ejor.2016.04.041

Ali Torabi, S., Shokr, I., Tofighi, S., & Heydari, J. (2018). Integrated relief pre-positioning and procurement planning in humanitarian supply chains. Transportation Research Part E: Logistics and Transportation Review, 113 (March), 123–146. https://doi.org/10.1016/j.tre.2018.03.012

Alweshah, M., Almiani, M., Almansour, N., Al Khalaileh, S., Aldabbas, H., Alomoush, W., & Alshareef, A. (2022). Vehicle routing problems based on Harris Hawks optimization. Journal of Big Data, 9 (1). https://doi.org/10.1186/s40537-022-00593-4

Arena, F., Malara, G., Musolino, G., Rindone, C., Romolo, A., & Vitetta, A. (2018). From green energy to green logistics: a pilot study in an italian port area. Transportation Research Procedia, 30, 111–118. https://doi.org/10.1016/j.trpro.2018.09.013

Boumpa, E., Tsoukas, V., Chioktour, V., Kalafati, M., Spathoulas, G., Kakarountas, A., … Malindretos, G. (2022). A Review of the vehicle routing problem and the current routing services in smart cities. Analytics, 2(1), 1–16. https://doi.org/10.3390/analytics2010001

Braaten, S., Gjønnes, O., Hvattum, L. M., & Tirado, G. (2017). Heuristics for the robust vehicle routing problem with time windows. Expert Systems with Applications, 77, 136–147. https://doi.org/10.1016/j.eswa.2017.01.038

Calabrò, G., Torrisi, V., Inturri, G., & Ignaccolo, M. (2020). Improving inbound logistic planning for large-scale real-world routing problems: a novel ant-colony simulation-based optimization. European Transport Research Review, 12(1). https://doi.org/10.1186/s12544-020-00409-7

Chen, C.-M., Lv, S., Ning, J., & Wu, J. M.-T. (2023). A genetic algorithm for the waitable time-varying multi-depot green vehicle routing problem. Symmetry, 15(1), 124. https://doi.org/10.3390/sym15010124

Christopher, Y., Wahyuningsih, S., & Satyananda, D. (2021). Study of variable neighborhood descent and tabu search algorithm in VRPSDP. Journal of Physics: Conference Series, 1872 (1). https://doi.org/10.1088/1742-6596/1872/1/012002

D’Uffizi, A., Simonetti, M., Stecca, G., & Confessore, G. (2015). A simulation study of logistics for disaster relief operations. Procedia CIRP, 33, 157–162. https://doi.org/10.1016/j.procir.2015.06.029

Ezugwu, A. E. S., & Adewumi, A. O. (2017). Discrete symbiotic organisms search algorithm for traveling salesman problem. Expert Systems with Applications, 87, 70–78. https://doi.org/10.1016/j.eswa.2017.06.007

Fitriani, N. A., Pratama, R. A., Zahro, S., Utomo, P. H., & Martini, T. S. (2021). Solving capacitated vehicle routing problem using saving matrix, sequential insertion, and nearest neighbor of product “X” in Grobogan district. AIP Conference Proceedings, 2326. https://doi.org/10.1063/5.0039295

Gdowska, K., Viana, A., & Pedroso, J. P. (2018). Stochastic last-mile delivery with crowdshipping. Transportation Research Procedia, 30, 90–100. https://doi.org/10.1016/j.trpro.2018.09.011

Gharib, Z., Bozorgi-Amiri, A., Tavakkoli-Moghaddam, R., & Najafi, E. (2018). A cluster-based emergency vehicle routing problem in disaster with reliability. Scientia Iranica, 25(4), 2312–2330. https://doi.org/10.24200/sci.2017.4450

Giovanni, L. De, Gastaldon, N., Losego, M., & Sottovia, F. (2018). Algorithms for a vehicle routing tool supporting express freight delivery in small trucking companies. Transportation Research Procedia, 30, 197–206. https://doi.org/10.1016/j.trpro.2018.09.022

Han, M., & Wang, Y. Bin. (2020). A solution to vrptw based on improved GA-AMMAS algorithm. Journal of Physics: Conference Series, 1486(3). https://doi.org/10.1088/1742-6596/1486/3/032015

Jayarathna, D. G. N. D., Lanel, G. H. J., & Juman, Z. A. M. S. (2021). Survey on ten years of multi-depot vehicle routing problems: mathematical models, solution methods, and real-life applications. Sustainable Development Research, 3(1), p36. https://doi.org/10.30560/sdr.v3n1p36

Jayarathna, D. G. N. D., Lanel, G. H. J., & Juman, Z. A. M. S. (2022). Industrial vehicle routing problem: a case study. Journal of Shipping and Trade, 7(1). https://doi.org/10.1186/s41072-022-00108-7

Kasanah, Y. U., Qisthani, N. N., & Munang, A. (2022). Solving the capacitated vehicle routing problem with heterogeneous fleet using heuristic algorithm in poultry distribution. Jurnal Ilmiah Teknik Industri, 21(1), 104–112. https://doi.org/10.23917/jiti.v21i1.17430

Kocaoglu, Y., Cakmak, E., Kocaoglu, B., & Taskin Gumus, A. (2020). A novel approach for optimizing the supply chain: a heuristic-based hybrid algorithm. Mathematical Problems in Engineering, 2020. https://doi.org/10.1155/2020/3943798

Kunnapapdeelert, S., & Thawnern, C. (2021). Capacitated vehicle routing problem for thailand's steel industry via saving algorithms. Journal of System and Management Sciences, 11(2), 171–181. https://doi.org/10.33168/JSMS.2021.0211

Lei, L., Lee, K., & Dong, H. (2016). A heuristic for emergency operations scheduling with lead times and tardiness penalties. European Journal of Operational Research, 250(3), 726–736. https://doi.org/10.1016/j.ejor.2015.10.005

Li, H., Xiong, K., & Xie, X. (2021). Multiobjective contactless delivery of medical supplies under open-loop distribution. Mathematical Problems in Engineering, 2021. https://doi.org/10.1155/2021/9986490

Liu, M., & Xiao, Y. (2015). Optimal scheduling of logistical support for medical resources with demand information updating. Mathematical Problems in Engineering, 2015. https://doi.org/10.1155/2015/765098

Luo, S., Wang, Y., Tang, J., Guan, X., & Xu, M. (2021). Two-echelon multidepot logistics network design with resource sharing. Journal of Advanced Transportation, 2021. https://doi.org/10.1155/2021/6619539

Markou, C., Koulinas, G. K., & Vavatsikos, A. P. (2017). Project resources scheduling and leveling using multi-attribute decision models: models implementation and case study. Expert Systems with Applications, 77, 160–169. https://doi.org/10.1016/j.eswa.2017.01.035

Marković, D., Petrović, G., Ćojbašić, Ž., & Stanković, A. (2020). The vehicle routing problem with stochastic demands in an urban area – a case study. Facta Universitatis, Series: Mechanical Engineering, 18 (1), 107–120. https://doi.org/10.22190/FUME190318021M

Miranda, P. B. C., Prudêncio, R. B. C., & Pappa, G. L. (2017). H3AD: A hybrid hyper-heuristic for algorithm design. Information Sciences, 414, 340–354. https://doi.org/10.1016/j.ins.2017.05.029

Molina, J. C., Eguia, I., Racero, J., & Guerrero, F. (2014). Multi-objective vehicle routing problem with cost and emission functions. Procedia - Social and Behavioral Sciences, 160 (Cit), 254–263. https://doi.org/10.1016/j.sbspro.2014.12.137

Morsidi, F. (2022). Multi-depot dispatch deployment analysis on classifying preparedness phase for flood-prone coastal demography in Sarawak. Jictie, 9 (2), 175–190. https://doi.org/https://doi.org/10.37134/jictie.vol9.2.13.2022

Morsidi, F. (2023). Distribution path segmentation using route relocation and savings heuristics for multi-depot vehicle routing. Malaysian Journal of Science and Advanced Technology, 3 (2), 72–80. https://doi.org/https://doi.org/10.56532/mjsat.v3i2.154

Morsidi, F., Wang, S. L., Budiman, H., & Ng, T. F. (2023). Overview discourse on inherent distinction of multiobjective optimization in routing heuristics for multi-depot vehicle instances. Artificial Intelligence and Applications, 3 (2), 1–12. https://doi.org/10.47852/bonviewAIA3202806

Nama, S., & Saha, A. K. (2018). An ensemble symbiosis organisms search algorithm and its application to real-world problems. Decision Science Letters, 7, 103–118. https://doi.org/10.5267/j.dsl.2017.6.006

Nucamendi-Guillén, S., Gómez Padilla, A., Olivares-Benitez, E., & Moreno-Vega, J. M. (2021). The multi-depot open location routing problem with a heterogeneous fixed fleet. Expert Systems with Applications, 165(August 2020). https://doi.org/10.1016/j.eswa.2020.113846

Nura, A., & Shamsu Abdullahi. (2022). A systematic review of multi-depot vehicle routing problems. Systematic Literature Review and Meta-Analysis Journal, 3(2), 51–60. https://doi.org/10.54480/slrm.v3i2.37

Nura, A., Shamsu Abdullahi, Jayarathna, N. D., Juman, Z. A. M. S., Jayarathna, D. G. N. D., Lanel, G. H. J., … Xie, X. (2022). Research on hybrid real-time picking routing optimization based on multiple picking stations. Journal of Advanced Transportation, 2022(1), 124. https://doi.org/10.1155/2022/5510749

Ochelska-Mierzejewska, J., Poniszewska-Marańda, A., & Marańda, W. (2021). Selected genetic algorithms for vehicle routing problem solving. Electronics, 10(24), 3147. https://doi.org/10.3390/electronics10243147

Ouhader, H., & El kyal, M. (2017a). Combining facility location and routing decisions in sustainable urban freight distribution under horizontal collaboration: how can shippers be benefited? Mathematical Problems in Engineering, 2017. https://doi.org/10.1155/2017/8687515

Pimentel, C., & Alvelos, F. (2018). Integrated urban freight logistics combining passenger and freight flows - Mathematical model proposal. Transportation Research Procedia, 30, 80–89. https://doi.org/10.1016/j.trpro.2018.09.010

Pinto, J., Quadros, A., Rathod, D., & Mittal, J. (2020). Route and cost optimization for warehouses. International Research Journal of Engineering and Technology (IRJET), 7 (July), 3316–3320.

Rachmawati, D., & Gustin, L. (2020). Analysis of Dijkstra's algorithm and A∗ algorithm in shortest path problem. Journal of Physics: Conference Series, 1566(1). https://doi.org/10.1088/1742-6596/1566/1/012061

Saeidian, B., Mesgari, M. S., Pradhan, B., & Ghodousi, M. (2018). Geo-information optimized location-allocation of earthquake relief centers using PSO and ACO, complemented by GIS, clustering, and TOPSIS. International Journal of Geo-Information. https://doi.org/10.3390/ijgi7080292

Shi, Y., Lv, L., Hu, F., & Han, Q. (2020). A heuristic solution method for multi-depot vehicle routing-based waste collection problems. Applied Sciences (Switzerland), 10(7). https://doi.org/10.3390/app10072403

Stodola, P. (2018). Using metaheuristics on the multi-depot vehicle routing problem with modified optimization criterion. Algorithms, 11(5). https://doi.org/10.3390/a11050074

Sularno, S., Mulya, D. P., Astri, R., & Mulya, D. (2021). Determination of the shortest route based on the BFS algorithm for disaster evacuation shelters. Scientific Journal of Informatics, 8(1), 33–42. https://doi.org/10.15294/sji.v8i1.27863

Tavana, M., Abtahi, A. R., Di Caprio, D., Hashemi, R., & Yousefi-Zenouz, R. (2018). An integrated location-inventory-routing humanitarian supply chain network with pre- and post-disaster management considerations. Socio-Economic Planning Sciences, 64(December), 21–37. https://doi.org/10.1016/j.seps.2017.12.004

Tunnisaki, F., & Sutarman. (2023). Clarke and Wright savings algorithm as solutions to vehicle routing problems with simultaneous pickup delivery (VRPSPD). Journal of Physics: Conference Series, 2421(1), 012045. https://doi.org/10.1088/1742-6596/2421/1/012045

Vahdani, B., Veysmoradi, D., Noori, F., & Mansour, F. (2018). Two-stage multi-objective location-routing-inventory model for humanitarian logistics network design under uncertainty. International Journal of Disaster Risk Reduction, 27(May 2017), 290–306. https://doi.org/10.1016/j.ijdrr.2017.10.015

Wahyuningsih, S., & Satyananda, D. (2020). Improvement of solution using local search method by perturbation on VRPTW variants. Journal of Physics: Conference Series, 1581(1). https://doi.org/10.1088/1742-6596/1581/1/012004

Wang, D., Jiang, J., Ma, R., & Shen, G. (2022). Research on hybrid real-time picking routing optimization based on multiple picking stations. Mathematical Problems in Engineering, 2022. https://doi.org/10.1155/2022/5510749

Xu, H., Pu, P., Duan, F., & Hendy, A. S. (2018). A hybrid ant colony optimization for dynamic multidepot vehicle routing problem. Discrete Dynamics in Nature and Society, 2018. https://doi.org/10.1155/2018/3624728

Yu, V. F., Jodiawan, P., & Redi, A. A. N. P. (2022). Crowd-shipping problem with time windows, transshipment nodes, and delivery options. Transportation Research Part E: Logistics and Transportation Review, 157(December 2021), 102545. https://doi.org/10.1016/j.tre.2021.102545

Żak, J., & Galińska, B. (2018). Design and Evaluation of Global Freight Transportation Solutions (Corridors). Analysis of a Real World Case Study. Transportation Research Procedia, 30, 350–362. https://doi.org/10.1016/j.trpro.2018.09.038

Zeddini, B., & Zargayouna, M. (2018). Dispatching strategies for dynamic vehicle routing problems. Smart Innovation, Systems, and Technologies, 96, 87–96. https://doi.org/10.1007/978-3-319-92031-3_9

Zhalechian, M., Tavakkoli-Moghaddam, R., Rahimi, Y., & Jolai, F. (2017). An interactive possibilistic programming approach for a multi-objective hub location problem: Economic and environmental design. Applied Soft Computing Journal, 52, 699–713. https://doi.org/10.1016/j.asoc.2016.10.002

Zhan, S., Wang, P., Wong, S. C., & Lo, S. M. (2022). Energy-efficient high-speed train rescheduling during a major disruption. Transportation Research Part E: Logistics and Transportation Review, 157(December 2021). https://doi.org/10.1016/j.tre.2021.102492

Zhang, L., Liu, Z., Yu, L., Fang, K., Yao, B., & Yu, B. (2022). Routing optimization of shared autonomous electric vehicles under uncertain travel time and uncertain service time. Transportation Research Part E: Logistics and Transportation Review, 157(June 2021), 102548. https://doi.org/10.1016/j.tre.2021.102548

Zhang, Yao, Liu, Y., Li, C., Liu, Y., & Zhou, J. (2022). The optimization of path planning for express delivery based on clone adaptive ant colony optimization. Journal of Advanced Transportation, 2022. https://doi.org/10.1155/2022/4825018

Zhang, Ying, Qi, M., Miao, L., & Wu, G. (2015). A generalized multi-depot vehicle routing problem with replenishment based on the local solver. International Journal of Industrial Engineering Computations, 6(1), 81–98. https://doi.org/10.5267/j.ijiec.2014.8.005

Zhao, J., Guo, Y., & Duan, X. (2017). Dynamic path planning of emergency vehicles based on travel time prediction. Journal of Advanced Transportation, 2017. https://doi.org/10.1155/2017/9184891

Žunić, E., Đonko, D., & Buza, E. (2020). An adaptive data-driven approach to solving real-world vehicle routing problems in logistics. Complexity, 2020. https://doi.org/10.1155/2020/7386701