CN103955807A - Method for nested management of all train seat OD zones and with social benefits considered - Google Patents

Method for nested management of all train seat OD zones and with social benefits considered Download PDF

Info

Publication number
CN103955807A
CN103955807A CN201410217517.6A CN201410217517A CN103955807A CN 103955807 A CN103955807 A CN 103955807A CN 201410217517 A CN201410217517 A CN 201410217517A CN 103955807 A CN103955807 A CN 103955807A
Authority
CN
China
Prior art keywords
train
value
ods
social benefits
seats
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201410217517.6A
Other languages
Chinese (zh)
Inventor
文耀锋
文曙东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN201410217517.6A priority Critical patent/CN103955807A/en
Publication of CN103955807A publication Critical patent/CN103955807A/en
Pending legal-status Critical Current

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The invention discloses a method for nested management of all train seat OD zones and with social benefits considered and relates to the field of railway passenger transport earning management, in particular to a method for controlling seats of domestic trains. The method for nested management of all the train seat OD zones and with the social benefits considered comprises the steps that (1) the network value of all ODs (F) of each target train are calculated; (2) the value of special ODs (F) are amended according to the social benefits of the train; (3) all the ODs (F) are ranked according to the amended values of all the ODs (F); (4) the permissible selling number of seats of each DO (F) is determined according to the ranked ODs (F), and thus nested management of seats is achieved; (5) during selling, the value, obtained in the step (1), of each OD (F) is updated repeatedly according to the remaining seats and forecasting of demands in the future, and then the step (2), the step (3) and the step (4) are executed sequentially. By the adoption of the method for nested management of all the train seat OD zones and with the social benefits considered, the problems that in the prior art, when railway passenger tickets are distributed in advance, forecasting and the actual demand are often inconsistent, and the utilization rate of train seats is low.

Description

