CAJ | 학술논문

乘用车的物流运输问题是物流行业中的 NP 完全问题。文中使用2014年全国研究生数学建模竞赛 E 题的数据，根据客户订单的需求，研究乘用车物流的装载方案以及运输计划问题，以达到提高物流企业的工作效率，降低整车物流配送成本的目的。首先通过 MATLAB 软件编程计算得到1－1和1－2型轿运车装载Ⅰ、Ⅱ及Ⅲ型车的最优满载方案分别为35、69。在此基础上以轿运车最少调用量为优化目标，乘用车需求量以及轿运车型号比例为约束条件，建立整数规划模型，并使用 Lingo 软件编程求解确定出最优运输方案为：轿运车最少调用量为25辆（1－1型轿运车21辆，1－2型轿运车4辆），轿运车行驶路程最短为6652。
승용차적물류운수문제시물류행업중적 NP 완전문제。문중사용2014년전국연구생수학건모경새 E 제적수거，근거객호정단적수구，연구승용차물류적장재방안이급운수계화문제，이체도제고물류기업적공작효솔，강저정차물류배송성본적목적。수선통과 MATLAB 연건편정계산득도1－1화1－2형교운차장재Ⅰ、Ⅱ급Ⅲ형차적최우만재방안분별위35、69。재차기출상이교운차최소조용량위우화목표，승용차수구량이급교운차형호비례위약속조건，건립정수규화모형，병사용 Lingo 연건편정구해학정출최우운수방안위：교운차최소조용량위25량（1－1형교운차21량，1－2형교운차4량），교운차행사로정최단위6652。
Logistics transportation problem of vehicle is the NP complete problem of logistics industry.This paper used the E problem datas of the National Mathematical Modeling Contest for Postgraduates in 2014,according to the demand of customer orders,in order to improve the work efficiency of logistics enterprise,reduce the cost of vehicle logistics distribution,we study the loading scheme of vehicle logistics and transportation plan.Firstly,we used Matlab programming to calculate the loading method of the 1 -1 type vehicle transporters and the 1 -2 type vehicle transporters loading of Ⅰ、Ⅱ and Ⅲ types of vehicle are respectively 35 and 69,then we take vehicle transporter minimum number as optimization objective,with vehicle demand and the proportion of vehicle transporters as the constraint conditions,to establish the integer programming model,and finally we used Lingo programming to calculate the optimal transport plan is:vehicle transporter minimum number is 25 (21 1 -1 type vehicle transporters,4 1 -2 type vehicle transporters),the shortest driving distance is 6652.