Research On Algorithms Of Multi-dimensional Discrete Resource For Allocation Problems

The problem of multi-dimensional resource for allocating is to allocate resources to the various departments, to get the maximum benefits. However, the variables in question are mostly discrete variables rather than continuous variables, so that we can’t directly solve the problems by using methods to solve the continuous problems. Meanwhile, the problems of multi-dimensional discrete resource for allocating are often to solve in life and in the production process, but also the problems of multi-dimensional discrete resources for allocating in management science is an important issue, how to better allocate resources for multi-dimensional discrete direct impacting on the production of various departments efficiency, therefore the algorithms of resources allocation for multi-dimensional discrete problem has important theoretical and practical significance.In this paper, we build the model of multi-dimensional constrained optimization for discrete resources allocation problems, and in the case of the introduction of0-1variables, the multi-dimensional optimization model of discrete resources is conversed into special0-1programming model, so long as it can quickly and efficiently the solution obtained0-1programming problems can be solved multidimensional discrete resource allocation problem. This article will first use a remake algorithm to solve the0-1programming model, a remake of the effect algorithm for small-scale problems better, but the calculation in solving large-scale problems is slower, and estimation of distribution algorithm and particle swarm algorithm can quickly and efficiently to solve large-scale problems, but it is easy to fall into local optimal solution or a premature, the new algorithm used in this paper can quickly solve large-scale0-1programming problem.