Multi-depot dispatch deployment analysis on classifying preparedness phase for flood-prone coastal demography in Sarawak
Keywords:vehicle routing problem, MDVRP, genetic computation, optimization, routing complexity
Multi-Depot VRP (MDVRP) is a metaheuristic approach with concurrent vehicle rendezvous across various depots within a demanded regulation, where the task assignment would eventually end up at the same initial depot. A review of the relief commodities distribution patterns among flood-prone areas in the underlying layouts of Sarawak residential areas has been conducted in retrospect and in light of common real-world routing problems. The purpose of this research is to demonstrate the benefits of multi-path route selection in task distribution to cater to simultaneous demands for adhering to strict constraint settings, including load dispatch dynamism and deployed vehicle quantities. Shortest path algorithms are improvised as an alternative to select the most optimum traveled routes during relief commodity distribution. This is done by determining critical allocation nodes, where solution steps are optimized using a genetic algorithm with predefined parameters. The experimental output displays the strong correlation between the number of prioritized customers and assigned depots to optimize the route complexity and natural affluence on generated final solution cost. The approach is seen as viable for further addressing problem-specific instances in vehicle routing problems such as adjusting parameter settings to generate rapid solution steps, including pathfinding shortest coverage distance and sorting out trade-offs between space covered and the time limitations of task distribution efforts.
Anisya, A., & Swara, G. Y. (2017). Implementation of haversine formula and best first search method in searching of tsunami evacuation route. IOP Conference Series: Earth and Environmental Science, 97(1). https://doi.org/10.1088/1755-1315/97/1/012004
Foead, D., Ghifari, A., Kusuma, M. B., Hanafiah, N., & Gunawan, E. (2021). A systematic literature review of A* pathfinding. Procedia Computer Science, 179, 507–514. https://doi.org/10.1016/j.procs.2021.01.034
Indriyono, B. V. (2021). Optimization of breadth-first search algorithm for path solutions in mazyin games. International Journal of Artificial Intelligence & Robotics (IJAIR), 3(2), 58-66. https://doi.org/10.25139/ijair.v3i2.4256
Lagaros, N. D., & Karlaftis, M. G. (2011). A critical assessment of metaheuristics for scheduling emergency infrastructure inspections. Swarm and Evolutionary Computation, 1(3), 147–163. https://doi.org/10.1016/j.swevo.2011.06.002
Lombard, A., Tamayo-Giraldo, S., & Fontane, F. (2018). Vehicle routing problem with roaming delivery locations and stochastic travel times (VRPRDL-S). Transportation Research Procedia, 30, 167–177. https://doi.org/10.1016/j.trpro.2018.09.019
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
Talan, K., & Bamnote, G. R. (2015). Shortest path finding using a star algorithm and minimum weight node first principle. Int. J. of Innovative Res. in Computer and Communication Engineering, 3(2), 1258.
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
Wang, H., Lou, S., Jing, J., Wang, Y., Liu, W., & Liu, T. (2022). The EBS-A* algorithm: An improved A* algorithm for path planning. PLoS ONE, 17(2 February), 1–27. https://doi.org/10.1371/journal.pone.0263841
How to Cite
Copyright (c) 2022 Farid Morsidi
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.