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.
Copyrights © 2026