摘要
对带时间约束的物流配送中心车辆调度问题,采用混合整数规划方法进行建模.分析了该模型用精确算法进行求解的复杂性,指出对实际问题若完全采用精确算法求解往往达不到实时响应的要求.提出了遗传算法与启发式算法相结合的求解方法,将该问题分解为车辆分配和单一车辆路线安排两个相互关联的子问题进行求解.仿真结果表明,该算法是很有效的.
Mixed Integer-Planning Method was applied to establish the model to solve the vehicle routing problem with time windows for Distribution Center. The complexity of solving the model with exact algorithms completely was studied and showed that an exact algorithm could not meet the practical requirement in time. An algorithm is proposed that decomposes the problem into two parts: vehicle's distribution and one vehicle's routing, and solves the problem by combining genetic algorithm with heuristic solution. The simulation results showed that the algorithm is very efficient.
出处
《浙江大学学报（工学版）》
EI
CAS
CSCD
北大核心
2003年第5期512-516,共5页
Journal of Zhejiang University：Engineering Science
