摘要
轿运车的装载运输分配问题是整车物流中的典型问题。采用假定的数据及要求对该问题进行了研究,以达到提高输运效率,降低成本的目的。将板长利用率在95%以上的所有装载组合建立矩阵,用动态规划得到相应装载方式的轿运车数量。在严格满足每一辆车的装载要求的同时,选用穷举法通过计算机仿真随机产生轿运车每层的装载方式。尽可能地节约了轿运车的空间,然后从可行的方案中遴选出最优的装载实施方案。综合2种方法得到最优方案。
The car carrier load transportation allocation problem is a typical problem in vehicle logistics. In order to improve the efficiency of transport and reduce the cost, this problem was studied by adopted hypothetical data and requirements. All the load combinations whose utilization factor of the length of sweeping board is more than 95% established a matrix. Then the dynamic programming obtained the number of car carrier to the corresponding loading plan. By using the exhaustion method, through computer simulation, loading plan of each layer of car carrier was randomly produced, strictly meeting the loading requirements of each car at the same time. The space of the car carrier was saved as much as possible, and then the optimal loading plan was picked up from feasible solutions. The two kinds of method were analyzed to get the optimal solution.
出处
《系统仿真学报》
CAS
CSCD
北大核心
2015年第8期1868-1874,共7页
Journal of System Simulation
关键词
整车物流
线性规划
动态规划
穷举法
计算机仿真
vehicle logistics
linear programming
dynamic programming
enumeration method
computer simulation
