轿运车配载问题的整数线性规划模型及解法  

LINEAR INTEGER PROGRAMMING MODEL AND METHOD FOR SOLVING CAR-CARRIER LOADING PROBLEMS

作　　者：倪任远 封建湖[2] 

机构地区：[1]南京大学工程管理学院,南京210046 [2]长安大学理学院,西安710064

出　　处：《高等学校计算数学学报》2017年第3期200-211,共12页Numerical Mathematics A Journal of Chinese Universities

基　　金：国家自然科学基金(11171043)

摘　　要：1引言 轿运车配载是整车物流过程中经常遇到的问题[1]．由于轿运车的租用费用非常昂贵，配载问题通常要求在保证运输任务完成的条件下调用最少数量的轿运车并给出其配载和运输方案[2]．轿运车配载问题一般可叙述为：设可调用的轿运车类型有k种，Car-carrier loading optimization can improve the transportation ca- pacity and control the transportation cost of the logistics company. This paper proposed an integer linear programming model for the car-carrier loading prob- lems. The optimal loading strategy of each Car-carrier can be obtained by solving this model. To solve this model, two easy sub-problems, namely, associated prob- lem and transportation problem are split. By solving these two sub-problems, the optimal solution of the original problem can be quickly obtained. At last, numer- ical experiments are given to demonstrate the solving strategy. It shows that the method can quickly get the optimal loading scheme.

关 键 词：整数线性规划模型 配载 解法 物流过程 运输方案 运输任务 调用 整车 

分 类 号：O221.4[理学—运筹学与控制论]