智能优化算法在暑假旅游路线安排中的应用
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Application of Intelligent Optimization Algorithms in Summer Tourism Route Arrangement
  • 作者:周福来
  • 英文作者:ZHOU Fu-lai;School of Computer Science and Technology,Jilin University;
  • 关键词:智能优化算法 ; 旅游路径规划 ; 粒子群算法 ; 数学建模
  • 英文关键词:intelligent optimization algorithm;;tourism path planning;;particle swarm optimization;;mathematical modeling
  • 中文刊名:RJDK
  • 英文刊名:Software Guide
  • 机构:吉林大学计算机科学与技术学院;
  • 出版日期:2019-06-15
  • 出版单位:软件导刊
  • 年:2019
  • 期:v.18;No.200
  • 语种:中文;
  • 页:RJDK201906006
  • 页数:4
  • CN:06
  • ISSN:42-1671/TP
  • 分类号:27-30
摘要
为解决暑假旅行人员以成本最小化为目标的最佳旅行路线选择难题,基于路径优化理论(VRP)及粒子群算法,设计了以暑假旅游路线最短为优化目标的数学模型,采用计算机编程技术,设计了求解该优化模型的粒子群算法,并选择案例对模型及算法进行了验证。案例应用结果表明,该模型和算法能够有效解决最佳旅游路线选择难题,正确率达98%。基于VRP理论及粒子群算法的最短路选择模型不仅能够快速求解出最优路径方案,还能够有效降低人工经验选择最短路径中存在的误差。
        In order to solve the problem of choosing the best travel route for the travelers during the summer vacation with the goal of minimizing the cost,based on the theory of path optimization(VRP)and particle swarm optimization(PSO),this paper studies the application of intelligent optimization algorithm in summer vacation tourism route arrangement. Firstly,a mathematical model is designed to optimize the shortest route of summer vacation tourism. Secondly,a PSO algorithm is designed to solve the optimization model by using computer programming technology. Finally,a case is selected to illustrate the model designed in this paper. The algorithm is validated. The application results show that the model and the algorithm can effectively solve the problem of travelers choosing the best tour route in summer vacation,and the correct rate is 98%. The shortest path selection model based on VRP theory and particle swarm optimization can not only solve the optimal path scheme quickly,but also effectively reduce the error in manual selection of shortest path.
引文
[1]陈文娟.浅议旅游线路设计中旅游景点的选择和安排[J].环球市场,2015(3):101.
    [2]陈荣虎,何运杰.基于SPMD的粗粒度并行遗传算法在立体仓库路径优化中的应用[J].软件导刊,2018,17(12):108-112.
    [3]杨乐,向凤红,毛剑琳.基于改进蚁群算法快速求解迷宫路径问题研究[J].软件导刊,2018,17(7):108-110,115.
    [4]黎泽,黄俊毅,刘冠弟,等.基于数学建模方法的旅游船只行程安排探究[J].科技与生活,2012(8):198-199.
    [5]鄢栋,陈家琪.ICP策略下带软时间窗的动态车辆路径优化问题研究[J].软件导刊,2018,17(3):172-175.
    [6]陈婧怡,邱荣祖.基于ArcGIS的多温区冷藏车辆路径优化[J].上海海事大学学报,2019,40(1):8-13.
    [7]GRAF M,POY M,BISCHOF S,et al.Rescue path optimization using ant colony systems[C].2017 IEEE Symposium Series on Computational Intelligence,2017.
    [8]MA C,HAO W,HE R,et al.Distribution path robust optimization of electric vehicle with multiple distribution centers[J].PLoS ONE,2018,13(3):e0193789.
    [9]LAI M,YANG H,YANG S,et al.Cyber-physical logistics system-based vehicle routing optimization[J].Journal of Industrial and Management Optimization,2013,10(3):701-715.
    [10]常朝稳,李黎.基于约束规划的旅游多车辆行程路线研究[J].计算机应用,2006,26(s2):202-204.
    [11]邹腊英.基于TSP问题的旅游路线安排[J].兰州文理学院学报:自然科学版,2015,29(5).
    [12]HUNGERL NDER P,RENDL A,TRUDEN C.On the slot optimization problem in on-line vehicle routing[J].Transportation Research Procedia,2017,27:492-499.
    [13]HAN L,HOU H,YANG J,et al.E-commerce distribution vehicle routing optimization research based on genetic algorithm[C].2016International Conference on Logistics,Informatics and Service Sciences(LISS),2016.
    [14]姚卫粉,许峰.求解车辆路径问题的协同进化遗传算法[J].软件导刊,2015,14(1):57-59.
    [15]WEN J,LI Y.Vehicle routing optimization of urban distribution with self-pick-up lockers[C].International Conference on Logistics,2017.
    [16]GUEZOULI L,ABDELHAMID S.A multi-objective optimization of multi-depot fleet size and mix vehicle routing problem with time window[C].International Conference on Systems&Control,2017.
    [17]曹阳.城市旅游规划行程链的模型构建及其应用研究[D].南京:南京师范大学,2014.
    [18]李进立,韦程东,刘广会,等.旅游路线规划问题[J].广西师范学院学报:自然科学版,2016(1):30-38.
    [19]钟仪华,罗仕明.分块分层优化的旅游路线规划问题研究[J].运筹与管理,2017(9):66-71.
    [20]贾振亮,司志刚.基于混合整数规划的旅游车辆调度设计和仿真[J].计算机仿真,2007,24(8):233-235.
    [21]ROGERSON C M.Tourism routes as vehicles for local economic development in South Africa:the example of the magaliesberg meander[J].Urban Forum,2007,18(2):49-68.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700