摘要
对传统有时间窗的车辆优化调度问题进行了分析 ,指出了其中存在的问题。提出了一个以最大的顾客满意度和最小的费用为目标的多目标模型 ,给出了具体的操作步骤。从遗传算法的角度分析了该模型在最坏和最好情况下的时间复杂度。仿真结果和在某物流公司的实际应用证明该算法是可行的 。
There are some problems of custower satisfaction in traditional vehicle routing algorithms with time window. So we presented a GA-based multi-objective model aiming at largest customer satisfaction and least cost. The time complexity of this model was analysed. The simulation and practical application show that this algorithm is practical, and has better time and optimization property than traditional algorithms.
出处
《计算机应用》
CSCD
北大核心
2004年第9期144-146,共3页
journal of Computer Applications
关键词
遗传算法
车辆优化调度问题
费用
顾客满意度
genetic algorithm(GA)
vehicle routing problem
cost
satisfaction of customers