Consider train seat whole OD section nested type management method of social benefit
Technical field
The present invention relates to railway transport of passengers yield management field, be specifically related to a kind of domestic train seat control method.
Background technology
At present domesticly carry out for railway transport of passengers product that pre-point, limit are sold far, the strategy such as shared, multiplexing, the problem of its existence is as follows: 1. divide in advance and actual demand often inconsistent, cause high value such as the Zhongdao demand that starts is often not being met; 2. limit is sold that relevant section far away is worth and is different large, and these section inside do not form high value and take the nest relation of low value at present; 3, share strategy and also do not consider that high value demand takies the nest relation at low value seat, cause income impaired; 4, network shipping products problem nested type management mode: Williamson suggestion, in the situation that other condition is constant, calculates the marginal cost on each OD.In the time that price is greater than marginal cost, this OD (F) is open.Here do not consider the nested order of each OD (F), do not consider that each coastiong is mainly for meeting which type of social passenger flow, and train is started rare section yet.
Summary of the invention
The invention provides train seat whole OD section nested type management method of considering social benefit, solved the pre-timesharing of the railway passenger tickets existing in prior art, prediction is not often inconsistent with actual demand, the relatively low problem of train seat utilization ratio.
For addressing the above problem, the present invention adopts following technical scheme:
1, method step
The whole OD of train (F) section nested type management method, comprises the following steps:
(1) network value of calculating target each OD of train number (F);
(2) social benefit of starting according to train number, revises the value of special OD (F);
(3) be worth according to revised each OD (F), each OD (F) is sorted;
(4) according to the 3rd article of quantity of determining that each OD (F) permission is sold in summary of the invention;
(5) sell in process, according to residue seat and demand forecast in the future, each OD (F) repeatedly calculating in step of updating (1) is worth, and then continues (2), (3), (4) step.
2, revise the value of special OD (F)
In whole transportation network, all OD (F) that train number is passed through carry out sorting according to network value size; For the fundamental purpose of starting of train number, determine that the starting station sells far station to limit, revise the value of relevant OD (F).Such as, the network value of the Zhongdao of starting is multiplied by an enhancement coefficient or adds a number; The OD (F) of current section rareness, the value of the relevant OD (F) of correction.Such as, the network value of the rare OD that is open to traffic is multiplied by an enhancement coefficient or adds a number.
Then all OD (F) in network are sorted.
3, calculate the permission sales volume method of OD (F)
For this class network transportation problem of railway, the permission of OD (F) is sold quantity and is determined as follows: first determine each included single section of OD (F), for certain single section i, all all OD (F) by i section are sorted, account for low principle and determine the permission sales volume of OD (F) according to height, the sold quantity of each OD (F) is all thought of as the more OD of high value (F) and stays enough seats, under extreme case, it is seat storage sum that Maximum Value person can sell quantity.Like this, this OD (F) all has one to allow sales volume on contained each single section, and getting its minimum value is the permission sales volume of this OD (F) on whole network.
4,, in the presell phase, the value of OD (F) and sequence are dynamically adjusted.
Within the presell phase, the value of each OD (F) and sequence are according to reservation status dynamic change.In the presell phase, some observation point are set, given viewpoint according to residue seat and in the future the predicted value of demand carry out new optimization and calculate, value, the correction of recalculating each OD (F) are worth and sort, and recalculate each OD (F) permission and sell quantity.
Advantage of the present invention has: the present invention proposes a kind of method that can adopt for existing railway seat reservation system application, in order to solve in the situation of considering train Income Maximum, consider the social benefit that train is started, pay the utmost attention to some section, allow the nested of each OD (F), solve and in existing train passenger ticket ticket sale system, have actual demand and the pre-unmatched difficult problem of dosis refracta.
Brief description of the drawings
Fig. 1 is step schematic diagram of the present invention;
Fig. 2 is that G565 train number in 2013 is crossed all 15 the OD schematic diagram of Xingtai to Anyang.
Embodiment
With best embodiment, the present invention is described in detail below.
As shown in Figure 1, consider train seat whole OD section nested type management method of social benefit, comprise the following steps:
(1) network value of calculating target each OD of train number (F);
(2) social benefit of starting according to train number, revises the value of special OD (F);
(3) be worth according to revised each OD (F), each OD (F) is sorted;
(4) according to the 3rd article of quantity of determining that each OD (F) permission is sold in summary of the invention;
(5) sell in process, according to residue seat and demand forecast in the future, each OD (F) repeatedly calculating in step of updating (1) is worth, and then continues (2), (3), (4) step.
In the present invention, for this class network transportation problem of railway transport of passengers, start in social benefit situation at consideration train, human intervention is adjusted the network value of respective section, then the value at the OD all to train number (F) seat sorts, high value demand can take the pre-point seat of low value, and all OD (F) are carried out to nested type management, solves existing passenger ticket for this reason and divides and the unmatched difficult problem of actual demand in advance.
The present invention sorts according to network value to all OD (F), make it to have with the control of single product storage in nested type location management feature, high value client can take the seat of giving in advance low value demand, for applying in Railway Passenger Ticket System.
1, each OD (F) sorting out value
According to linear programming principle of optimality, calculate the shadow price of each single section, then the price of OD (F) deducts corresponding shadow price, is the network value of each OD (F) under train number maximize revenue.
F oDFrepresent the admission fee of certain ODF, X oDFrepresent to distribute to the number of positions of certain ODF, S lrepresent all sections that comprise l section, C lrepresent the upper total number of positions of section l, ED oDFrepresent the demand expectation value to certain ODF.
Maximize∑ ODFf ODFX ODF
Subject to to any single section l;
0≤X oDF≤ ED oDF, to any ODF
The solution above dual problem of problem can obtain the shadow price of each single section, the opportunity cost using upper ODF each single interval shadow price sum as position, and the price of this ODF and the difference of opportunity cost are as the network profit contribution margin of this price level.Like this, nested order should be taking formula below as basis:
p lrepresent single shadow price of interval 1 in network
the network value of the ODF calculating according to Optimum Theory exactly, but train starts and have its social benefit, is mainly and meets the starting station and sell the passenger flow of far standing to limit, also needs emphasis to meet the section that some current frequency is very low.At this moment, need to increase adjustment to the network value of respective section, thus change according to the nested order that size sequence is carried out.
Such as: certain train number is by 1,2,3 ... n ... N website, n is limited and sells far station, and the object that this train number is started is exactly that emphasis meets from 1 to n station, the starting station and the passenger flow at later all stations.Calculating the network value of these sections so after, add a number or be multiplied by a coefficient as new network value in entirety make these section sequences forward.
In addition, if certain OD in this coastiong only has this coastiong to pass through for mono-day, the network of this OD so also should add a number or be multiplied by a coefficient as new network value its network value sequence of manual intervention.
Each OD network value (rank)
Upper table is each OD network value and sequence after G565 train number in 2013 correction, and this car is---Zhengzhou, Beijing---passenger flow in Xinxiang in order to meet Beijing first, and its network value is revised.
3,, for this class network transportation problem of railway, the permission sales volume of OD (F) is determined according to the method for following table and Fig. 2.
Such as totally 900 seats of G565 train number coach seat in following table, be followed successively by Beijing, Baoding, Shijiazhuang, Gaoyi, Xingtai, Anyang, Xinxiang, Zhengzhou by station, Xingtai to this OD of Xinxiang all by Xingtai to rank the 7th in 15 sections in Anyang, with removing 6 pre-dosis refractas of high value section above before the total quantity of seat, the permission sales volume obtaining is 900-629-165-9-19-1-3=74.Arrive totally 12 of the sections in Xinxiang by Anyang, Xingtai is to this OD of Zhengzhou rank the 8th in all these 12 sections, with removing the pre-dosis refracta of 7 high value sections above before the total quantity of seat, the permission sales volume obtaining is 900-629-165-9-19-1-3-9=65.Get the permission sales volume that smaller value 65 is this section.
3, in the presell phase, some observation point are set, given viewpoint according to residue seat and in the future the predicted value of demand carry out new optimization and calculate, recalculate the value of each OD (F), and consider to revise sequence to being worth.Recalculate each OD (F) and allow to sell quantity.
Finally it should be noted that: obviously, above-described embodiment is only for example of the present invention is clearly described, and the not restriction to embodiment.For those of ordinary skill in the field, can also make other changes in different forms on the basis of the above description.Here without also giving exhaustive to all embodiments.And the apparent variation of being amplified out thus or variation are still among protection scope of the present invention.

