检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:邓连波[1] 曾宁鑫 陈雨欣 肖龙文[1] DENG Lianbo;ZENG Ningxin;CHEN Yuxin;XIAO Longwen(School of Traffic and Transportation Engineering,Central South University,Changsha 410075,China)
机构地区:[1]中南大学交通运输工程学院
出 处:《铁道科学与工程学报》2019年第10期2407-2413,共7页Journal of Railway Science and Engineering
基 金:国家自然科学基金资助项目(71471179);中国铁路总公司重点课题(N2018X009)
摘 要:研究基于票额分配的高速铁路多列车多OD的动态定价问题。以多列车的总收益最大为目标函数,建立多列车多OD的动态定价和票额分配联合优化模型,并在约束条件中充分考虑实际运营的需要。设计了将模型分解为双层规划的分治优化方法,通过票额分配与动态票价的分治优化,有效降低该类大规模问题的求解难度,并提高了求解效率。最后用20列车350个乘车OD的大型算例对模型和方法进行验证,为高速铁路动态定价的实际应用提供支持与参考。This paper studies the dynamic pricing problem based on seat allocation of multiple trains and multiple O-D itineraries on high speed railway.Take the maximum total revenue of multiple trains as the objective function.A joint optimization model of dynamic pricing and seat allocation for multiple trains and multiple O-D itineraries was established.The actual operation requirements were fully considered in the constraint conditions.The model was decomposed into a bilevel programming to solve the problem.Dynamic price and seat allocation were optimized by divide-and-conquer method.The difficulty of solving this kind of large-scale problem was reduced effectively.And improve the solving efficiency.Finally,the model and method were verified with a large scale of example with 20 trains and 350 O-D itineraries.It provided support and reference for the practical application of dynamic pricing.
分 类 号:U293[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222