检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周和平[1] 高英楠 郜敏 林辉 刘佳丽 ZHOU Heping;GAO Yingnan;GAO Min;LIN Hui;LIU Jiali(School of Traffic&Transportation Engineering,Changsha University of Science&Technology,Changsha 410114,China)
机构地区:[1]长沙理工大学交通运输工程学院,湖南长沙410114
出 处:《长沙理工大学学报(自然科学版)》2024年第5期156-164,共9页Journal of Changsha University of Science & Technology:Natural Science
基 金:国家自然科学基金项目(51178061);湖南省科技计划项目(2019JJ40311)。
摘 要:【目的】探究考虑残疾乘客优先的多车场定制公交路径优化问题,为定制公交路径决策提供理论依据。【方法】构建以车辆行驶时间成本、车辆固定派遣成本、残疾乘客等待时间成本之和最小为目标,包含多起终点、多停车场、多车型、多乘客类型、残疾乘客上下车优先等诸多要素的定制公交路径优化模型。改进Benders分解算法,并采用多平面割约束策略及引入松弛变量的方式提高算法求解效率,最后通过案例对模型和算法进行分析和验证。【结果】与未考虑残疾乘客优先相比,在考虑残疾乘客优先的情况下,残疾乘客的等车时间和乘车时间分别减少了30.6%和1.3%;与传统分支定界算法相比,改进的Benders分解算法在获得满意解的同时,运算时间缩短了20.6%。【结论】本文提出的模型有效减少了残疾乘客等车时间和乘车时间,改进的Benders分解算法同样有效。本研究对解决残疾人出行问题具有重要的现实意义。[Purposes]This paper aims to explore the optimization of customized bus routes with multiple parking lots considering the priority of disabled passengers and provide a theoretical basis for the decision-making of customized bus routes.[Methods]A customized bus route optimization model was built with the goal of minimizing the sum of vehicle travel time cost,fixed vehicle dispatching cost,and waiting time cost for disabled passengers,involving elements such as multiple origins and destinations,multiple parking lots,multiple vehicle types,multiple passenger types,and priority for disabled passengers to get on and off the bus.The Benders decomposition algorithm was improved.The multi-plane cut constraint strategy was adopted,and the slack variables were introduced to speed up the algorithm solving efficiency.Finally,the model and algorithm were analyzed through a case.[Findings]Compared with the case without considering the priority of disabled passengers,the waiting time and travel time of disabled passengers after considering their priority are reduced by 30.6%and 1.3%respectively.Compared with the traditional branch-and-bound algorithm,the improved Benders decomposition algorithm can obtain satisfactory solutions while reducing the calculation time by 20.6%.[Conclusions]The model proposed in this paper effectively reduces the waiting time and travel time of disabled passengers,and the improved Benders decomposition algorithm is effective.The results are of important practical significance in solving the travel problem of the disabled.
关 键 词:车辆调度 路径优化 多起终点 Benders分解算法 残疾乘客优先
分 类 号:U492.22[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147