Claims (1)

1. train seat whole OD section nested type management method of considering social benefit, is characterized in that, comprises the following steps:
(1) network value of calculating target each OD of train number (F);
(2) social benefit of starting according to train number, revises the value of special OD (F);
(3) be worth according to revised each OD (F), each OD (F) is sorted;
(4) according to the 3rd article of quantity of determining that each OD (F) permission is sold in summary of the invention;
(5) sell in process, according to residue seat and demand forecast in the future, each OD (F) repeatedly calculating in step of updating (1) is worth, and then continues (2), (3), (4) step.
CN201410217517.6A 2014-05-22 2014-05-22 Method for nested management of all train seat OD zones and with social benefits considered Pending CN103955807A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410217517.6A CN103955807A (en) 2014-05-22 2014-05-22 Method for nested management of all train seat OD zones and with social benefits considered

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410217517.6A CN103955807A (en) 2014-05-22 2014-05-22 Method for nested management of all train seat OD zones and with social benefits considered

Publications (1)

Publication Number Publication Date
CN103955807A true CN103955807A (en) 2014-07-30

Family

ID=51333080

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410217517.6A Pending CN103955807A (en) 2014-05-22 2014-05-22 Method for nested management of all train seat OD zones and with social benefits considered

Country Status (1)

Country Link
CN (1) CN103955807A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108564219A (en) * 2018-04-17 2018-09-21 四川眷诚天佑科技有限公司 train operation section seat price optimization control method
CN110570128A (en) * 2019-09-09 2019-12-13 西南交通大学 Nesting control method for multi-level ticket price seat storage of high-speed railway train
CN110942240A (en) * 2019-11-21 2020-03-31 中国民航信息网络股份有限公司 Information processing method, system, terminal and storage medium
CN113627971A (en) * 2021-06-30 2021-11-09 中国铁道科学研究院集团有限公司电子计算技术研究所 Ticket amount distribution method and device
CN114282740A (en) * 2021-09-07 2022-04-05 内蒙古大学 High-speed rail ticket amount distribution optimization method considering flexible tickets

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102169524A (en) * 2010-02-26 2011-08-31 同济大学 Staged multi-path model algorithm of urban rail transit network passenger flow distribution
CN103208033A (en) * 2013-03-22 2013-07-17 北京交通大学 Access passenger flow forecasting method for urban rail transit new line under network condition
CN103745277A (en) * 2014-01-22 2014-04-23 宁波大学 Rail transit connection public transit network optimizing system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102169524A (en) * 2010-02-26 2011-08-31 同济大学 Staged multi-path model algorithm of urban rail transit network passenger flow distribution
CN103208033A (en) * 2013-03-22 2013-07-17 北京交通大学 Access passenger flow forecasting method for urban rail transit new line under network condition
CN103745277A (en) * 2014-01-22 2014-04-23 宁波大学 Rail transit connection public transit network optimizing system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
BAO YUN: "Seat inventory control methods for Chinese passenger railways", 《JOURNAL OF CENTRAL SOUTH UNIVERSITY》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108564219A (en) * 2018-04-17 2018-09-21 四川眷诚天佑科技有限公司 train operation section seat price optimization control method
CN110570128A (en) * 2019-09-09 2019-12-13 西南交通大学 Nesting control method for multi-level ticket price seat storage of high-speed railway train
CN110942240A (en) * 2019-11-21 2020-03-31 中国民航信息网络股份有限公司 Information processing method, system, terminal and storage medium
CN110942240B (en) * 2019-11-21 2023-08-04 中国民航信息网络股份有限公司 Information processing method, system, terminal and storage medium
CN113627971A (en) * 2021-06-30 2021-11-09 中国铁道科学研究院集团有限公司电子计算技术研究所 Ticket amount distribution method and device
CN113627971B (en) * 2021-06-30 2024-04-02 中国铁道科学研究院集团有限公司电子计算技术研究所 Ticket allocation method and device
CN114282740A (en) * 2021-09-07 2022-04-05 内蒙古大学 High-speed rail ticket amount distribution optimization method considering flexible tickets

