A solution approach for the bi-objective military supply routing problem

The speed of response to unexpected incidents is a critical aspect in both war and peace environments. In terms of the losses incurred by armies, every hour, minute, and even second holds great importance. Logistics transportation planning is required to support operations in both peace and war. The rapid fulfillment of logistical needs can be effectively achieved through the proper utilization of airlift. Airlift encompasses operations where units are parachuted into combat, units arrive at forward airfields by transport aircraft in air-to-ground operations, and subsequent resupply and support operations. Therefore, transport aircraft form the backbone of logistical needs. Military airlift operations are highly costly, making efficient route planning a vital part of military airlift planning. In emergency situations, such planning needs to be expedited. However, ensuring the security of transportation is also crucial for the successful completion of transportation planning. The objective of the A Solution Approach for the Bi-Objective Military Supply Routing Problem is to minimize the total flight costs incurred due to aircraft routes. Another objective is to maximize the safety of aircraft routes. In this study, the probabilities of hazardous situations arising from planned flight routes are defined as avoidance, and the aim is to balance this avoidance value with flight costs. To solve this multi-objective military airlift problem, a decision support system is established to enhance the reliability and utility of military logistics plans. Decision-makers can plan their actions by assessing the costs incurred due to flight routes and the potential risk. The Pareto-optimal solutions provided by the decision support system contribute significantly to solving this multi-objective routing problem.