基于改进GQPSO算法多目标卷烟配送策略.docVIP

基于改进GQPSO算法多目标卷烟配送策略 　　摘要：卷烟配送普遍呈现客户点多、路线复杂的特点，是典型的组合NP难题。以配送成本最低且配送量均衡为优化目标，建立带时间窗的卷烟配送通用数学模型；引入选择与交叉操作，提出运用改进的遗传量子粒子群算法（GQPSO）实现车辆编号和配送次序同步寻优，以制定卷烟配送的最优策略。实例表明：GQPSO能快速有效制定满足优化目标的卷烟配送策略。 　　关键词：卷烟配送；组合非线性优化；成本最低；配送量均衡；遗传量子粒子群算法 　　中图分类号：F760.3文献标识码：A 　　 　　Abstract: Tobacco delivery, characterized by excessive delivery points and complicated delivery routes, is a typical combined Nondeterministic Polynomial（NP）problem. With the minimal delivery cost and balanced carrying to be target, the common tobacco delivery mathematic model with time window is built. A modified Genetic Quantum-behave