求解带用户满意度的多目标实时车辆路径问题的改进伊藤算法

发布时间：2018-07-29 09:08

【摘要】：基于对标准车辆路径问题的分析,本文构建了一种包括交通因素、客户需求动态改变、用户满意度的多目标动态车辆路径问题模型.针对伊藤算法在求解离散组合优化问题时效率较低、收敛性较差等缺陷,本文以具有通用性的伊藤算法为框架,参考蚁群算法,设计了伊藤-蚂蚁优化算法,并采用正交实验的方法,分析了改进算法参数的设置问题.为了验证改进算法的有效性,文章对标准测试数据集中的数据进行了测试.最后,将标准测试数据改编成符合带用户满意度的多目标实时车辆路径问题模型的测试数据,并用改进算法进行求解.实验结果表明,本文提出的问题模型和改进算法是可行的、有效的.
[Abstract]:Based on the analysis of the standard vehicle routing problem, this paper constructs a multi-objective dynamic vehicle routing problem model which includes traffic factors, customer demand dynamic change and customer satisfaction. Aiming at the shortcomings of Ito algorithm in solving discrete combinatorial optimization problems, such as low efficiency and poor convergence, this paper designs an Ito ant optimization algorithm based on the general Ito algorithm and referring to ant colony algorithm. The parameter setting problem of the improved algorithm is analyzed by orthogonal experiment. In order to verify the effectiveness of the improved algorithm, the paper tests the data in the standard test dataset. Finally, the standard test data is adapted to the test data of the multi-objective real-time vehicle routing problem model with user satisfaction, and the improved algorithm is used to solve the problem. Experimental results show that the proposed problem model and improved algorithm are feasible and effective.
【作者单位】：武汉大学计算机学院;河池学院计算机与信息工程学院;广西高校系统控制与信息处理重点实验室;
【基金】：国家自然科学基金(No.60873114,No.61170305) 广西自然科学基金(No.2013GXNSFBA019282) 广西高等学校科研项目(No.KY2015YB254) 国家级大学生创新创业训练计划(No.201410605055,No.210510605024/25) 广西混杂计算与集成电路设计分析重点实验室开放基金课题(No.HCIC201411)
【分类号】：U116.2

【参考文献】