主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2016, Vol. 24 ›› Issue (12): 166-176.doi: 10.16381/j.cnki.issn1003-207x.2016.12.019

• 论文 • 上一篇    

基于改进量子进化算法的车货供需匹配方法研究

牟向伟, 陈燕, 高书娟, 姚思雨   

  1. 大连海事大学交通运输管理学院, 辽宁 大连 116026
  • 收稿日期:2016-01-28 修回日期:2016-05-31 发布日期:2017-03-07
  • 通讯作者: 牟向伟(1982-),男(汉族),辽宁人,大连海事大学交通运输管理学院,博士,研究方向:数据挖掘、知识发现,E-mail:muxiangwei@dlmu.edu.cn. E-mail:muxiangwei@dlmu.edu.cn
  • 基金资助:

    国家自然科学基金资助项目(71271034);国家科技支撑计划课题(2014BAH24F04);中国博士后科学基金资助项目(2014M551063);辽宁省教育厅科技研究项目资助(L2014203);辽宁省社会科学规划基金项目(L14BGL012);中央高校基本科研业务费专项资金资助(3132016046)

Vehicleand Cargo Matching Method Based on Improved Quantum Evolutionary Algorithm

MU Xiang-wei, CHEN Yan, GAO Shu-juan, YAO Si-yu   

  1. Transportation Management College, Dalian Maritime University, Dalian 116026, China
  • Received:2016-01-28 Revised:2016-05-31 Published:2017-03-07

摘要: 为了提高货运供需匹配效率,建立了一种车货供需匹配数学模型,描述了车货匹配问题的目标与相关约束,对量子进化算法进行设计与改进用于对此问题求解,提出了有约束惩罚的适应度衰减方法,解决了量子群初期无强可行解时最优量子个体的选择问题,引入量子群成熟度对量子进化算法的退出机制进行改进。在实验中,使用改进的量子进化算法和标准遗传进化算法进行对比,并对算法参数进行优化,实验中量子进化算法表现出更好的收敛速度,准确性和稳定性,但是量子群规模存在“瓶颈问题”,更大规模的量子群对算法优化效果并不明显且需要耗费更长的计算机时间,量子旋转角增量与算法收敛速度正相关,与全局搜索能力负相关。结果表明,改进的量子进化算法可以高效地搜索到较为优秀的车货匹配方案,为车主和货主推荐较为合理的车货供需信息资源。

关键词: 车货匹配, 量子进化算法, 物流信息平台

Abstract: In order to solve the logistics supply and demand information asymmetry and improve the efficiency of logistics business docking, a lot of public logistics information platforms or systems have been built to post and share the logistics information. There exists relative research about how platforms passively response user's query for logistics supply and demand information, but the research about how to match vehicle and cargo information proactively and intelligently is very few.Vehicle and cargo matching problem is regarded as a kind of combinatorial optimization problems in this paper, a mathematical model has been established, and the model declares two decision variables:the constraints and the objective function. A kind of quantum evolutionary algorithm has been designed and proposed to solve the vehicle and cargo matching problem, which is improved by the method of the attenuation fitness with constraint punishment. An index, Quantum Swarm Maturity Value (QSMV), is introduced as a reference criteria for the quantum evolutionary algorithm exit. Vehicle and cargo matching problem based on quantum evolutionary algorithm can be solved into six steps, including:quantum group initialization, fitness calculation, selection of the optimal quantum individual, the judgment of algorithm exit, quantum group evolution and the optimal individual decoding. In the experiment, experimental data is given a set composed of 5 vehicles and 7 cargos. The exact solution is obtained by using the traversal method, which takes 6 hours and the fitness is 0.283226. An optimal solution is obtained by the quantum evolutionary algorithm, which takes 0.656 seconds and the fitness is 0.2832. Furthermore, the improved quantum evolutionary algorithm is compared with the standard genetic algorithm, experiment results show that quantum evolutionary algorithm's convergence speed is increased by 58%, average error is reduced by 86% and stability is increased by 32%. Experiment results also show that quantum group scale has "bottleneck" problem, larger quantum group scale does not improve the algorithm performance obviously, and quantum rotation angle increment is positive correlation to algorithm convergence speed, and negatively correlated to global search ability.The results show that the improved quantum evolutionary algorithm can efficiently get the optimal solution for the vehicle and cargo matching problem, and enable the public logistic information platform to intelligently recommend reasonable supply or demand information for different users, and help users reduce the idle vehicles rate and empty-run rate, and improve the utilization ratio of logistics information resources.

Key words: vehicle and cargo matching, quantum evolutionary algorithm, logistic information platform

中图分类号: