CN106779190A - A kind of urban track traffic passenger trip route suggesting method and system - Google Patents

A kind of urban track traffic passenger trip route suggesting method and system Download PDF

Info

Publication number
CN106779190A
CN106779190A CN201611096579.1A CN201611096579A CN106779190A CN 106779190 A CN106779190 A CN 106779190A CN 201611096579 A CN201611096579 A CN 201611096579A CN 106779190 A CN106779190 A CN 106779190A
Authority
CN
China
Prior art keywords
station
passenger
time
shortest path
selection
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.)
Granted
Application number
CN201611096579.1A
Other languages
Chinese (zh)
Other versions
CN106779190B (en
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.)
Southeast University
Original Assignee
Southeast University
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 Southeast University filed Critical Southeast University
Priority to CN201611096579.1A priority Critical patent/CN106779190B/en
Publication of CN106779190A publication Critical patent/CN106779190A/en
Application granted granted Critical
Publication of CN106779190B publication Critical patent/CN106779190B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Tourism & Hospitality (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The invention discloses a kind of urban track traffic passenger trip route suggesting method and system.Wherein, suggestion effect is played in trip of the methods described for passenger in urban track traffic, and passenger can be helped to select optimal path or sub-optimal path to go on a journey in track traffic.The method selects shortest path according to the generalized cost of interval and website, and using Anylogic softwares set up Trip Assignment Model reach to City Rail Transit System passenger flow entirety control, circuit and website crowding according to where shortest path whether reach threshold value judge passenger trip use shortest path or second shortest path.Implement the present invention, passenger going out line efficiency and judge crowded section of highway and node in rail transit network and then measurement Rail traffic network performance in urban track traffic can be improved.

Description

A kind of urban track traffic passenger trip route suggesting method and system
Technical field
The invention belongs to intelligent transportation field, especially a kind of urban track traffic passenger trip route suggesting method and it is System.
Background technology
With urban track traffic infrastructure constantly improve, urban track traffic networking increasingly, urban track traffic Have become the important component of large size city public transport.Because track traffic forms networking scale, when passenger goes on a journey Have that mulitpath is available, urban track traffic passenger's travel route choice pattern in the case of research multipath and its Bus traveler assignment on the basis of this, with important theory value and realistic meaning.
The transfer station of passenger's selection should be included when Rail Transit System Trip distribution is analyzed and specifically goes out walking along the street Footpath information, and current orbit traffic system in order to facilitate passenger trip transfer station it is usually used be seamless exchange shape Formula, makes passenger not need outbound can directly transfer to be gone on one's journey to All other routes.Due to being caused using this operation way Transfer passenger flow can not be effectively counted, the whole story website of transfer passenger flow is can only obtain, makes Rail Transit System Trip distribution and circuit The volume of the flow of passengers there is a problem of being difficult to count.Such issues that can be efficiently solved using the invention model.
The content of the invention
Goal of the invention：A kind of urban track traffic passenger trip route suggesting method is provided, to solve under prior art Passenger's travel route choice problem, improves passenger and goes out line efficiency and reasonable distribution City Rail Transit System passenger flow.Further A kind of purpose, there is provided urban track traffic passenger trip route suggesting system for wearing.
Technical scheme：A kind of urban track traffic passenger trip route suggesting method, comprises the following steps：
Step 1：Passenger is entered the station and selects outbound information, and passenger's Information Statistics out of the station are entered into system；
Step 2：Interval and website the generalized cost of urban mass transit network is calculated, and according to the generalized cost as road Duan Quanchong, solve it is out of the station between shortest path, as one of the selection of passenger's trip route；
Step 3：Urban track traffic for passenger flow distribution model, institute in reflection rail system are set up using Anylogic softwares There is a trip information of passenger, and it is crowded to judge in the shortest path searched in step 2 whether station crowding reaches with this model The threshold value of degree, if not up to threshold value, the shortest path trip receipt searched in system print step 2, the path allocation of the passenger Terminate；Otherwise, 4 are gone to step；
Step 4：The generalized cost of interval and website according to urban mass transit network, time short circuit between search is out of the station Footpath, as the selection of passenger's trip route；
Step 5：System print comprising it is described it is out of the station between second shortest path information trip receipt, the path of the passenger Distribution terminates；
Step 6：Passenger goes on a journey according to the trip route suggestion receipt of system print, terminates.
The step 2 further includes following steps：
Step 21：When the factor that urban mass transit network influence passenger carries out Path selection includes the vehicle-mounted time, waits Between and the walking time, by analyze three generalized cost influence factors set up generalized cost letter for the influence of passenger's Path selection Number；
Step 22：Generalized cost influence factor according to step 21 calculates the travel time, and the travel time is a pass In the vehicle-mounted time, weighting function f (t) of stand-by period and walking time：
F (t)=(t1,t2,t3),
Wherein, t1It is vehicle-mounted time, t2It is stand-by period, t3It it is the walking time, t is travel time summation；
Step 23：Generalized cost influence factor according to step 21 and step 22 calculates vehicle-mounted time, vehicle-mounted time t1It is made up of vehicle hour and vehicle dwell time：
Wherein, taIt is vehicle hour, paIt is vehicle dwell time, vehicle hour taIn urban track traffic fortune Refer to run time of the vehicle between station in capable process, vehicle hour is equal to the length l between operation stationaRun with vehicle Speed vaThe ratio between；The dwell time that vehicle runs in systems is constant c, i.e. vehicle dwell time pa=c；
Step 24：Generalized cost influence factor according to step 21 and step 22 calculates stand-by period t2, during wait Between t2It is made up of booking stand-by period and queue waiting time, queue waiting time can be divided into the consumption entered the station when queuing up again when Between, and waiting time of queuing up before getting on the bus after entering the station；
Booking stand-by period and setting and booking of the waiting time mainly due to the gate mouthful that enters the station when queuing up of entering the station Passenger during ticket checking is detained the produced time：
Wherein, w1It is booking stand-by period and the queuing time that enters the station, its value is constant m, w2Train is waited after being entered the station for passenger Time, the time depends on the departing time interval of circuit, and passenger is taken as the time of departure at average latency waited of entering the station It is spaced the half of h；
Step 25：Generalized cost influence factor according to step 21 and step 22 calculates walking time, walking time t3By the walking time out of the station and transfer the walking time constitute, the walking time out of the station for when passenger is entered the station by station entrance By a series of walkings run to the time that platform consumed and passenger reach home station get off after it is straight by a series of walkings To the consumed time sum of a certain outlet in station, the time out of the station is relevant with the layout designs at station, and the time out of the station is wt1, the time out of the station is designated as constant n；The transfer walking time is the time spent on transferring passage when passenger changes to, transfer Walking time is main related to the distance of transferring passage, and the transfer walking time can be by the walking average than passenger of transferring passage distance Speed is obtained, and the definition transfer walking time is wt2, transferring passage length is s, vPeopleIt is 1m/s, obtains：
Thus walking time t is obtained3：
t3=wt1+wt2=n+s；
Step 26：Generalized cost influence factor sets up broad sense expense according to step 22, step 23, step 24 and step 25 It is further as follows with function：
Define β1、β2And β3It is the weighted factor of vehicle-mounted time, stand-by period and walking time, and β1, β2, β3≥1, thus Obtain considering that the path generalized cost function F of weighted factor is：
F=β1t1+β2t2+β3t3,
Expansion obtains path generalized cost function F and is：
In formula：β1, β2, β3The weighted factor of respectively vehicle-mounted time, stand-by period and walking time, laFor terminal is transported Row siding-to-siding block length, vaIt is train average running speed, h is train departure time interval, and c is dwell time summation, and m is arranged for booking Team enters the station the time, and n is total time out of the station, and s is transferring passage length；
Step 27：Selection generalized cost is the shortest path of weight, is searched for wide using Dijkstra shortest path firsts , used as section and the shortest path of node weights, the shortest path for searching out is i.e. as one of the path of Systematic selection for adopted expense.
The step 27 is further included：
Step 271：The all of station of Rail traffic network is divided into two parts：The station set P of known shortest path；Not Know the station set Q of shortest path, in an initial condition, it is known that only exist initial station in the station set P of shortest path；It is fixed Adopted book [i] array is used to record which station in set P, and for station i, book [i] is 1 expression station i in set P In, book [i] is 0 and represents station i in set Q；One-dimension array dis is used to store initial station to remaining each station Distance；
Step 272：Order starting station a to the shortest path of itself be 0, i.e. dis=0, if starting station presence can be direct Dis [i], then be set to e [a] [i] by the station i of arrival, while setting other stations that all initial stations not directly reach Shortest path be ∞；
Step 273：A station u nearest from initial station a is selected to be added to set P in all stations of set Q In, station u that will be dis [u] minimum is added in set P；And all sections with station u as starting point are checked, to each Section all carries out loose operations, if can then be added to by by section uv from u to the section of any station v in the presence of one Afterbody expands a path from a to v, and the length of this paths is dis [u]+e [u] [v], if the value obtained is than current The value of known dis [v] is small, then the value in current dis [v] can be substituted with solution value；
Step 274：Step 273 is repeated, until, without station element, algorithm terminates in set Q, final dis [] array In value be exactly shortest path of the initial station to other all stations.
The step 3 is further：
There is the main functional module for using in this model：
Source modules：Source module, using source modules, can generate the entities such as such as train and passenger, and this is Start node based on discrete event modeling, is also the source point of track traffic road network.Producing train and the mode of passenger can lead to Cross and be defined into up to probability function and generated according to timetable, or generated according to certain uniform arrival rate.
Delay modules：Postponement module, in this model, passenger's traveling is mainly assumed that using the purposes of this module Or the process simulation of train operation, the time that passenger's freight train postpones in Postponement module, it is exactly passenger in traveling section, train In the time of the intensive traffic section operation.Produced compulsory delay behavior is expressed in the interval time run and stopped AT STATION Time.The time of delay can be defined as constant constant, also can generate random number by system to define, also can be by definition The length and the ratio between traveling speed or train running speed in section are obtained.
Hold modules：Control module, using control module passing through in specified position control passenger or train, at this Be mainly used in model control ticketing link and queuing enter the station link flow control.Substantially it is considered as using control module The artificial model blocking for being formed in a network, causes the open circuit of passenger flows, and analogue flow rate control is can be used in actual applications The situation of system.
SelectOutput modules：Selection formwork, can be used for simulating those in situation about dividing using selection formwork It is lower to need situation about making a choice, such as reach selection behind a certain station go on one's journey it is also or outbound；Selected after reaching transfer station Select outbound along the travelling of this line or select to turn line travelling.The above selection can be big by defining the probability of selection branch It is small for simulating reality situation, guiding passenger enters different flows.Selectoutput controls have two ports, false ends It is unassignable one end in selectoutput controls；True ends are one end of assignment in selectoutput controls.
Sink modules：Remittance module, generally with the terminal node of the module simulation network.The module can represent passenger from Drive station end travel, it can also be used to represent that train station of reaching home is out of service.
Connector connectors：Connector is used to represent two relations of correlation module that connector to have dividing for whole story end, The path of passenger and train operation is can be used to indicate that in a model.
Statechart state diagram inlet points：State diagram inlet point is similar to the source modules in java standard library, for fixed Adopted flow source of graph, the step of seat flow chart is initialized.
State states：State is the description of a certain degree that flow chart reaches, and this model use state builds the time of departure Interval and the state of train dwelling time.
Transition is changed：Transition are mainly used in describing the situation change between two states, and this model sets up three Transition define three times.
Step 31：Urban track traffic for passenger flow distribution model is set up using Anylogic softwares, to reflect rail system In all passengers trip information, the Trip Assignment Model is divided into two portions of rail system circuit model and Car's door controlling model Point；
Step 32：Rail system circuit model department pattern simulate static track transportation network, it include station, train and Working line, four parts of circuit transfer and selection branch model；
Station：Ticketing is experienced when passenger is entered the station and is queued up and platform two is walked to by ticket office and be delayed, model uses delay The delay of module simulation two, source controls EnterL1_1, EnterL1_2, EnterL1_3, EnterL1_4, EnterL2_1, EnterL2_2 generate passenger, passenger get to the station after pass through by delay controls StninL1_1, StninL1_2, StninL1_3, StninL1_4, StninL2_1, StninL2_2 produce booking time delays, then pass through ticket office and walk to the platform time and prolong Miss, PfL1_1, PfL1_2, PfL1_3, PfL1_4, PfL2_1, PfL2_2 are represented, hold controls cStninL1_1, cStninL1_ 2nd, cStninL1_3, cStninL1_4, cStninL2_1, cStninL2_2 represent that the gate that enters the station forms passenger flow control at first, Another place hold controls TctrlL1_1, TctrlL1_2, TctrlL1_3, TctrlL1_4, TctrlL2_1, TctrlL2_2 are represented The passenger flow blocking that train is reached is waited after passenger's in-track platform；Experience is walked to station outlet and is left from platform when passenger is outbound Two events of system, using delay controls StnExitL1_1, StnExitL1_2, StnExitL1_3, StnExitL1_4, StnExitL2_1, StnExitL2_2 represent the outbound delay that exit is walked to by platform of passenger, finally by sink modules ExitL1_2, ExitL1_3, ExitL1_4, ExitL1_5, ExitL2_2, ExitL2_3 represent that passenger leaves system；
With reference to passenger's trip requirements, represent that passenger reaches car by selectoutput modules L1_2, L1_3, L1_4, L2_2 Selection goes on one's journey or outbound after standing；
Train and working line：Train time delays on the line is represented using delay modules, model example sets up two Bar circuit, circuit 1 has 5 websites, 4 block section between stations, and circuit 2 has 3 websites, 2 block section between stations, and two lines road is by a friendship The station transfer of remittance；
Between circuit 1 represents four stations using 4 delay modules TripL1_1, TripL1_2, TripL1_3, TripL1_4 Interval, selects formwork L1_2, L1_3, L1_4 to connect between each two delay modules by selectoutput；Circuit 2 makes Two block section between stations are represented with 2 delay modules TripL2_1, TripL2_2, is passed through between two delay modules Selectoutput selection formwork L2_2 connections；Selectoutput selection branch act as passenger and be may be selected after getting to the station Go on one's journey, outbound or transfer；
Circuit is changed to：The station 3 of circuit 1 is actually same station with the station 2 of circuit 2 in model, and description for convenience is changed Travel is that transfer stop is divided into two parts is analyzed；Two stations are initially set up, transfer is collectively constituted by the two stations Stand；Formwork InterCFromL1_L2, InterCFromL2_L1 is selected to describe two lines by selectoutput in model Transfer behavior between road, is set up after completing transfer station, and two stations have been contacted into transfer erect-position by connector connectors Part on two lines road, will the transfer outlet at a station be connected to and turn the entering the station on walking channel of line station, by even The false ends of selectoutput selections formwork InterCFromL1_L2 are connect to the Pedestrian Only delay PfL2_2 of circuit 2 and False ends to the Pedestrian Only of circuit 1 of connection selectoutput selection formworks InterCFromL2_L1 is delayed PfL1_3 Realize；False ends are unassignable one end in selectoutput controls；
Selection branch：Selectoutput modules represent the behavior that passenger makes a choice in the case where there is selection, selection The select probability of branch is defined by selection branch assignment, and such as definition selection branch probability is 0.9, then it represents that selectoutput controls True ends select probability is that 0.9, false ends select probability is 0.1；True ends are of assignment in selectoutput controls End；
In model selection send away at two, one be by the selection branch model at station, one be transfer station selection Branch model, gone on one's journey in the selection up to after getting to the station for passenger by selection branch model L1_2, L1_3, the L1_4 at station or Outbound, the selection branch control of transfer station sets two, and one is to choose whether to continue along this line by selecting branch L1_3, L2_2 Travelling, the probability that passenger continues to be travelled along this line is to selection branch control assignment；One is by selecting branch InterCFromL1_L2, InterCFromL2_L1 selection transfer or outbound, are outbound passenger's to selection branch control assignment Probability；
Step 33：According to step 31, urban track traffic for passenger flow distribution model, rail system circuit are set up described in step 32 Model part simulates static track transportation network, and four parts described in combining step 32 build complete rail system circuit mould Type；
Step 34：Urban track traffic for passenger flow distribution model, door control system mold portion are set up according to step 31 Divide the Train Control model for setting up station, the operation of the switch simulation train by controlling car door, by the switch for controlling car door The operation for simulating train needs to use the mode of flow chart to set up a flow chart on the time, at the beginning of flow includes state Beginningization cPfL1_1, cPfL1_2, cPfL1_3, cPfL1_4, cPfL2_1, cPfL2_2, the time of departure of train, during train departure Between interval and car door opening time；
Interval is divided into two types, one kind is that to originate Zhongdao interval, one kind is, by interval, to be stood firm justice hair in first bus The car time is the moment 0, without the time of departure after the arrival of terminal station train, therefore originates terminal station interval Car's door controlling model and does not need The time of departure of vehicle is set, is originated Zhongdao interval and is considered as train departure time interval and car door opening time to simulate train Operation, in model using transition definition status change, set two transition, one transition cWaitTrainL1_1, Between cWaitTrainL2_1, cWaitTrainL2_2 are used to set the time interval i.e. time of departure of train that car door is opened twice Every；The opening time that another transition cReleaseL1_1, cReleaseL2_1, cReleaseL2_2 are used to set car door arranges The dwell time of car；For by interval, should first define the time of departure of train, by change InitL1_2, InitL1_3, InitL1_4 are realized；The same Zhongdao interval that originates is set below and is similar to two transition of setting, one changes CWaitTrainL1_2, cWaitTrainL1_3, cWaitTrainL1_4 are used to setting time interval that car door opens twice i.e. The departing time interval of train；Another transition cReleaseL1_2, cReleaseL1_3, cReleaseL1_4 are used to set car The opening time of door is the dwell time of train, the Car's door controlling model composition system Car's door controlling model of both the above type；
Step 35：Urban track traffic for passenger flow distribution model is set up, with the shortest path that this model judges to be searched in step 2 Whether middle station crowding reaches the threshold value of crowding, and the step is specific as follows：
Crowding threshold value is set as the 80% of station Maximum Assembling, when the number for getting to the station not up to station highest Aggregation number 80% when, in Systematic selection step 2 search for shortest path as passenger trip route and print, work as arrival When the number at station reaches 80%, the line efficiency that of passenger is influenceed to prevent station number from further assembling, now system will The new path of selection is used with being supplied to passenger to go on a journey, and turns to next step.
The step 4 is further included：
Step 41：The track built according to step 21, step 22, step 23, step 24, step 25 and step 26 Traffic generalized cost is used as the interval weight search track transportation network with station；
Step 42：Selection generalized cost as the weight at interval and station second shortest path, using based on Dijkstra most Gradually short-circuit searching algorithm searches for second shortest path to the k bars of short path algorithm, and the second shortest path for searching out is i.e. as the road of Systematic selection One of footpath.
The step 42 is further included：
Step 421：From network shortest path it is any select an edge contract it, then will be vacant using shortest path first Partial section others section is filled, and finds out interim shortest path；
Step 422：The operation of step 421 is repeated, until all sections in shortest path are all deleted and find Substitute section, now more all interim shortest paths found out, its Road most short as time shortest path long.
The step 5 is further：
In Systematic selection step 4 search for second shortest path as passenger trip route and print.
A kind of urban track traffic passenger trip route suggesting system for wearing, it is characterised in that including：Passenger's trip route is advised Device, is arranged on the place of entering the station of rail traffic station, the information out of the station for gathering injection traffic system passenger；And according to Shortest path on generalized cost between generalized cost function search is out of the station；By using the city rail that Anylogic sets up People from station that the shortest path that the real-time number comparing in station in road traffic Trip Assignment Model is searched out is passed through a station If number not up to station Maximum Assembling threshold value, proposer printing shortest path trip receipt, passenger advises according to receipt Trip；Otherwise the proposer again according to generalized cost function search it is out of the station between the second shortest path on generalized cost, it is complete Into after search, it is proposed that device printing second shortest path trip receipt, passenger advises going on a journey according to receipt, the path allocation knot of the passenger Beam.
Beneficial effect：The present invention research multipath in the case of urban track traffic passenger's travel route choice pattern and its Bus traveler assignment on this basis.For urban track traffic passenger trip route provide suggestion, make passenger go out it is existing more just Victory, improves passenger and goes out line efficiency and reasonable distribution urban track traffic for passenger flow.Of the invention optimization from reduction passenger's travel time multiplies Objective trip route angle consideration, the simulation model of rail system is set up come aid decision using Anylogic softwares, improves city The competitiveness of city's track traffic.
Brief description of the drawings
Fig. 1 is flow chart of the invention.
Fig. 2 is rail system circuit model.
Fig. 3 is exemplary layout.
Fig. 4 is Car's door controlling model.
Specific embodiment
Urban track traffic passenger trip route suggesting method of the invention is described with reference to Fig. 1, is comprised the following steps：
Step 1：Passenger is entered the station and selects outbound information, and passenger's Information Statistics out of the station are entered into system；
Step 2：Interval and website the generalized cost of urban mass transit network is calculated, and according to the generalized cost as road Duan Quanchong, solve it is out of the station between shortest path, as one of the selection of passenger's trip route；
Step 3：Urban track traffic for passenger flow distribution model, institute in reflection rail system are set up using Anylogic softwares There is a trip information of passenger, and it is crowded to judge in the shortest path searched in step 2 whether station crowding reaches with this model The threshold value of degree, if not up to threshold value, the shortest path trip receipt searched in system print step 2, the path allocation of the passenger Terminate；Otherwise, 4 are gone to step；
Step 4：The generalized cost of interval and website according to urban mass transit network, time short circuit between search is out of the station Footpath, as the selection of passenger's trip route；
Step 5：The second shortest path trip receipt searched in system print step 4, the path allocation of the passenger terminates；
Step 6：Passenger goes on a journey according to the trip route suggestion receipt of system print, terminates.
In a further embodiment, passenger is entered the station and selects outbound information to be advised using passenger's trip route in step 1 Device, passenger's trip route proposer function is as follows：
When passenger is entered the station, the website got off is wished in selection, and passenger's trip route proposer is wide according to step 2,3,4 Adopted cost function searches for shortest path and second shortest path；The proposer record each station enter the station number and in travelling way in Number, and whether station number in rail system reaches threshold value selection shortest path or second shortest path as passenger The suggestion path of trip, and the suggestion path receipt that passenger goes on a journey is printed by passenger's trip route proposer, so that passenger goes out Exercise and use.
In a further embodiment, interval and website the generalized cost of the Rail traffic network for being referred in step 2 is calculated And shortest path of the search on generalized cost comprises the following steps：
Step 21：The factor that urban mass transit network influence passenger carries out Path selection mainly has 1, vehicle-mounted time；2、 Stand-by period；3rd, the walking time.By analyzing three factors generalized cost function is set up for the influence of passenger's Path selection.
Step 22：Definition trip temporal summation is t, and the vehicle-mounted time is t1, the stand-by period is t2, the walking time is t3；Trip Time be one on the vehicle-mounted time, weighting function f (t) of stand-by period and walking time：
F (t)=(t1,t2,t3)
Step 23：The vehicle-mounted time t of generalized cost1It is made up of vehicle hour and vehicle dwell time, defines vehicle Run time is ta, the vehicle dwell time is pa.Vehicle hour, refers to vehicle during urban track traffic runs Run time between station, i.e. vehicle hour taEqual to the length l between operation stationaWith running velocity vaThe ratio between；Vehicle The dwell time run in systems is constant c, i.e. vehicle dwell time pa=c.The vehicle-mounted time can be obtained for two and, I.e.：
Step 24：The stand-by period t of generalized cost2It is made up of booking stand-by period and queue waiting time.Queue up etc. Can be divided into the elapsed time that enters the station when queuing up again whne the time, and waiting time of queuing up before getting on the bus after entering the station.
Booking stand-by period and setting and booking of the waiting time mainly due to the gate mouthful that enters the station when queuing up of entering the station Passenger during ticket checking is detained the produced time, defines booking stand-by period and the queuing time that enters the station for w1, and the time is normal Number m；Passenger waits the time w of train after entering the station2Depend primarily on the departing time interval of circuit, passenger enter the station wait it is average Waiting time is taken as the half of departing time interval, and definition departing time interval is h.The stand-by period can be obtained for two and, I.e.：
Step 25：The walking time t of generalized cost3It is made up of walking time out of the station and transfer walking time.Turnover The walking time stand by running to time and the passenger that platform is consumed by a series of walkings by station entrance when passenger is entered the station Reach home after station is got off and export consumed time sum up to station is a certain by a series of walkings.Time master out of the station It is relevant with the layout designs at station, the time out of the station is defined for wt1, set of time out of the station is a specified constant n；Transfer step The row time is the time spent on transferring passage when passenger changes to, transfer walking time main and transferring passage distance phase Close.Transfer the walking time can be obtained by transferring passage distance walking speed average than passenger, definition transfer the walking time be wt2, transferring passage length is s, and transferring passage length is vouched by station technology handbook.People's normal condition walking speed is about 1.3-1.5m/s, it is contemplated that influence of the crowded crowd for walking speed in transfer, it is assumed that the average walking of passenger during transfer Speed vPeopleIt is 1m/s, then can obtains：
Obtain walking time t3For two and, i.e.,：
t3=wt1+wt2=n+s
Step 26：Generalized cost function is set up, β is defined1、β2、、β3For the vehicle-mounted time, the stand-by period, the walking time plus Power factor.And assume β1, β2, β3≥1.Thus obtain considering that the path generalized cost function F of weighted factor is：
F=β1t1+β2t2+β3t3
Expansion obtains path generalized cost function F and is：
In formula：β1, β2, β3Respectively vehicle-mounted time, stand-by period, the weighted factor of walking time；
laTerminal traffic coverage length；
vaTrain average running speed；
H train departure time intervals；
C dwell time summations；
M bookings are queued up and are entered the station the time；
N total times out of the station；
S transferring passage length.
Step 27：Selection generalized cost is the shortest path of weight, is searched for wide using Dijkstra shortest path firsts , used as section and the shortest path of node weights, the shortest path for searching out is i.e. as one of the path of Systematic selection for adopted expense.
In a still further embodiment, step 27 is further：
Step 271：The all of station of Rail traffic network is divided into two parts：1st, the station set P of known shortest path； 2nd, the station set Q of unknown shortest path.In an initial condition, it is known that only exist initial car in the station set P of shortest path Stand.Defining book [i] array is used to record which station in set P.Particularly, for certain station i, book [i] For 1 represents station i in set P, book [i] is 0 and represents station i in set Q.One-dimension array dis is used to store starting Distance of the station to remaining each station.
Step 272：Order starting station a to the shortest path of itself be 0, i.e. dis=0.Can be direct if initial station is present Dis [i], then be set to e [a] [i] by the station i of arrival.Other stations that all initial stations not directly reach are set simultaneously Shortest path be ∞.
Step 273：A station u nearest from initial station s is selected in all stations of set Q, and (i.e. dis [u] is most Small station u) is added in set P.And all sections with station u as starting point are checked, each section is all relaxed Operation.If in the presence of one then one can be expanded by the way that section uv is added into afterbody from u to the section of any station v Path from a to v, and the length of this paths is dis [u]+e [u] [v].If the value obtained is than the dis [v] that is currently known Value is small, then the value in current dis [v] can be substituted with solution value.
Step 274：Step 273 is repeated, until, without station element, algorithm terminates in set Q.Final dis [] array In value be exactly shortest path of the initial station to other all stations.
In a further embodiment, the utilization Anylogic softwares for being referred in step 3 set up urban track traffic visitor Stream distribution model, and judge whether station crowding reaches the threshold of crowding in the shortest path of search in step 2 with this model Value comprises the following steps：
There is the main functional module for using in this model：
Source modules：Source module, using source modules, can generate the entities such as such as train and passenger, and this is Start node based on discrete event modeling, is also the source point of track traffic road network.Producing train and the mode of passenger can lead to Cross and be defined into up to probability function and generated according to timetable, or generated according to certain uniform arrival rate.
Delay modules：Postponement module, in this model, passenger's traveling is mainly assumed that using the purposes of this module Or the process simulation of train operation, the time that passenger's freight train postpones in Postponement module, it is exactly passenger in traveling section, train In the time of the intensive traffic section operation.Produced compulsory delay behavior is expressed in the interval time run and stopped AT STATION Time.The time of delay can be defined as constant constant, also can generate random number by system to define, also can be by definition The length and the ratio between traveling speed or train running speed in section are obtained.
Hold modules：Control module, using control module passing through in specified position control passenger or train, at this Be mainly used in model control ticketing link and queuing enter the station link flow control.Substantially it is considered as using control module The artificial model blocking for being formed in a network, causes the open circuit of passenger flows, and analogue flow rate control is can be used in actual applications The situation of system.
SelectOutput modules：Selection formwork, can be used for simulating those in situation about dividing using selection formwork It is lower to need situation about making a choice, such as reach selection behind a certain station go on one's journey it is also or outbound；Selected after reaching transfer station Select outbound along the travelling of this line or select to turn line travelling.The above selection can be big by defining the probability of selection branch It is small for simulating reality situation, guiding passenger enters different flows.Selectoutput controls have two ports, false ends It is unassignable one end in selectoutput controls；True ends are one end of assignment in selectoutput controls.
Sink modules：Remittance module, generally with the terminal node of the module simulation network.The module can represent passenger from Drive station end travel, it can also be used to represent that train station of reaching home is out of service.
Connector connectors：Connector is used to represent two relations of correlation module that connector to have dividing for whole story end, The path of passenger and train operation is can be used to indicate that in a model.
Statechart state diagram inlet points：State diagram inlet point is similar to the source modules in java standard library, for fixed Adopted flow source of graph, the step of seat flow chart is initialized.
State states：State is the description of a certain degree that flow chart reaches, and this model use state builds the time of departure Interval and the state of train dwelling time.
Transition is changed：Transition are mainly used in describing the situation change between two states, and this model sets up three Transition define three times.
Step 31：Urban track traffic for passenger flow distribution model is set up using Anylogic softwares, in reflection rail system The trip information of all passengers.The Trip Assignment Model is divided into two parts：1st, rail system circuit model；2nd, Car's door controlling mould Type.
Step 32：Urban track traffic for passenger flow distribution model is set up, the simulation of rail system circuit model department pattern is static Rail traffic network.It includes station, train and working line, circuit transfer, four parts of selection branch model.
Station：Ticketing is experienced when passenger is entered the station and is queued up and platform two is walked to by ticket office and be delayed.Model uses delay Two delays of module simulation.As shown in Figure 2, source controls EnterL1_1, EnterL1_2, EnterL1_3, EnterL1_ 4th, EnterL2_1, EnterL2_2 generation passenger, passenger get to the station after pass through by delay controls StninL1_1, StninL1_2, StninL1_3, StninL1_4, StninL2_1, StninL2_2 produce booking time delays, then pass through ticket office and walk to Platform time delays, PfL1_1, PfL1_2, PfL1_3, PfL1_4, PfL2_1, PfL2_2 are represented in figure.Hold controls in figure CStninL1_1, cStninL1_2, cStninL1_3, cStninL1_4, cStninL2_1, cStninL2_2 represent the gate that enters the station Form passenger flow control at first；Another place hold controls TctrlL1_1, TctrlL1_2, TctrlL1_3, TctrlL1_4, TctrlL2_1, TctrlL2_2 represent the passenger flow blocking for waiting train to reach after passenger's in-track platform.When passenger is outbound experience from Platform walks to station outlet and leaves two events of system.As shown in Figure 2, using delay controls StnExitL1_1, StnExitL1_2, StnExitL1_3, StnExitL1_4, StnExitL2_1, StnExitL2_2 represent that passenger is outbound by platform Walk to the delay of exit；Finally by sink modules ExitL1_2, ExitL1_3, ExitL1_4, ExitL1_5, ExitL2_2, ExitL2_3 represent that passenger leaves system.
With reference to passenger's trip requirements, represent that passenger reaches car by selectoutput modules L1_2, L1_3, L1_4, L2_2 Selection goes on one's journey or outbound after standing.
Train and working line：Train time delays on the line is represented using delay modules.Model example sets up two Bar circuit, circuit 1 has 5 websites, 4 block section between stations, and circuit 2 has 3 websites, 2 block section between stations, and two lines road is by a friendship The station transfer of remittance.Exemplary layout is as shown in Figure 3.
Between circuit 1 represents four stations using 4 delay modules TripL1_1, TripL1_2, TripL1_3, TripL1_4 It is interval.Formwork (L1_2, L1_3, L1_4) is selected to connect by selectoutput between each two delay modules.Circuit 2 Two block section between stations are represented using 2 delay modules TripL2_1, TripL2_2.Pass through between two delay modules Selectoutput selects formwork (L2_2) connection.It is optional after getting to the station that selectoutput selection branch act as passenger Select and go on one's journey, outbound or transfer.
Circuit is changed to：The station 3 of circuit 1 is actually same station with the station 2 of circuit 2 in example model, retouches for convenience Transfer behavior is stated, transfer stop is divided into two parts is analyzed.Two stations are initially set up, is collectively constituted by the two stations The mould of transfer station (is set up in transfer stop if joint of the transfer stop in rail network for three-line using three stations Type, by that analogy).As shown in Figure 2, in model by selectoutput select formwork InterCFromL1_L2, InterCFromL2_L1 describes the transfer behavior between two lines road.Set up after completing transfer station, two stations are passed through Connector connectors have contacted part of the transfer stop on two lines road.Will a station transfer outlet be connected to turn Line station is entered the station on walking channel.Select formwork InterCFromL1_L2's by connecting selectoutput in figure False ends to the Pedestrian Only of circuit 2 is delayed PfL2_2 and connection selectoutput selection formworks InterCFromL2_L1 False ends to circuit 1 Pedestrian Only delay PfL1_3 realize.False ends are unassignable in selectoutput controls One end.
Selection branch：Selectoutput modules represent the behavior that passenger makes a choice in the case where there is selection.Selection The select probability of branch is defined by selection branch assignment, and such as definition selection branch probability is 0.9, then it represents that selectoutput controls True ends select probability is that 0.9, false ends select probability is 0.1.True ends are of assignment in selectoutput controls End.
In model selection send away at two, one be by the selection branch model at station, one be transfer station selection Branch model.Go on one's journey or go out in the selection up to after getting to the station by the selection branch model L1_2 at station, L1_4, for passenger Stand.The selection branch control of transfer station sets two, and one is to choose whether to continue along the trip of this line by selecting branch L1_3, L2_2 OK, the probability that passenger continues to be travelled along this line is to selection branch control assignment；One is by selecting branch InterCFromL1_ L2, InterCFromL2_L1 selection transfer or outbound, are the probability of outbound passenger to selection branch control assignment.
Step 33：Set up urban track traffic for passenger flow distribution model, rail system circuit model partial simulation static track Transportation network.Four parts described in combining step 32, build complete rail system circuit model as shown in Figure 2.
Step 34：Urban track traffic for passenger flow distribution model is set up, door control system model part sets up the row at station Car Controlling model, the operation of the switch simulation train by controlling car door.By the operation for controlling the switch simulation train of car door The mode of flow chart is needed to use to set up a flow chart on the time.Flow includes that state is initial as shown in Figure 4 Change cPfL1_1, cPfL1_2, cPfL1_3, cPfL1_4, cPfL2_1, cPfL2_2, the time of departure of train, train departure time Interval and car door opening time.
Interval is divided into two types, one kind is to originate Zhongdao interval, and one kind is by interval.First bus stand firm justice hair The car time is the moment 0, without the time of departure after the arrival of terminal station train, therefore originates terminal station interval Car's door controlling model and does not need The time of departure of vehicle is set.Originate Zhongdao interval and be considered as train departure time interval and car door opening time to simulate train Operation.The change of transition definition status is used in model.Set two transition, one transition cWaitTrainL1_1, Between cWaitTrainL2_1, cWaitTrainL2_2 are used to set the time interval i.e. time of departure of train that car door is opened twice Every；The opening time that another transition cReleaseL1_1, cReleaseL2_1, cReleaseL2_2 are used to set car door arranges The dwell time of car.For by interval, should first define the time of departure of train, by change InitL1_2, InitL1_3, InitL1_4 are realized；The same Zhongdao interval that originates is set below and is similar to two transition of setting, one changes CWaitTrainL1_2, cWaitTrainL1_3, cWaitTrainL1_4 are used to setting time interval that car door opens twice i.e. The departing time interval of train；Another transition cReleaseL1_2, cReleaseL1_3, cReleaseL1_4 are used to set car The opening time of door is the dwell time of train.The Car's door controlling model composition system Car's door controlling model of both the above type is such as Shown in accompanying drawing 4.
Step 35：Urban track traffic for passenger flow distribution model is set up, with the shortest path that this model judges to be searched in step 2 Whether middle station crowding reaches the threshold value of crowding, and the step is specific as follows：
Crowding threshold value is set as the 80% of station Maximum Assembling in this patent.When the number for getting to the station does not reach To station Maximum Assembling 80% when, in Systematic selection step 2 search for shortest path as passenger trip route simultaneously Printing.When the number for getting to the station reaches 80%, the line efficiency that of passenger is influenceed to prevent station number from further assembling, Now system will select new path to be supplied to passenger's trip to use, and turn to next step.
In a further embodiment, the broad sense of the and website interval according to urban mass transit network for being referred in step 4 Expense, the second shortest path between search is out of the station comprises the following steps：
Step 41：The track traffic generalized cost for building is used as the interval weight search track transportation network with station.
Step 42：Generalized cost is selected as the second shortest path of interval and station weight, using most short based on Dijkstra Gradually short-circuit searching algorithm searches for second shortest path to the k bars of routing algorithm, and the second shortest path for searching out is i.e. as the path of Systematic selection One of.
In a still further embodiment, step 42 is further：
Step 421：From network shortest path it is any select an edge contract it, then will be vacant using shortest path first Partial section others section is filled, and finds out interim shortest path；
Step 422：The operation of step 421 is repeated, until all sections in shortest path are all deleted and find Substitute section, now more all interim shortest paths found out, its Road it is long it is most short be time shortest path.
In a further embodiment, it is further as follows in step 5：The second shortest path searched in Systematic selection step 4 is made For passenger trip route and print.
Based on the above method, a kind of path suggesting system for wearing can be built, such as a kind of urban track traffic passenger trip route Suggesting system for wearing, including：
Passenger's trip route proposer, is arranged on the place of entering the station of rail traffic station, for gathering injection traffic system Unite passenger information out of the station, and according to generalized cost function search it is out of the station between the shortest path on generalized cost；It is logical What the real-time number comparing in station crossed in the urban track traffic for passenger flow distribution model set up using Anylogic was searched out If the station number that shortest path is passed through a station not up to station Maximum Assembling threshold value (80%), proposer is printed most Short path trip receipt, passenger advises going on a journey according to receipt.Otherwise the proposer is searched for according to generalized cost function and passed in and out again Second shortest path on generalized cost between standing, after completing search, it is proposed that device printing second shortest path trip receipt, passenger is according to small Ticket suggestion trip.The path allocation of the passenger terminates.
To sum up, present invention incorporates passenger's trip easily demand and the relevant parameter of system crowding is considered simultaneously, A kind of practicable suggestion is proposed to Path selection of the passenger in urban track traffic trip.Hardware facility aspect, including Can be used for acquisition and recording passenger trip information and passenger's trip route proposer of passenger's trip route suggestion is provided.Passenger goes out The whole story station information shortest path or second shortest path of the selection on generalized cost that row proposer is gone on a journey according to passenger；And according to Whether reach station crowding as Rule of judgment, most short trip route printed if not up to, otherwise print it is time short go out walking along the street Footpath；Then passenger is according to trip receipt suggestion trip.Adopting this method can improve going out line efficiency and alleviating car for passenger Crowding stand so as to improve the operational efficiency of track traffic.
In a word, the present invention plays suggestion effect for urban track traffic passenger's trip route, by setting up the wide of circuit Adopted cost function finds shortest path and second shortest path on generalized cost；And handed over according to the track set up using Anylogic Whether the station passengers quantity of real time record reaches threshold value and then selects on the most short of generalized cost in logical Trip Assignment Model Path or second shortest path, the trip route hence for passenger play suggestion effect.
The preferred embodiment of the present invention described in detail above, but, the present invention is not limited in above-mentioned implementation method Detail, in range of the technology design of the invention, various equivalents can be carried out to technical scheme, this A little equivalents belong to protection scope of the present invention.
It is further to note that each particular technique feature described in above-mentioned specific embodiment, in not lance In the case of shield, can be combined by any suitable means.In order to avoid unnecessary repetition, the present invention to it is various can The combination of energy is no longer separately illustrated.
Additionally, can also be combined between a variety of implementation methods of the invention, as long as it is without prejudice to originally The thought of invention, it should equally be considered as content disclosed in this invention.

Claims (8)

1. a kind of urban track traffic passenger trip route suggesting method, it is characterised in that comprise the following steps：
Step 1：Passenger is entered the station and selects outbound information, and passenger's Information Statistics out of the station are entered into system；
Step 2：Interval and website the generalized cost of urban mass transit network is calculated, and is weighed as section according to the generalized cost Weight, solve it is out of the station between shortest path, as one of the selection of passenger's trip route；
Step 3：Urban track traffic for passenger flow distribution model is set up using Anylogic softwares, it is all in reflection rail system to multiply The trip information of visitor, and judge whether station crowding reaches crowding in the shortest path of search in step 2 with this model Threshold value, if not up to threshold value, the shortest path trip receipt searched in system print step 2, the path allocation of the passenger terminates； Otherwise, 4 are gone to step；
Step 4：The generalized cost of interval and website according to urban mass transit network, the second shortest path between search is out of the station, As the selection of passenger's trip route；
Step 5：System print comprising it is described it is out of the station between second shortest path information trip receipt, the path allocation of the passenger Terminate；
Step 6：Passenger goes on a journey according to the trip route suggestion receipt of system print, terminates.
2. urban track traffic passenger trip route suggesting method according to claim 1, it is characterised in that the step 2 further include following steps：
Step 21：Urban mass transit network influence passenger carry out Path selection factor include the vehicle-mounted time, the stand-by period and Walking time, generalized cost function is set up for the influence of passenger's Path selection by analyzing three generalized cost influence factors；
Step 22：Generalized cost influence factor according to step 21 calculates the travel time, and the travel time is one on car Weighting function f (t) of load time, stand-by period and walking time：
F (t)=(t1,t2,t3),
Wherein, t1It is vehicle-mounted time, t2It is stand-by period, t3It it is the walking time, t is travel time summation；
Step 23：Generalized cost influence factor according to step 21 and step 22 calculates vehicle-mounted time, vehicle-mounted time t1By car Run time and vehicle dwell time composition：
t 1 = t a + p a = l a v a + c ,
Wherein, taIt is vehicle hour, paIt is vehicle dwell time, vehicle hour taIn urban track traffic operation During refer to run time of the vehicle between station, vehicle hour is equal to the length l between operation stationaAnd running velocity vaThe ratio between；The dwell time that vehicle runs in systems is constant c, i.e. vehicle dwell time pa=c；
Step 24：Generalized cost influence factor according to step 21 and step 22 calculates stand-by period t2, stand-by period t2By Booking stand-by period and queue waiting time are constituted, and queue waiting time can be divided into the elapsed time entered the station when queuing up again, with And waiting time of being queued up before being got on the bus after entering the station；
Booking stand-by period and setting and booking ticket checking of the waiting time mainly due to the gate mouthful that enters the station when queuing up of entering the station When passenger be detained produced by time：
t 2 = w 1 + w 2 = m + h 2 ,
Wherein, w1It is booking stand-by period and the queuing time that enters the station, its value is constant m, w2After being entered the station for passenger wait train when Between, the time depends on the departing time interval of circuit, and passenger is taken as departing time interval h at average latency waited of entering the station Half；
Step 25：Generalized cost influence factor according to step 21 and step 22 calculates walking time, walking time t3By entering The outbound walking time and transfer the walking time constitute, the walking time out of the station for when passenger is entered the station by station entrance by one Serial walking runs to the time that platform consumed and passenger reaches home after station gets off by a series of walkings until station The consumed time sum of a certain outlet, the time out of the station is relevant with the layout designs at station, and the time out of the station is wt1, turnover The time of station is designated as constant n；The transfer walking time is the time spent on transferring passage when passenger changes to, and changes to the walking time Main related to the distance of transferring passage, the transfer walking time can be obtained by transferring passage distance walking speed average than passenger Arrive, the definition transfer walking time is wt2, transferring passage length is s, vPeopleIt is 1m/s, obtains：
Thus walking time t is obtained3：
t3=wt1+wt2=n+s；
Step 26：Generalized cost influence factor sets up generalized cost letter according to step 22, step 23, step 24 and step 25 Number, it is further as follows：
Define β1、β2、、β3For the vehicle-mounted time, the stand-by period, the walking time weighted factor, and β1, β2, β3≥1, thus examined Consider weighted factor path generalized cost function F be：
F=β1t1+β2t2+β3t3,
Expansion obtains path generalized cost function F and is：
F = β 1 ( l a v a + c ) + β 2 ( h 2 + m ) + β 3 ( n + s ) ,
In formula：β1, β2, β3The weighted factor of respectively vehicle-mounted time, stand-by period and walking time, laIt is terminal traffic coverage Length, vaIt is train average running speed, h is train departure time interval, and c is dwell time summation, and m is that booking queuing is entered the station Time, n is total time out of the station, and s is transferring passage length；
Step 27：Selection generalized cost is the shortest path of weight, is searched for using Dijkstra shortest path firsts and is taken with broad sense The shortest path of section and node weights is used as, the shortest path for searching out is i.e. as one of the path of Systematic selection.
3. urban track traffic passenger trip route suggesting method according to claim 2, it is characterised in that the step 27 further include：
Step 271：The all of station of Rail traffic network is divided into two parts：The station set P of known shortest path；It is unknown most The station set Q of short path, in an initial condition, it is known that only exist initial station in the station set P of shortest path；Definition Book [i] array is used to record which station in set P, for station i, book [i] be 1 expression station i in set P, Book [i] is 0 and represents station i in set Q；One-dimension array dis is used to store initial station to the road at remaining each station Journey；
Step 272：Order starting station a to the shortest path of itself be 0, i.e. dis=0, if the presence of starting station can be directly to and reach Station i, then dis [i] is set to e [a] [i], while setting other stations that all initial stations not directly reach most Short path is ∞；
Step 273：A station u nearest from initial station a is selected to be added in set P in all stations of set Q, i.e., The minimum station u of dis [u] are added in set P；And all sections with station u as starting point are checked, to each section all Carry out loose operations, if in the presence of one from u to the section of any station v, then can by by section uv be added to afterbody come A path from a to v is expanded, and the length of this paths is dis [u]+e [u] [v], if the value obtained is than being currently known The value of dis [v] is small, then the value in current dis [v] can be substituted with solution value；
Step 274：Step 273 is repeated, until, without station element, algorithm terminates in set Q, in final dis [] array Value is exactly shortest path of the initial station to other all stations.
4. urban track traffic passenger trip route suggesting method according to claim 3, it is characterised in that the step 3 are further：
Step 31：Urban track traffic for passenger flow distribution model is set up using Anylogic softwares, to reflect institute in rail system There is the trip information of passenger, the Trip Assignment Model is divided into two parts of rail system circuit model and Car's door controlling model；
Step 32：Rail system circuit model department pattern simulates static track transportation network, and it includes station, train and operation Circuit, four parts of circuit transfer and selection branch model；
Station：Ticketing is experienced when passenger is entered the station and is queued up and platform two is walked to by ticket office and be delayed, model uses delay modules Simulation two delay, source controls EnterL1_1, EnterL1_2, EnterL1_3, EnterL1_4, EnterL2_1, EnterL2_2 generate passenger, passenger get to the station after pass through by delay controls StninL1_1, StninL1_2, StninL1_3, StninL1_4, StninL2_1, StninL2_2 produce booking time delays, then pass through ticket office and walk to the platform time and prolong Miss, PfL1_1, PfL1_2, PfL1_3, PfL1_4, PfL2_1, PfL2_2 are represented, hold controls cStninL1_1, cStninL1_ 2nd, cStninL1_3, cStninL1_4, cStninL2_1, cStninL2_2 represent that the gate that enters the station forms passenger flow control at first, Another place hold controls TctrlL1_1, TctrlL1_2, TctrlL1_3, TctrlL1_4, TctrlL2_1, TctrlL2_2 are represented The passenger flow blocking that train is reached is waited after passenger's in-track platform；Experience is walked to station outlet and is left from platform when passenger is outbound Two events of system, using delay controls StnExitL1_1, StnExitL1_2, StnExitL1_3, StnExitL1_4, StnExitL2_1, StnExitL2_2 represent the outbound delay that exit is walked to by platform of passenger, finally by sink modules ExitL1_2, ExitL1_3, ExitL1_4, ExitL1_5, ExitL2_2, ExitL2_3 represent that passenger leaves system；
With reference to passenger's trip requirements, after representing that passenger gets to the station by selectoutput modules L1_2, L1_3, L1_4, L2_2 Selection goes on one's journey or outbound；
Train and working line：Train time delays on the line is represented using delay modules, model example sets up two lines Road, circuit 1 has 5 websites, 4 block section between stations, circuit 2 has 3 websites, 2 block section between stations, and two lines road is crossed by one Change at station；
Circuit 1 represents four block section between stations using 4 delay modules TripL1_1, TripL1_2, TripL1_3, TripL1_4, Formwork L1_2, L1_3, L1_4 is selected to connect by selectoutput between each two delay modules；Circuit 2 uses 2 Delay modules TripL2_1, TripL2_2 represent two block section between stations, and selectoutput is passed through between two delay modules The L2_2 connections of selection formwork；Selectoutput selection branch act as passenger and may be selected to go on one's journey after getting to the station, and goes out Stand or change to；
Circuit is changed to：The station 3 of circuit 1 is actually same station with the station 2 of circuit 2 in model, for convenience description transfer row Transfer stop to be divided into two parts and being analyzed；Two stations are initially set up, transfer stop is collectively constituted by the two stations； In model by selectoutput select formwork InterCFromL1_L2, InterCFromL2_L1 describe two lines road it Between transfer behavior, set up complete transfer station after, by two stations by connector connectors contacted transfer stop be located at two Part on bar circuit, will the transfer outlet at a station be connected to and turn the entering the station on walking channel of line station, by connection The false ends of selectoutput selection formworks InterCFromL1_L2 to the Pedestrian Only of circuit 2 is delayed PfL2_2 and company False ends to the Pedestrian Only of circuit 1 for meeting selectoutput selection formworks InterCFromL2_L1 is delayed PfL1_3 realities It is existing；False ends are unassignable one end in selectoutput controls；
Selection branch：Selectoutput modules represent the behavior that passenger makes a choice in the case where there is selection, selection branch Select probability is defined by selection branch assignment, and such as definition selection branch probability is 0.9, then it represents that selectoutput controls true End select probability is that 0.9, false ends select probability is 0.1；True ends are one end of assignment in selectoutput controls；
In model selection send away at two, one be by the selection branch model at station, one be transfer station selection formwork Type, is gone on one's journey or gone out for passenger by selection branch model L1_2, L1_3, the L1_4 at station in the selection up to after getting to the station Stand, the selection branch control of transfer station sets two, and one is to choose whether to continue along the trip of this line by selecting branch L1_3, L2_2 OK, the probability that passenger continues to be travelled along this line is to selection branch control assignment；One is by selecting branch InterCFromL1_ L2, InterCFromL2_L1 selection transfer or outbound, are the probability of outbound passenger to selection branch control assignment；
Step 33：According to step 31, urban track traffic for passenger flow distribution model, rail system circuit model are set up described in step 32 Partial simulation static track transportation network, four parts described in combining step 32 build complete rail system circuit model；
Step 34：Urban track traffic for passenger flow distribution model is set up according to step 31, door control system model part is built The Train Control model at vertical station, the operation of the switch simulation train by controlling car door, is simulated by controlling the switch of car door The operation of train needs to use the mode of flow chart to set up a flow chart on the time, and flow includes state initialization Between cPfL1_1, cPfL1_2, cPfL1_3, cPfL1_4, cPfL2_1, cPfL2_2, the time of departure of train, train departure time Every and car door opening time；
Interval is divided into two types, one kind is that to originate Zhongdao interval, one kind be by interval, first bus stand firm justice dispatch a car when Between be the moment 0, terminal station train reach after without the time of departure, therefore originate terminal station interval Car's door controlling model need not set At the time of departure of vehicle, originate Zhongdao interval and be considered as train departure time interval and car door opening time to simulate the fortune of train OK, in model using transition definition status change, set two transition, one transition cWaitTrainL1_1, Between cWaitTrainL2_1, cWaitTrainL2_2 are used to set the time interval i.e. time of departure of train that car door is opened twice Every；The opening time that another transition cReleaseL1_1, cReleaseL2_1, cReleaseL2_2 are used to set car door arranges The dwell time of car；For by interval, should first define the time of departure of train, by change InitL1_2, InitL1_3, InitL1_4 are realized；The same Zhongdao interval that originates is set below and is similar to two transition of setting, one changes CWaitTrainL1_2, cWaitTrainL1_3, cWaitTrainL1_4 are used to setting time interval that car door opens twice i.e. The departing time interval of train；Another transition cReleaseL1_2, cReleaseL1_3, cReleaseL1_4 are used to set car The opening time of door is the dwell time of train, the Car's door controlling model composition system Car's door controlling model of both the above type；
Step 35：Urban track traffic for passenger flow distribution model is set up, car in the shortest path of search in step 2 is judged with this model Whether crowding of standing reaches the threshold value of crowding, and the step is specific as follows：
Crowding threshold value is set as the 80% of station Maximum Assembling, when the number for getting to the station not up to station highest aggregation Number 80% when, the shortest path searched in Systematic selection step 2 as passenger trip route and print, when getting to the station Number when reaching 80%, for prevent station number further aggregation and influence the line efficiency that of passenger, now system will be selected New path is used with being supplied to passenger to go on a journey, and turns to next step.
5. urban track traffic passenger trip route suggesting method according to claim 4, it is characterised in that the step 4 further include：
Step 41：The track traffic built according to step 21, step 22, step 23, step 24, step 25 and step 26 Generalized cost is used as the interval weight search track transportation network with station；
Step 42：Generalized cost is selected as the second shortest path of the weight at interval and station, using based on Dijkstra shortest paths The k bars of footpath algorithm gradually short-circuit searching algorithm search second shortest path, the second shortest path for searching out i.e. as Systematic selection path it One.
6. urban track traffic passenger trip route suggesting method according to claim 5, it is characterised in that the step 42 further include：
Step 421：From network shortest path it is any select an edge contract it, then using shortest path first by rest Section others sections fill, find out interim shortest path；
Step 422：The operation of step 421 is repeated, until all sections in shortest path are all deleted and find replacement Section, now more all interim shortest paths found out, its Road most short as time shortest path long.
7. urban track traffic passenger trip route suggesting method according to claim 6, it is characterised in that the step 5 further for the second shortest path searched in Systematic selection step 4 is as the trip route of passenger and prints.
8. a kind of urban track traffic passenger's trip route suggesting method according to any one of claim 1 to 7 builds Urban track traffic passenger's trip route suggesting system for wearing, it is characterised in that including：Passenger's trip route proposer, is set in-orbit The place of entering the station of road traffic station, the information out of the station for gathering injection traffic system passenger；And according to generalized cost letter Shortest path on generalized cost between number search is out of the station；By using the urban track traffic for passenger flow that Anylogic sets up If the station number that the shortest path that the real-time number comparing in station in distribution model is searched out is passed through a station is not up to Station Maximum Assembling threshold value, then proposer printing shortest path trip receipt, passenger according to receipt advise go on a journey；Otherwise should Proposer again according to generalized cost function search it is out of the station between the second shortest path on generalized cost, complete search after, build View device printing second shortest path trip receipt, passenger advises going on a journey according to receipt, and the path allocation of the passenger terminates.
CN201611096579.1A 2016-12-02 2016-12-02 Urban rail transit passenger travel path suggestion method and system Active CN106779190B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611096579.1A CN106779190B (en) 2016-12-02 2016-12-02 Urban rail transit passenger travel path suggestion method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611096579.1A CN106779190B (en) 2016-12-02 2016-12-02 Urban rail transit passenger travel path suggestion method and system

Publications (2)

Publication Number Publication Date
CN106779190A true CN106779190A (en) 2017-05-31
CN106779190B CN106779190B (en) 2020-03-31

Family

ID=58883727

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611096579.1A Active CN106779190B (en) 2016-12-02 2016-12-02 Urban rail transit passenger travel path suggestion method and system

Country Status (1)

Country Link
CN (1) CN106779190B (en)

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108151756A (en) * 2017-12-21 2018-06-12 深圳市综合交通运行指挥中心 The travel time computation method and device of a kind of urban public tranlport system
CN108388542A (en) * 2018-01-18 2018-08-10 中国科学院遥感与数字地球研究所 A kind of rail traffic crowding computational methods and system
CN108764516A (en) * 2018-04-04 2018-11-06 深圳大学 A kind of generation method and system of rail traffic dynamic reachable path
CN108876064A (en) * 2018-08-23 2018-11-23 北京交通大学 Urban mass transit network key station recognition methods based on the volume of the flow of passengers
CN109993353A (en) * 2019-03-21 2019-07-09 华侨大学 The selection of regular public traffic route and method of adjustment along a kind of rail traffic
CN110070218A (en) * 2019-04-12 2019-07-30 西南交通大学 Dynamic service network optimum design method towards multi-standard Regional Rail Transit
CN110263993A (en) * 2019-06-14 2019-09-20 上海工程技术大学 A kind of real-time predicting method for handing over passenger's travel time for city rail
CN110322058A (en) * 2019-06-21 2019-10-11 东南大学 A kind of rail traffic trip mode shortest time path calculation method considering walking linking
CN110390421A (en) * 2019-06-12 2019-10-29 北京交通大学 Congestion subway line passenger flow control method for coordinating based on time-space network
CN110428096A (en) * 2019-07-26 2019-11-08 西南交通大学 The more cross-channel Transportation Organization optimization methods of urban track traffic based on ticket information
CN111325649A (en) * 2020-02-19 2020-06-23 五邑大学 Urban rail transit combined station stop method
CN111950814A (en) * 2020-09-01 2020-11-17 吉林大学 Passenger transport hub transfer streamline optimization method based on generalized cost function
CN111967135A (en) * 2020-07-13 2020-11-20 昆明理工大学 Off-line station for rail transit system and rail transit system
CN112101677A (en) * 2020-09-23 2020-12-18 佳都新太科技股份有限公司 Public transport travel path planning method, device, equipment and storage medium
CN112488388A (en) * 2020-11-30 2021-03-12 佳都新太科技股份有限公司 Outbound passenger flow prediction method and device based on probability distribution
CN112949078A (en) * 2021-03-17 2021-06-11 北京交通大学 Urban rail transit passenger flow-traffic flow matching degree calculation method
CN112966218A (en) * 2021-02-26 2021-06-15 佳都新太科技股份有限公司 Real-time calculation method and device for number of passengers in carriage
CN113168663A (en) * 2018-12-12 2021-07-23 伟摩有限责任公司 Multi-destination trip for autonomous vehicles
CN113705902A (en) * 2021-08-31 2021-11-26 中铁第一勘察设计院集团有限公司 Traffic hub passenger transport organization evaluation method based on crowd management
CN114923497A (en) * 2022-04-21 2022-08-19 西南交通大学 Method, device, equipment and storage medium for planning railway trip path
CN115809729A (en) * 2022-11-28 2023-03-17 北京交通大学 Urban rail transit hub transfer facility optimal configuration method considering newly added lines
CN116311932A (en) * 2023-03-16 2023-06-23 东南大学 Dynamic traffic distribution method considering hybrid equalization in MaaS background
CN116307441A (en) * 2022-11-28 2023-06-23 北京交通大学 Urban rail transit junction transfer facility optimal configuration method considering burst scene
CN117896505A (en) * 2024-03-11 2024-04-16 常州大数据有限公司 Security monitoring management system based on big data Internet of things

Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050027447A1 (en) * 2003-07-30 2005-02-03 Pioneer Corporation Device, system, method and program for navigation and recording medium storing the program
WO2007097768A3 (en) * 2006-02-21 2009-04-23 Us Postal Service Route creation device for powered industrial vehicles
TW201109624A (en) * 2008-12-30 2011-03-16 Tele Atlas North America Inc A method and system for transmitting and/or receiving at least one location reference, enhanced by at least one focusing factor
CN102169524A (en) * 2010-02-26 2011-08-31 同济大学 Staged multi-path model algorithm of urban rail transit network passenger flow distribution
US8024110B2 (en) * 2007-05-22 2011-09-20 Xanavi Informatics Corporation Method of estimation of traffic information, device of estimation of traffic information and car navigation device
CN102306243A (en) * 2011-07-27 2012-01-04 高新现代智能系统股份有限公司 Method for sorting transfer passenger flow in rail traffic
CN102663887A (en) * 2012-04-13 2012-09-12 浙江工业大学 Implementation system and method for cloud calculation and cloud service of road traffic information based on technology of internet of things
CN102819962A (en) * 2012-08-23 2012-12-12 江苏物联网研究发展中心 Digital-map-based urban traffic flow network parallel information system
CN103727948A (en) * 2012-10-16 2014-04-16 北京掌行通信息技术有限公司 Real-time guidance method for bus taking navigation
CN103839435A (en) * 2012-11-20 2014-06-04 埃森哲环球服务有限公司 Situation-aware mobile travel advisory to public transport commuters
US20140180570A1 (en) * 2009-11-11 2014-06-26 Google Inc. Transit routing system for public transportation trip planning
CN104599001A (en) * 2015-02-12 2015-05-06 东南大学 City streetcar, BRT and conventional bus transit network traffic allocation method and transfer junction determining method
CN104851309A (en) * 2015-06-01 2015-08-19 南京邮电大学 Traffic guidance strategy realization method
CN104899654A (en) * 2015-06-05 2015-09-09 中南大学 Path selecting method for alleviating rail transit jam
CN105637324A (en) * 2013-09-13 2016-06-01 丰田自动车株式会社 Movement guidance device and movement guidance method

Patent Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050027447A1 (en) * 2003-07-30 2005-02-03 Pioneer Corporation Device, system, method and program for navigation and recording medium storing the program
WO2007097768A3 (en) * 2006-02-21 2009-04-23 Us Postal Service Route creation device for powered industrial vehicles
US8024110B2 (en) * 2007-05-22 2011-09-20 Xanavi Informatics Corporation Method of estimation of traffic information, device of estimation of traffic information and car navigation device
TW201109624A (en) * 2008-12-30 2011-03-16 Tele Atlas North America Inc A method and system for transmitting and/or receiving at least one location reference, enhanced by at least one focusing factor
US20140180570A1 (en) * 2009-11-11 2014-06-26 Google Inc. Transit routing system for public transportation trip planning
CN102169524A (en) * 2010-02-26 2011-08-31 同济大学 Staged multi-path model algorithm of urban rail transit network passenger flow distribution
CN102306243A (en) * 2011-07-27 2012-01-04 高新现代智能系统股份有限公司 Method for sorting transfer passenger flow in rail traffic
CN102663887A (en) * 2012-04-13 2012-09-12 浙江工业大学 Implementation system and method for cloud calculation and cloud service of road traffic information based on technology of internet of things
CN102819962A (en) * 2012-08-23 2012-12-12 江苏物联网研究发展中心 Digital-map-based urban traffic flow network parallel information system
CN103727948A (en) * 2012-10-16 2014-04-16 北京掌行通信息技术有限公司 Real-time guidance method for bus taking navigation
CN103839435A (en) * 2012-11-20 2014-06-04 埃森哲环球服务有限公司 Situation-aware mobile travel advisory to public transport commuters
CN105637324A (en) * 2013-09-13 2016-06-01 丰田自动车株式会社 Movement guidance device and movement guidance method
CN104599001A (en) * 2015-02-12 2015-05-06 东南大学 City streetcar, BRT and conventional bus transit network traffic allocation method and transfer junction determining method
CN104851309A (en) * 2015-06-01 2015-08-19 南京邮电大学 Traffic guidance strategy realization method
CN104899654A (en) * 2015-06-05 2015-09-09 中南大学 Path selecting method for alleviating rail transit jam

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
宋涵: ""考虑拥挤效应的多条最短路径研究与实现"", 《中国科技论文》 *
李森荟: ""城市轨道交通站台乘客行为规律与引导措施研究"", 《中国优秀硕士学位论文全文数据库工程科技Ⅱ辑》 *
赵路敏 等: ""基于Anylogic的城市轨道交通车站仿真应用研究"", 《铁路计算机应用》 *
黄绿娥 等: ""城市公交线路选择方法设计及其实现"", 《科技广场》 *

Cited By (40)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108151756A (en) * 2017-12-21 2018-06-12 深圳市综合交通运行指挥中心 The travel time computation method and device of a kind of urban public tranlport system
CN108151756B (en) * 2017-12-21 2021-06-29 深圳市综合交通运行指挥中心 Travel time calculation method and device of urban public transport system
CN108388542A (en) * 2018-01-18 2018-08-10 中国科学院遥感与数字地球研究所 A kind of rail traffic crowding computational methods and system
CN108764516A (en) * 2018-04-04 2018-11-06 深圳大学 A kind of generation method and system of rail traffic dynamic reachable path
CN108876064A (en) * 2018-08-23 2018-11-23 北京交通大学 Urban mass transit network key station recognition methods based on the volume of the flow of passengers
CN108876064B (en) * 2018-08-23 2022-03-18 北京交通大学 Urban rail transit network key station identification method based on passenger flow
CN113168663A (en) * 2018-12-12 2021-07-23 伟摩有限责任公司 Multi-destination trip for autonomous vehicles
CN109993353A (en) * 2019-03-21 2019-07-09 华侨大学 The selection of regular public traffic route and method of adjustment along a kind of rail traffic
CN109993353B (en) * 2019-03-21 2022-07-29 华侨大学 Method for selecting conventional bus route along track traffic line
CN110070218A (en) * 2019-04-12 2019-07-30 西南交通大学 Dynamic service network optimum design method towards multi-standard Regional Rail Transit
CN110390421A (en) * 2019-06-12 2019-10-29 北京交通大学 Congestion subway line passenger flow control method for coordinating based on time-space network
CN110390421B (en) * 2019-06-12 2022-05-10 北京交通大学 Space-time network-based method for coordinating and controlling passenger flow of congested subway line
CN110263993A (en) * 2019-06-14 2019-09-20 上海工程技术大学 A kind of real-time predicting method for handing over passenger's travel time for city rail
CN110322058B (en) * 2019-06-21 2022-04-15 东南大学 Rail transit travel mode time shortest path calculation method considering walking connection
CN110322058A (en) * 2019-06-21 2019-10-11 东南大学 A kind of rail traffic trip mode shortest time path calculation method considering walking linking
CN110428096A (en) * 2019-07-26 2019-11-08 西南交通大学 The more cross-channel Transportation Organization optimization methods of urban track traffic based on ticket information
CN110428096B (en) * 2019-07-26 2022-01-18 西南交通大学 Ticket information-based urban rail transit multi-traffic-road transportation organization optimization method
CN111325649A (en) * 2020-02-19 2020-06-23 五邑大学 Urban rail transit combined station stop method
CN111325649B (en) * 2020-02-19 2023-10-03 五邑大学 Urban rail transit combined station stopping method
CN111967135A (en) * 2020-07-13 2020-11-20 昆明理工大学 Off-line station for rail transit system and rail transit system
CN111950814A (en) * 2020-09-01 2020-11-17 吉林大学 Passenger transport hub transfer streamline optimization method based on generalized cost function
CN112101677A (en) * 2020-09-23 2020-12-18 佳都新太科技股份有限公司 Public transport travel path planning method, device, equipment and storage medium
CN112101677B (en) * 2020-09-23 2022-03-22 佳都科技集团股份有限公司 Public transport travel path planning method, device, equipment and storage medium
CN112488388A (en) * 2020-11-30 2021-03-12 佳都新太科技股份有限公司 Outbound passenger flow prediction method and device based on probability distribution
CN112488388B (en) * 2020-11-30 2022-08-02 佳都科技集团股份有限公司 Outbound passenger flow prediction method and device based on probability distribution
CN112966218A (en) * 2021-02-26 2021-06-15 佳都新太科技股份有限公司 Real-time calculation method and device for number of passengers in carriage
CN112966218B (en) * 2021-02-26 2023-06-16 佳都科技集团股份有限公司 Real-time calculation method and device for passenger carrying number of carriage
CN112949078A (en) * 2021-03-17 2021-06-11 北京交通大学 Urban rail transit passenger flow-traffic flow matching degree calculation method
CN112949078B (en) * 2021-03-17 2023-12-05 北京交通大学 Matching degree calculation method for urban rail transit passenger flow and traffic flow
CN113705902A (en) * 2021-08-31 2021-11-26 中铁第一勘察设计院集团有限公司 Traffic hub passenger transport organization evaluation method based on crowd management
CN113705902B (en) * 2021-08-31 2024-02-27 中铁第一勘察设计院集团有限公司 Traffic hub passenger transport organization evaluation method based on crowd management
CN114923497A (en) * 2022-04-21 2022-08-19 西南交通大学 Method, device, equipment and storage medium for planning railway trip path
CN116307441B (en) * 2022-11-28 2023-11-03 北京交通大学 Urban rail transit junction transfer facility optimal configuration method considering burst scene
CN115809729B (en) * 2022-11-28 2023-08-22 北京交通大学 Urban rail transit junction transfer facility optimal configuration method considering newly-added line
CN116307441A (en) * 2022-11-28 2023-06-23 北京交通大学 Urban rail transit junction transfer facility optimal configuration method considering burst scene
CN115809729A (en) * 2022-11-28 2023-03-17 北京交通大学 Urban rail transit hub transfer facility optimal configuration method considering newly added lines
CN116311932A (en) * 2023-03-16 2023-06-23 东南大学 Dynamic traffic distribution method considering hybrid equalization in MaaS background
CN116311932B (en) * 2023-03-16 2024-03-01 东南大学 Dynamic traffic distribution method considering hybrid equalization in MaaS background
CN117896505A (en) * 2024-03-11 2024-04-16 常州大数据有限公司 Security monitoring management system based on big data Internet of things
CN117896505B (en) * 2024-03-11 2024-05-07 常州大数据有限公司 Security monitoring management system based on big data Internet of things

Also Published As

Publication number Publication date
CN106779190B (en) 2020-03-31

Similar Documents

Publication Publication Date Title
CN106779190A (en) A kind of urban track traffic passenger trip route suggesting method and system
Al Islam et al. A real-time network-level traffic signal control methodology with partial connected vehicle information
Higgins et al. Modeling train delays in urban networks
CN104464310B (en) Urban area multi-intersection signal works in coordination with optimal control method and system
Christofa et al. Person-based traffic responsive signal control optimization
Grube et al. An event-driven simulator for multi-line metro systems and its application to Santiago de Chile metropolitan rail network
CN107273999A (en) A kind of Flow Prediction in Urban Mass Transit method under accident
Leurent et al. A user equilibrium, traffic assignment model of network route and parking lot choice, with search circuits and cruising flows
Ceder et al. Transfer synchronization of public transport networks
CN110162931A (en) Urban track traffic large-scale road network high-speed simulation system
CN106056242A (en) High-speed train operating scheme evaluation method based on passenger flow dynamic allocation
Li et al. Traffic signal timing optimization in connected vehicles environment
Abdelghany et al. Dynamic trip assignment-simulation model for intermodal transportation networks
CN104637328A (en) RSU (Roadside Unit)-based distributed real-time navigation method in vehicular ad hoc network
Lin et al. A simulation-based multiclass, multimodal traffic assignment model with departure time for evaluating traffic control plans of planned special events
Hoogendoorn et al. Applying microscopic pedestrian flow simulation to railway station design evaluation in Lisbon, Portugal
CN111724076A (en) Regional multi-type rail transit passenger flow dynamic distribution method under operation interruption condition
CN111723991A (en) Method for predicting and evaluating impact influence of large-scale movable scattered field passenger flow on subway station
Abdelghany et al. Spatial microassignment of travel demand with activity trip chains
Ceder et al. Detecting and improving public-transit connectivity with case studies of two world sport events
Wilson et al. Mathematical and simulation techniques for modelling urban train networks
Dashdamirov Improving of interaction of routes at high density stops by adjusting bus arrival time
van Oort et al. Impact of rail terminal design on transit service reliability
Masoud et al. Impact of traffic conditions and carpool lane availability on peer to peer ridesharing demand
Etgar et al. Personal rapid transit capacity evaluation for inner-city: A detailed micro-simulation study

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant