Emergency Material Scheduling Method Based on Primitive Dual Theory

Abstract

The invention provides a method for dispatching emergency materials based on the primordial dual theory, which is characterized in that it comprises: Step I1. Determine the dispatch time and dispatch cost from each supply point to each demand point, and obtain the dispatch time and cost matrix; Step I2. Determine The maximum value of the smallest element in each row and each column element in the dispatch time matrix is ​​used as the current alternative optimal solution; Step I3. Establish a minimum cost flow network model related to the current alternative optimal solution; Step I4. Use the dual principle Solve the optimal solution of the model and determine the maximum flow; Step I5. Determine whether the flow reaches a given value, and if so, find the optimal matching solution; otherwise, update the current alternative optimal solution and model with the principle of minimum value-added, and return to step I4 ; Step II. According to the optimal matching plan, combined with the cost matrix, seek the optimal dispatching plan for the maximum transport volume in the shortest time and minimize the total cost; Step III. Carry out emergency material dispatching according to the optimal dispatching plan.

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. [0002] technical background [0003] 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. [0004] 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 p...

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