Similar Documents

Publication Publication Date Title
CN103955807A (en) Method for nested management of all train seat OD zones and with social benefits considered
CN110110871B (en) Order allocation method and system
Dobruszkes An analysis of European low-cost airlines and their networks
Muñoz et al. Comparison of dynamic control strategies for transit operations
Amaruchkul et al. Air-cargo capacity allocation for multiple freight forwarders
Herbon et al. Determining optimal frequency and vehicle capacity for public transit routes: A generalized newsvendor model
Caros et al. Day-to-day market evaluation of modular autonomous vehicle fleet operations with en-route transfers
CN109034575A (en) A kind of jockey's intelligent dispatching method
MXPA04005776A (en) Method and system for origin-destination passenger demand forecast inference.
CN106652530B (en) A kind of scheduling instance table generating method and device
Savage et al. A comment on'subsidisation of urban public transport and the mohring effect'
CN107909383A (en) A kind of Dynamic Pricing method of combination passenger information
Song et al. A practical approach to solving a newspaper logistics problem using a digital map
Tang et al. Vehicle scheduling of single-line bus service using operational strategies
Li et al. Metro timetabling for time-varying passenger demand and congestion at stations
Dandapat et al. An approach for identifying optimal service for rural bus routes
Kiarashrad et al. A mixed-integer nonlinear optimization model for integrated flight scheduling, fleet assignment, and ticket pricing in competitive market
Zak et al. Multiple criteria optimization method for the vehicle assignment problem in a bus transportation company
CN109242154A (en) Cargo transport route planning method
Obeng et al. Airline fare and seat management strategies with demand dependency
Urban et al. Modelling the European air transport system: A System Dynamics approach
Han et al. Two-stage optimization of airport ferry service delay considering flight uncertainty
Saffarian et al. A robust programming approach to bi-objective optimization model in the disaster relief logistics response phase
Button et al. Economic stability in network industries
Martín et al. A new era for airport regulators through capacity investments

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20140730