The purpose of this study is to find an ordering of convoy columns which minimizes the total time to complete marching through a junction which is located a certain area in wartime.
Many personnel, ammunition, oil, and various materials are necessary for an army corps to execute military attack or defense operations. The command headquater supporting the army corps has a mission to transport these to a specified area. In this event, if the amount of necessary traffic is large, a traffic jam is likely to occur at a junction in the area. Hence, we need to make more efficient planning to improve the throughput at the junction. This is known as the convoy columns control problem.
In this thesis, we suggest a heuristic algorithm for this problem. The maximum number of concurrent marching convoy column is first determined by the diameter of junction, the width of vehicle and the degree of driver's proficiency. This algorithm uses the concept of concrete paired nodes. This algorithm tries to generate an efficient planning by scheduling maximum number of convoy columns to pass through the junction concurrently as much as possible. This problem also consider priority constraints and can be formulated as interger programming problem.
We used an artificial military movement plan data to compare the performance of our algorithm with that of the existing scheduling scheme. The results show that the planning generated by the existing scheme. For this data set, the total makespan has been reduced by 11%.
