摘要
分析了有严格时间限制的大宗物资运输车辆配置问题的特点。对各需求点时间限制进行排序、分级,将问题分为若干个阶段,建立了任一阶段的整数目标规划模型,采用序贯式算法求解此模型。通过顺序求出任一阶段满意解,从而求出问题的满意解,并对求解过程中出现各种情况进行了讨论。最后给出实例证明上述方法的可行性。
The paper analyzes the character of vehicle configure problem of large-quantity cargoes transportation with strict time constraint. Through ranking and grading the constrained time of all demand point, the problem is broken down into some phases, integer goal programming model of the phase is set up, and sequential algorithm is given to solve the model. The satisfactory solution of the problem is gained by orderly solving the model of the phase order, and the situation in the process of resolution is discussed. Finally, an example is given and the result expressed validity of the method.
出处
《工业工程》
2006年第5期101-103,108,共4页
Industrial Engineering Journal
关键词
时间限制
物资
运输
time constraint
goods
transportation
