基于铁路旅客效用最大化的出行选择服务方案优化研究与系统
|
摘要
本文以铁路旅客出行效用最大化为出发点,建立了基于铁路旅客效用最大化的出行服务方案选择模型,该模型旨在为不同收入水平等级旅客生成符合其自身效用最大化的出行方案,此外,本文理论研究成果将应用到正在开发的铁路旅客出行服务方案查询系统。本文的研究目的是为铁路旅客提供更好的出行查询服务。主要工作概括如下：
首先,对影响铁路旅客出行的因素进行了深入分析,认为旅行时间、费用、舒适度、发车时刻和到达时刻是主要影响因素,并对其进行了量化。
其次,基于网上列车时刻表,构建了旅客出行的简易换乘服务网络图。基于换乘服务网络图将铁路旅客出行服务方案选择问题抽象为运筹学图论中的最短路问题。建立了基于铁路旅客效用最大化的出行服务方案选择模型,利用Matlab软件实现了求解模型的K最短路算法程序。
再次,给出求解模型的具体步骤,对求解过程中关键问题的处理方法做了详细说明。以兰州到福州为例,按照模型的求解步骤,求出了符合不同收入水平等级旅客效用最大化的出行服务方案。
最后,介绍了正在开发过程中的铁路旅客出行服务方案查询系统的构建情况,结合本文研究实例,展示了该系统的部分构建成果。
The paper is based on maximizing the utility of railway passengers, the author created a choice-model of trip's planning which based on maximizing the utility of railway passengers, the model aimed at generating the best trip's planning for passengers of different income levels, moreover, results of theoretical studies will be applied to the inquiring system of trip's planning of railway passengers. The researching purpose of this paper is to provide perfect inquiry services for railway passengers. The major works is summarized as follows:
First, the author analyzed the impact factors of railway passengers'trips, picked up Travel time, Ticket price, Comfort, Departure time and Arrival time as the serious impact factors, then quantified these factors.
Second, the author designed a simplified transfer network of railway passengers which based on the online train schedules. Based on the transfer network, abstracted the problem about selecting trip's plans of railway passengers as the problem about finding the shortest path of graph theory in Operations research. Created a choice-model of trip's planning which based on maximizing the utility of railway passengers, and based on Matlab, developed the K_shortest path algorithm program which could solve the model.
Third, decomposed the specific steps of solving the model, and made some detailed introductions about dealing ways of the key issues in the process of solving the model. The researching case is from Lanzhou to Fuzhou, according to the steps of solving the model, found out the best trip's plan which maximized the utility of those passengers.
Finally, briefly introduced the developing situations of the inquiring system of trip's planning of railway passengers which being developed at present, and combined the researching case of this paper, showed partial functions of the system in current.
首先,对影响铁路旅客出行的因素进行了深入分析,认为旅行时间、费用、舒适度、发车时刻和到达时刻是主要影响因素,并对其进行了量化。
其次,基于网上列车时刻表,构建了旅客出行的简易换乘服务网络图。基于换乘服务网络图将铁路旅客出行服务方案选择问题抽象为运筹学图论中的最短路问题。建立了基于铁路旅客效用最大化的出行服务方案选择模型,利用Matlab软件实现了求解模型的K最短路算法程序。
再次,给出求解模型的具体步骤,对求解过程中关键问题的处理方法做了详细说明。以兰州到福州为例,按照模型的求解步骤,求出了符合不同收入水平等级旅客效用最大化的出行服务方案。
最后,介绍了正在开发过程中的铁路旅客出行服务方案查询系统的构建情况,结合本文研究实例,展示了该系统的部分构建成果。
The paper is based on maximizing the utility of railway passengers, the author created a choice-model of trip's planning which based on maximizing the utility of railway passengers, the model aimed at generating the best trip's planning for passengers of different income levels, moreover, results of theoretical studies will be applied to the inquiring system of trip's planning of railway passengers. The researching purpose of this paper is to provide perfect inquiry services for railway passengers. The major works is summarized as follows:
First, the author analyzed the impact factors of railway passengers'trips, picked up Travel time, Ticket price, Comfort, Departure time and Arrival time as the serious impact factors, then quantified these factors.
Second, the author designed a simplified transfer network of railway passengers which based on the online train schedules. Based on the transfer network, abstracted the problem about selecting trip's plans of railway passengers as the problem about finding the shortest path of graph theory in Operations research. Created a choice-model of trip's planning which based on maximizing the utility of railway passengers, and based on Matlab, developed the K_shortest path algorithm program which could solve the model.
Third, decomposed the specific steps of solving the model, and made some detailed introductions about dealing ways of the key issues in the process of solving the model. The researching case is from Lanzhou to Fuzhou, according to the steps of solving the model, found out the best trip's plan which maximized the utility of those passengers.
Finally, briefly introduced the developing situations of the inquiring system of trip's planning of railway passengers which being developed at present, and combined the researching case of this paper, showed partial functions of the system in current.
引文
[1]刘卫果,胡思继.旅客交通方式选择行为的模糊机会约束规划模型[J].北方交通大学学报,2002,26(2)：61-65.
[2]霍亮.铁路旅客乘车行为分析与客流分配研究[D].湖南：中南大学,2006.
[3]袁传宾.客运专线的修建对城际旅客出行的影响研究[D].成都：西南交通大学,2007.
[4]丁洁冰.基于SP调查的客运专线旅客乘车选择行为研究[D].北京：北京交通大学,2009.
[5]邹歆.基于铁路乘客出行特征的枢纽集散交通研究[D].北京：中国城市规划设计研究院,2010.
[6]于冉冉.基于铁路旅客需求异质性的换乘服务方案优化研究与系统[D].北京：北京交通大学,2011.
[7]周伟.旅客时间价值[J].交通运输工程学报,2003,3(3)：100-116.
[8]刘东坡.旅客旅行时间价值分析方法研究[J].华东经济管理,2003,17(4)：155-156.
[9]张冬青,宁宣熙.考虑收入因素的旅行时间价值模型研究[J].系统工程学报,2006,21(1)：1-4.
[10]布超,林晓言.旅客行为时间价值的Logit计算模型改进研究[J].技术经济,2009,28(3)：62-65.
[11]蒋寅,李彤.基于SP调查的天津市居民出行行为时间价值[J].城市交通,2009,7(2)：68-73.
[12]宗芳,隽志才,张慧永,贾洪飞.出行时间价值计算及应用研究[J].交通运输工程与信息,2009,9(3)：114-119.
[13]史峰,邓连波.旅客换乘网络优化设计[J].铁道科学与工程学报,2004,1(1)：78-82.
[14]聂磊,胡小风,佟璐,付慧玲.基于旅客列车开行方案的客流分配方法研究[J].交通运输工程与信息,2011,11(3)：87-92.
[15]傅冬绵.交通系统中最少换乘算法及其实现[J].华侨大学学报(自然科学版),2001,22(4)348350.
[16]赵巧霞,马志强,张发.以最小换乘次数和站数为目标的公交出行算法[J].计算机应用,2004,24(12)：136-138.
[17]苏爱华,施法中.公交网络换乘问题的一种实现[J].工程图学学报,2005(4)：55-59.
[18]刘雪岩.出行路线选择行为研究[D].北京：对外经济贸易大学,2006.
[19]史峰,邓连波,霍亮.铁路旅客乘车选择行为及其效用[J].中国铁道科学,2007,28(6)：117-121.
[20]E.Fernandez, J.De Cea, M.Florian, Cabrera E. Network equilibrium models with combined modes[J].Transportation Science,1994(28):182-192.
[21]J.Ane,T.Deal,Perez. Dual Graph Representation of Transport Networks [J.Transportation Research,1996,30(3):209-216.
[22]Lotan T. Effects of Familiarity on Route Choice Behavior in the Presence of Information[J].Transportation Research-Part C,1997,31(4):225-243.
[23]ChandraR.Bhat.A multi-level cross-classified model for discrete response variables[J]. Transportation Research B,2000(34):567-582.
[24]A.Lozano,G.Storchi. Shortest viable Path algorithm in multimodal network [J]. Transportation Research Part A,2001(35):225-241.
[25]Huang Haiiun, LI Zhichun. A Multiclass, Multi-criteria Logit-Based Traffic Equilibrium Assignment Model under ATIS[J]. European Journal of Operational Research, 2007,176(3):1464-1477.
[26]Thierry Blayac. Value of travel time:a theoretical legitimization of some nonlinear representative utility in discrete choice models [J]. Transportation Research Part B. 2001. 35. 391-400.
[27]Kaan Ozbay.Valuation of travel time and departure time choice in the presence of time-of-day pricing [J].Transportation Research Part A.2008.42.577-590.
[28]Kay W Axhausen. Income and distance stochastic of values of travel time savings New Swiss results [J].Transport Policy.2008.15.173-185.
[29]Fosgerau, M. Between-mode-differences in the value of travel time: Self-selection or strategic behaviour? [J]. TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT.2010.15.370-381.
[30]Mogens Fosgerau. The value of travel time variance. Transportation Research Part B 45 (2011):1-8.
[31]Maria Borjesson. On the income elasticity of the value of travel time. Transportation Research Part A 46 (2012): 368-377.
[32]南敬林.旅客旅行舒适度的需求分析[J].铁道运输与经济,2005,27(6)：79-80.
[33]史峰,邓连波,黎新华,等.客运专线相关旅客列车开行方案研究[J].铁道学报,2004,26(2)：16-20.
[34]陈建华,高自友.合理制定铁路旅客票价的优化方法[J].铁道学报,2005,27(4)：16-19.
[35]赵延风.基于消费者效用理论的图书馆服务模式分析[J].科技情报开发与经济,2008,18(22)：25-26.
[36]张嵩,王军,马金平.求解K最短路径的改进Dijkstra算法[J].中国经济与科学管理,2009,4：29-30.
[37]张彦.铁路客票中转换乘多径路选择问题的研究[J].铁道运输与经济.1997,8：11-13.
[38]邹明霞.基于Web的公交查询系统的设计与实现[D].武汉：华中科技大学,2008.
[39]张坤河.公交车查询系统的设计与实现[D].厦门：厦门大学,2009.
[40]汪江洪.公交换乘系统的研究与实现[D].成都：西南交通大学,2006.
[41]李永亮.基于蚁群算法的公交出行方案研究[D].北京：北京交通大学,2008.
[42]钱颂迪.管理运筹学[M].北京：清华大学出版社,2005.
[43]陆化普.交通规划理论与方法[M].北京：清华大学出版社,2006.
[44]谢金星,邢文训,王振波.网络优化[M].北京：清华大学出版社,2009.
[45]刘家壮,王建方.网络最优化[M].武汉：华中工学院出版社,1987.
[46]Sheffi Y. Urban transportation networks:equilibrium analysis with mathematical Programming methods. New Jersey:Prentice2Hall INC, Englewood Cliffe.1985.
[47]Nuzzolo, Agostino, Crisalli, Umberto and Gangemi, Francesca. A behavior choice model for the evaluation of railway supply and pricing policies [J].Transportation Research Part A:Policy and Practice,2000,34(5):395-404.
[48]Thomas H.Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein. Introduction to Algorithms[M].The MIT Press,2002.
[49]Matthew W, Carlyle R, Kevin W. Near Shortest and K-shortest Simple Paths [J], Networks, 2005,46(2):98-109.
[50]Macgegor M H, Grover WD. Optimized k-Shortest Path Algorithm for facility Restoration [J]. Software Practice and Experience,1994,24(9):823-828.
[51]Hai Yang, Hai-Jun Huang. The multi-class, multi-criteria traffic network equilibrium and system optimum Problem [J].Transportation Research Part B,2004(38):1-15.
[52]Hong,C.W.Yip, K.H.Wan. Modeling Transfer and non-linear fare structure in multi-modal network[J].Transportation Research PartB.2003,(37):149-170.
[53]J.Ane,T.Deal,Perez. Dual Graph Representation of Transport Networks [J].Transportation Research,1996,30(3):209-216.
[2]霍亮.铁路旅客乘车行为分析与客流分配研究[D].湖南：中南大学,2006.
[3]袁传宾.客运专线的修建对城际旅客出行的影响研究[D].成都：西南交通大学,2007.
[4]丁洁冰.基于SP调查的客运专线旅客乘车选择行为研究[D].北京：北京交通大学,2009.
[5]邹歆.基于铁路乘客出行特征的枢纽集散交通研究[D].北京：中国城市规划设计研究院,2010.
[6]于冉冉.基于铁路旅客需求异质性的换乘服务方案优化研究与系统[D].北京：北京交通大学,2011.
[7]周伟.旅客时间价值[J].交通运输工程学报,2003,3(3)：100-116.
[8]刘东坡.旅客旅行时间价值分析方法研究[J].华东经济管理,2003,17(4)：155-156.
[9]张冬青,宁宣熙.考虑收入因素的旅行时间价值模型研究[J].系统工程学报,2006,21(1)：1-4.
[10]布超,林晓言.旅客行为时间价值的Logit计算模型改进研究[J].技术经济,2009,28(3)：62-65.
[11]蒋寅,李彤.基于SP调查的天津市居民出行行为时间价值[J].城市交通,2009,7(2)：68-73.
[12]宗芳,隽志才,张慧永,贾洪飞.出行时间价值计算及应用研究[J].交通运输工程与信息,2009,9(3)：114-119.
[13]史峰,邓连波.旅客换乘网络优化设计[J].铁道科学与工程学报,2004,1(1)：78-82.
[14]聂磊,胡小风,佟璐,付慧玲.基于旅客列车开行方案的客流分配方法研究[J].交通运输工程与信息,2011,11(3)：87-92.
[15]傅冬绵.交通系统中最少换乘算法及其实现[J].华侨大学学报(自然科学版),2001,22(4)348350.
[16]赵巧霞,马志强,张发.以最小换乘次数和站数为目标的公交出行算法[J].计算机应用,2004,24(12)：136-138.
[17]苏爱华,施法中.公交网络换乘问题的一种实现[J].工程图学学报,2005(4)：55-59.
[18]刘雪岩.出行路线选择行为研究[D].北京：对外经济贸易大学,2006.
[19]史峰,邓连波,霍亮.铁路旅客乘车选择行为及其效用[J].中国铁道科学,2007,28(6)：117-121.
[20]E.Fernandez, J.De Cea, M.Florian, Cabrera E. Network equilibrium models with combined modes[J].Transportation Science,1994(28):182-192.
[21]J.Ane,T.Deal,Perez. Dual Graph Representation of Transport Networks [J.Transportation Research,1996,30(3):209-216.
[22]Lotan T. Effects of Familiarity on Route Choice Behavior in the Presence of Information[J].Transportation Research-Part C,1997,31(4):225-243.
[23]ChandraR.Bhat.A multi-level cross-classified model for discrete response variables[J]. Transportation Research B,2000(34):567-582.
[24]A.Lozano,G.Storchi. Shortest viable Path algorithm in multimodal network [J]. Transportation Research Part A,2001(35):225-241.
[25]Huang Haiiun, LI Zhichun. A Multiclass, Multi-criteria Logit-Based Traffic Equilibrium Assignment Model under ATIS[J]. European Journal of Operational Research, 2007,176(3):1464-1477.
[26]Thierry Blayac. Value of travel time:a theoretical legitimization of some nonlinear representative utility in discrete choice models [J]. Transportation Research Part B. 2001. 35. 391-400.
[27]Kaan Ozbay.Valuation of travel time and departure time choice in the presence of time-of-day pricing [J].Transportation Research Part A.2008.42.577-590.
[28]Kay W Axhausen. Income and distance stochastic of values of travel time savings New Swiss results [J].Transport Policy.2008.15.173-185.
[29]Fosgerau, M. Between-mode-differences in the value of travel time: Self-selection or strategic behaviour? [J]. TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT.2010.15.370-381.
[30]Mogens Fosgerau. The value of travel time variance. Transportation Research Part B 45 (2011):1-8.
[31]Maria Borjesson. On the income elasticity of the value of travel time. Transportation Research Part A 46 (2012): 368-377.
[32]南敬林.旅客旅行舒适度的需求分析[J].铁道运输与经济,2005,27(6)：79-80.
[33]史峰,邓连波,黎新华,等.客运专线相关旅客列车开行方案研究[J].铁道学报,2004,26(2)：16-20.
[34]陈建华,高自友.合理制定铁路旅客票价的优化方法[J].铁道学报,2005,27(4)：16-19.
[35]赵延风.基于消费者效用理论的图书馆服务模式分析[J].科技情报开发与经济,2008,18(22)：25-26.
[36]张嵩,王军,马金平.求解K最短路径的改进Dijkstra算法[J].中国经济与科学管理,2009,4：29-30.
[37]张彦.铁路客票中转换乘多径路选择问题的研究[J].铁道运输与经济.1997,8：11-13.
[38]邹明霞.基于Web的公交查询系统的设计与实现[D].武汉：华中科技大学,2008.
[39]张坤河.公交车查询系统的设计与实现[D].厦门：厦门大学,2009.
[40]汪江洪.公交换乘系统的研究与实现[D].成都：西南交通大学,2006.
[41]李永亮.基于蚁群算法的公交出行方案研究[D].北京：北京交通大学,2008.
[42]钱颂迪.管理运筹学[M].北京：清华大学出版社,2005.
[43]陆化普.交通规划理论与方法[M].北京：清华大学出版社,2006.
[44]谢金星,邢文训,王振波.网络优化[M].北京：清华大学出版社,2009.
[45]刘家壮,王建方.网络最优化[M].武汉：华中工学院出版社,1987.
[46]Sheffi Y. Urban transportation networks:equilibrium analysis with mathematical Programming methods. New Jersey:Prentice2Hall INC, Englewood Cliffe.1985.
[47]Nuzzolo, Agostino, Crisalli, Umberto and Gangemi, Francesca. A behavior choice model for the evaluation of railway supply and pricing policies [J].Transportation Research Part A:Policy and Practice,2000,34(5):395-404.
[48]Thomas H.Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein. Introduction to Algorithms[M].The MIT Press,2002.
[49]Matthew W, Carlyle R, Kevin W. Near Shortest and K-shortest Simple Paths [J], Networks, 2005,46(2):98-109.
[50]Macgegor M H, Grover WD. Optimized k-Shortest Path Algorithm for facility Restoration [J]. Software Practice and Experience,1994,24(9):823-828.
[51]Hai Yang, Hai-Jun Huang. The multi-class, multi-criteria traffic network equilibrium and system optimum Problem [J].Transportation Research Part B,2004(38):1-15.
[52]Hong,C.W.Yip, K.H.Wan. Modeling Transfer and non-linear fare structure in multi-modal network[J].Transportation Research PartB.2003,(37):149-170.
[53]J.Ane,T.Deal,Perez. Dual Graph Representation of Transport Networks [J].Transportation Research,1996,30(3):209-216.