危险货物的最优配装及其软件设计

The Optimal Matching Loading for Dangerous Freight and Its Software Design

一、引言 根据铁道部的安全条例规定,所有零担货物可划分为29大类,其中危险物中有些可两两配装,而另外一些配装则会引起爆炸、燃烧、腐蚀等恶性事故。危险货物的分类及其配装规则详见表1。根据表1的要求,人们总希望最大限度地配装现场货物。我们称使货物配装的种数达到最大的方案为最优配装方案。如何既迅速又准确地寻求货物的最优配装方案是铁路货运部门亟待解决的一个现实问题。在过去的货运工作中,铁路装运工人凭直观经验进行选配装运货物。然而仅靠经验配装往往有很大缺陷。其一,时效性差。现代化的运输设施总是要求车到尽快装货。由于现场的货物多变,种类亦不确定。

In loading, Zhengzhou Freight Transport Station poses the problem of matching loading for dangerous freight as follows: there are n kinds of freight to be loaded in the station. According to their chemical properties,the part of goods can beloaded in pairs, the other matching loading may cause accidents. To ask how many kinds of the freight can be at most loaded. Here two basic requirements must be met.One is that the answer is precise in case accidents occur, the other is to solve fast so as to finish loading up in the limite time. This paper completely solves the above problem by setdng the combinatouialoptimum model, further gives the software of the Branch-Bound Algorithm for solving the model The practice indicates that the operationof the algorithm is satisfiable.