摘要
以最小化客户的最晚交货时间为目标,建立了多车辆直运越库物流调度问题的混合整数线性规划模型,并使用优化工具ILOG CPLEX求解得到了适当规模问题和小规模问题的精确最优解;基于最大加工时间(LPT)规则,提出求解多车辆直运越库物流调度问题的启发式算法,通过对中等以及大规模实例的数值计算,比较了混合整数线性规划模型和启发式算法之间的计算性能.结果表明,启发式算法具有良好的近似性能,所测24组实例中的相对误差不超过9.5%,接近于精确解.
The multi-vehicle direct delivery cross docking logistics scheduling problem was investigated. The objective is to minimize the latest customer delivery time. Firstly, a mixed integer linear programming model is built to describe this problem and solved by the known optimization tool ILOG CPLEX for small scale instances. Secondly, two heuristics based on LPT rule are proposed, and their computational complexities are given. Finally, according to the exact solutions obtained through mixed integer linear programming for smaller scale instances, the performances of heuristics are analyzed. Moreover, comparisons between the given two heuristics are also presented for moderate and larger scale instances.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2009年第9期1403-1406,1416,共5页
Journal of Shanghai Jiaotong University
基金
国家自然科学基金资助项目(70771063)
国家自然科学基金重大国际(地区)合作研究项目(20710015)
关键词
越库
直运
物流
混合整数线性规划
启发式算法
cross docking
direct delivery
logistics
mixed integer linear programming
heuristics
