两辆铁路平板车装货问题的最优化解研究

For the two flatbed rail loaded question, this paper established a integer linear programming (ILP) general model (model A),which is the biggest case in order to occupy space (the total thickness) and the smallest of the remaining space for two vehicles to establish the objective function. On the basis of the above, the paper also put forward three different directions of the simplified model (model B, C, D, E). The problem is given by the combination of constraints, this paper use the software LINGO to give a set of optimal solution, because LINGO can give only one solution, the paper alse discusses the optimal solution for all of the conditions with the goods, respectively Using C + + and vb programmed to solve the problem. In the evaluation of the model, this paper take into account the actual impact of transport in the process of loading optimization of the factors which may be more than an indicator of space utilization, and policy-makers may also achieve the optimization of these factors with different importance.So the paper use a weighted coefficient to measure the space expanded the utilization of space and a reasonable load on the optimization. The basic idea is to solve through a weighted combination of the introduction of a new goal, which will be more programming into a single goal, so that the model even more practical significance.