Abstract:

The traffic manager needs to plan a scheme for each mission in military support or emergency, which is a multisource multidestination problem. It is NPC. A new network path planning algorithm based on multiant colonies’ parallel optimization is presented. According to a certain scheduling policy for key network resources, finding a feasible path which satisfies the constraint of transportation properties and the constraint of service quality for each support task, and a scheme which makes the morest missions be successful is planned. Finally, an example is used to validate the model and algorithms.

Key words: logistics support network;path planning;parallel optimization;independent path