牺牲空间算法求解平板车装货问题  

Solution to the Shipments of Flatcars by Sacrifice Space Algorithm

作　　者：庞小琪[1] 

机构地区：[1]成都工业学院教务处,成都610031

出　　处：《成都工业学院学报》2013年第1期40-42,共3页Journal of Chengdu Technological University

摘　　要：以2辆平板车的装货问题为例,提出了一种牺牲空间算法,即适当地增加算法的空间复杂度,从而大大减少了时间复杂度。并通过与其他2种算法的比较,得出牺牲空间复杂度算法对于求解组合、优化问题具有操作简单、运算速度快、实用性强等优点。最后,以该算法求解了平板车的装货问题,验证了该算法的实用性。Taking loading problem to two flat trucks as an example, the author presents a sacrifice space algorithm. The time complexity is significantly reduced by increasing space complexity. And with the comparison between the other two algorithms, it is obtained that sacrifice space algorithm has the advantages of simple operation, fast operation speed, high practicability for solving combinatorial optimization problems,. Finally, the algorithm is used to solve the problem of fiat car loading, verify the practicability of the algorithm.

关 键 词：平板车 空间复杂度 时间复杂度 

分 类 号：TP301.5[自动化与计算机技术—计算机系统结构]