| Along with the development of modern science and technology, making full use of the information technique and seeking the information technique guaranty advantage have already more and more become the important factor for the armed police forces to complete the function guaranty mission.The thorough research on the information-based construction problem of military traffic and transportation is of great significance to adapt to the request of the new military transform and for the armed police forces to complete the task of "dealing with the emergency "," anti-terror"and the conveyance guaranty of denfending operation mission under information-based condition. At present, the characteristics that the armed police forces function mission deversification is more and more obvious, and the request of the dispatchment of the mission vehicle is thus higher and higher. But being the important part of the infromation-based construction of the armed police forces vehicle management, the work of vehicle dispatchment is mainly carried out randomly by the vehichle dipatcher according to vehicle using process,namely according to the using plan strictly. Vehicle dispatchment under complicated conditions of multiple-tasks,multiple-types and many persons concerned, the planed dispatchment already can't meet the demands completely.To complete vehicle dispatchment conveniently and quickly under the complicated conditions and to increace the guaranty benefit of vehicle information-based management,a kind of optimized strategy about vehicle dispatchment--one is for the regular operation process and the other one aims at minimizing expenses under the circumstances of resources deficiency—is put forward ,basing on the analysis and study on the existing dispatchment arithmetic in vehicle information management system of the armed police forces.As to the vehicle dispatchment arithmetic for the regular operation process, firstly the certain task and the vehicle selecting and matching matrix should be made according to the defined data structure relations and the sequence of demand form. Then according to the task and vehicle selecting and matching matrix we can carry out the dispatchment of the mission vehicle,in the course of which vehicles should first be divided into one with special car mission and the other one with no special car mission. The special car mission is given the priority to be dispatched and is ruled out of the selecting and matching matrix to reduce the range of the dispatchement.As for no special car mission ,the usage pri of the vehicles can be defined by the amount of the optional dispatched vehicles.The vehicles of the same level can go on lining up according to the quantity of the tasks that can be used.At last the pri of the vehicles can be made in accordance with that of the tasks thereby we can gain the better result.In this way,the complex hypothesis and the enormous calculation process in former vehicle dispatment arithmetic is reduced,saving the time and improving the efficiency.As to the vehicle dispatchement arithmetic aiming at minimizing expenses,it is a kind of supplement dispatchemnt arithmetic which chooses to lease vehicles from the others when there are not sufficient vehicle resources and the demand for mission vehicle must be satisfied.It sets the minimized leasing expenses as the target ,mainly by making use of the integer programming and through Hungary method of thought it reduces the programming space continuously to get the least total leasing expenses of the dispatchment with the small amount of calcuations and the result dealt with quickly.At the end of this paper,we also did the test and running on the vehicle dispatchment in the vehicle information management system of the armed police forces in order to ensure its feasibility and integrity. Through the test, it proves that our arithmetic greatly improves the efficiency of the armed police forces vehicle dispatchment ,saving the funds, cutting down the costs and the running efficiency is also better.
|
PDF Full Text Request