Emergency material scheduling method based on original duality theory

Abstract

The present invention provides an emergency material scheduling method based on the original duality theory. The method is characterized in comprising: step I1. determining the scheduling time and thescheduling cost for each supply point to each demand point, and obtaining the scheduling time and cost matrices; step I2. determining the maximum value of the smallest element in each row and columnof elements in the scheduling time matrix as the current candidate optimal solution; step I3. establishing a minimum cost flow network model associated with the current candidate optimal solution; step I4. determining the maximum traffic by using the optimal solution based on the duality principle solution model; step I5. determining whether the traffic reaches a given value, if so, finding the optimal matching scheme, and otherwise, updating the current candidate optimal solution and model with the minimum value-added principle, and returning to the step I4; Step II. according to the optimalmatching scheme, combined with the cost matrix, seeking the optimal scheduling scheme of the maximum transportation volume in the shortest time and with the minimum total cost; and Step III. accordingto the optimal scheduling scheme, scheduling the emergency materials.

Description

technical field [0001] The invention belongs to the technical field of material scheduling, and in particular relates to an emergency material scheduling method based on the primordial dual theory. technical background [0002] Usually, traditional material dispatching requires the least total project dispatching cost. In some emergency situations, such as emergency rescue and disaster relief, emergency medical treatment, etc., the first consideration is to transfer emergency materials to different demand places in the shortest time, and secondly, the total transportation cost of the project is required to be the least. [0003] Since the problem of emergency material allocation is a typical multi-objective programming, there are two main methods to solve this problem: one is to use traditional interactive algorithms, fuzzy programming methods and genetic algorithms to directly solve multi-objective programming problems; the other is to use the The multi-objective programmi...

AI Technical Summary

Problems solved by technology

When there are many supply points and disaster-affected points involved in the emergency dispatching problem, the calculation scale of the problem will expand rapidly. Traditional interactive algorithms, fuzzy programming methods and genetic algorithms all face the problem that the calculation scale increases significantly and the calculation time increases significantly.

In addition, transforming the general form of unbalanced emergency material allocation problem with unequal supply and demand into a balanced material allocation problem will artificially expand the scale of the problem, and the algorithm process for solving traditional transportation problems is complicated, which is not conducive to testing whether the obtained solution is is the optimal solution

Images