摘要
以旅游观光巴士为背景,在多重图中对旅游观光巴士的线路进行优化。以总成本最小化为目标,建立混合整数规划模型,并设计了混合禁忌搜索算法进行求解。为解决多重图中的平行弧选择这一NP-hard问题,还设计了一种高效的启发式弧选择算法。数值实验表明:所设计的混合禁忌搜索算法获取最优解的性能优异,并且能有效处理大规模网络;与目前解决多重图中弧选择问题的主流算法动态规划相比,所设计的启发式弧选择算法求解性能更好;基于多重图优化旅游观光巴士线路可有效降低总成本。
A sightseeing bus routing problem for tourist buses in a multigraph framework was proposed,aiming to minimize total costs.A mixed-integer programming model was established,and a hybrid tabu search algorithm was designed to solve the problem.To address the NP-hard challenge of selecting parallel arcs in a multigraph,an efficient heuristic arc selection algorithm was also developed.Numerical experiments demonstrate that the hybrid tabu search algorithm exhibits superior performance in obtaining optimal solutions and effectively handles large-scale networks.Compared with dynamic programming,the mainstream method for solving arc selection problems in multigraphs,the heuristic arc selection algorithm achieves better performance.Optimizing tourist bus routes based on a multigraph framework can significantly reduce total operational costs.
作者
徐国勋
陈曦
高山峰
邹安
XU Guoxun;CHEN Xi;GAO Shanfeng;ZOU An(International School of Tourism and Public Administration,Hainan University,Haikou,Hainan 570228,China)
出处
《工业工程与管理》
2025年第4期118-127,共10页
Industrial Engineering and Management
基金
国家自然科学基金资助项目(72161008)
海南省自然科学基金资助项目(823RC471)。
作者简介
徐国勋(1984-),河南商丘人,副教授,博士,主要研究方向为物流优化和旅游线路优化。E-mail:xgxbing@126.com.
