Optimizing Landing Craft Tank Routing in Mining Logistics Using a Simulated Annealing Heuristic
DOI:
https://doi.org/10.35806/ijoced.v8i2.633Keywords:
Landing Craft Tank, Mining Logistics, Routing Optimization, Simulated Annealing Algorithms, Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD)Abstract
A Landing Craft Tank (LCT) is commonly used to transport heavy equipment and materials to mining sites. LCT operations are crucial to the success of mining activities. This paper applies a simulated annealing (SA) algorithm to optimize Landing Craft Tank (LCT) operations by addressing the vehicle routing problem with simultaneous pickup and delivery (VRPSPD). The main objective is to minimize the total transportation cost of LCT operations. While the operation must fully satisfy each customer's delivery and pickup requirements. The proposed SA heuristic was evaluated using ten standard SCA3 benchmark instances from the VRPSPD literature as a preliminary validation of its applicability to LCT-based mining logistics. The computational results show that the proposed SA heuristic produced solutions with an average gap of 0.88% from the best-known solutions across the tested instances, with computational times ranging from 14.17 to 56.89 seconds.
References
Alfredo Tang Montané, F., & Galvão, R. D. (2006). A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operations Research, 33(3), 595–619. https://doi.org/10.1016/j.cor.2004.07.009
Dell’Amico, M., Righini, G., & Salani, M. (2006). A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection. Transportation Science, 40(2), 235–247. https://doi.org/10.1287/trsc.1050.0118
Dethloff, J. (2001). Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up: Fahrzeugeinsatzplanung und Redistribution: Tourenplanung mit simultaner Auslieferung und Rückholung. OR Spektrum, 23(1), 79–96. https://doi.org/10.1007/PL00013346
Gajpal, Y., & Abad, P. (2009). An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Computers & Operations Research, 36(12), 3215–3223. https://doi.org/10.1016/j.cor.2009.02.017
Goksal, F. P., Karaoglan, I., & Altiparmak, F. (2013). A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Computers & Industrial Engineering, 65(1), 39–53. https://doi.org/10.1016/j.cie.2012.01.005
Kalayci, C. B., & Kaya, C. (2016). An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Systems with Applications, 66, 163–175. https://doi.org/10.1016/j.eswa.2016.09.017
Koç, Ç., Laporte, G., & Tükenmez, İ. (2020). A review of vehicle routing with simultaneous pickup and delivery. Computers & Operations Research, 122, 104987. https://doi.org/10.1016/j.cor.2020.104987
Lesmini, L., Anggraini, A., & Rifni, M. (2019). Perencanaan dan penyusunan muatan pada kapal landing craft tank (LCT). Jurnal Logistik Indonesia, 3(1), 10–28. https://doi.org/10.31334/jli.v3i1.347
Liu, S., Tang, K., & Yao, X. (2020). Memetic Search for Vehicle Routing with Simultaneous Pickup-Delivery and Time Windows (Version 5). arXiv. https://doi.org/10.48550/ARXIV.2011.06331
Min, H. (1989). The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research Part A: General, 23(5), 377–386. https://doi.org/10.1016/0191-2607(89)90085-X
Prananda, I. M. G., Pratiwi, E., Dinariyana, A. A. B., & Artana, K. B. (2022). Capacitated vehicle routing problem optimization for Bali and Nusa Tenggara natural gas distribution. IOP Conference Series: Earth and Environmental Science, 972(1), 012022. https://doi.org/10.1088/1755-1315/972/1/012022
Werner, T. T., Toumbourou, T., Maus, V., Lukas, M. C., Sonter, L. J., Muhdar, M., Runting, R. K., & Bebbington, A. (2024). Patterns of infringement, risk, and impact driven by coal mining permits in Indonesia. Ambio, 53(2), 242–256. https://doi.org/10.1007/s13280-023-01944-y
Yu, V. F., Susanto, H., Yeh, Y.-H., Lin, S.-W., & Huang, Y.-T. (2022). The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers. Mathematics, 10(6), 920. https://doi.org/10.3390/math10060920
Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2009). A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Expert Systems with Applications, 36(2), 1070–1081. https://doi.org/10.1016/j.eswa.2007.11.005
Zamanian, A., Jodiawan, P., & Ziarati, K. (2025). A reactive greedy randomized adaptive search procedure algorithm for solving the vehicle routing problem with simultaneous pickup and delivery. International Transactions in Operational Research, itor.70147. https://doi.org/10.1111/itor.70147

















