METHOD FOR ESTIMATING AT LEAST ONE INDICATOR FOR CHARACTERIZING THE OPERATION OF A PASSENGER TRANSPORT NETWORK AND METHOD FOR CHANGING AT LEAST ONE OPERATIONAL PARAMETER OF THE ASSIGNED TRANSPORT NETWORK

DE602018076692T2Inactive Publication Date: 2024-11-20REVENUE COLLECTION SYST FRANCE SAS
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
DE602018076692
Authority / Receiving Office
DE · DE
Patent Type
Patents
Current Assignee / Owner
Priority Date
2017-02-24
Filing Date
2018-02-23
Publication Date
2024-11-20
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

Current methods for estimating operational indicators in passenger transport networks, such as average waiting times and passenger loads, are either unreliable due to manual sampling or computationally intensive using graph theory, necessitating a more efficient and automated approach to optimize calculation time.

Method used

An iterative algorithm is implemented on chosen paths using recorded input/output data, which optimizes calculation time by determining representative paths and estimating indicators like average waiting times and passenger loads through a programmable device, distributing and optimizing calculations across interconnected workstations.

Benefits of technology

This method significantly reduces calculation time, provides reliable estimates of operational indicators, and allows for dynamic adaptation of transport network parameters based on real-time data, improving network efficiency and passenger experience.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader
Need to check novelty before this filing date? Find Prior Art

Description

[0001] The present invention relates to a method for modifying at least one operating parameter of a transport network, and to a transport network, as well as to an associated computer program.

[0002] The invention lies in the field of passenger transport, in particular urban transport, in the context of an urban metro type railway network.

[0003] Such a passenger transport network is characterized by a set of stations and a set of lines, a line being defined by the set of stations served by a vehicle.

[0004] In addition, such a transport network includes a set of platforms for loading and / or unloading passengers, for example metro platforms.

[0005] Such a network has its own topology, with some stations having several such platforms and being served by several lines of the network.

[0006] In modern transport networks, for example in a metro network, each station is equipped with gates, and each user is provided with a card allowing access to the network and having an associated unique identifier, at least between their entry to the network and their exit. The gates are equipped with sensors adapted to read the data from the card, which is for example equipped with a chip and data communication means. Thus, the transport network is equipped with a system making it possible to record, in connection with an identifier, a time of entry to the network and an associated entry station, as well as an exit time and an associated exit station.

[0007] In operation, the transport network with a given topology has operating parameters, including in particular the frequency of vehicle circulation on each line, which generally varies according to time slots, the type of vehicle used, the load rate.

[0008] In the context of passenger transport networks of this type, it is useful for the network operator to know various indicators characterising the operation of the network, in particular the average waiting time for at least one platform of the network, at various periods (hours of the day, days of the week), or an average load in number of passengers waiting on a platform of the network during these same periods, or the average load of passenger transport vehicles.

[0009] Estimating the operating indicators of a transport network, which is a complex technical system, then makes it possible to improve the operation of the transport network by modifying one or more operating parameters.

[0010] To estimate such indicators of the operation of a transport network, a classic survey method is known, i.e. manual counting of passengers by people who are entrusted with this specific task. This work is carried out punctually in a subset of stations, and provides sampled results which have limited reliability.

[0011] On the other hand, there are also known solutions based on graph theory that involve modeling the transport network. These are complex methods that require long calculation times.

[0012] There is a need to automate and optimize, particularly in terms of calculation time, the calculation of indicators characterizing the operation of transport networks.

[0013] For this purpose, the invention proposes a method for modifying at least one operating parameter of a passenger transport network according to claim 1.

[0014] Advantageously, the method of the invention implements an iterative algorithm on a set of chosen paths and from recorded input / output data, which makes it possible to optimize the calculation time.

[0015] The method for modifying at least one operating parameter of a passenger transport network according to the invention may also have one or more of the characteristics of dependent claims 2 to 5.

[0016] According to another aspect, the invention relates to an information recording medium, on which are stored software instructions for the execution of a method for modifying at least one operating parameter of a passenger transport network as briefly described above, when these instructions are executed by a programmable device.

[0017] According to another aspect, the invention relates to a computer program comprising software instructions which, when implemented by a programmable device, implement a method of modifying at least one operating parameter of a passenger transport network as briefly described above.

[0018] According to another aspect, the invention relates to a passenger transport network comprising a set of stations according to claim 6.

[0019] Other characteristics and advantages of the invention will emerge from the description given below, for information purposes only and in no way limiting, with reference to the appended figures, among which: there figure 1 is a diagram representing the functional blocks of a programmable device capable of implementing the invention; the figure 2 is a diagram illustrating part of a transport network in which the invention is applicable; the figure 3 is a flowchart of the main steps of a process for estimating at least one indicator characterizing the operation of a transport network. figure 4 is a flowchart for determining an indicator characterizing the operation of a transport network; there Figure 5 is a flowchart of the main steps of a method for modifying at least one operating parameter of a transport network according to one embodiment.

[0020] The method of estimating at least one indicator characterizing the operation of a transport network of the invention is implemented by a programmable device, or a set of programmable devices, such as workstations, interconnected to distribute and optimize the calculations.

[0021] The method for modifying at least one operating parameter of a transport network according to the invention is implemented in a transport network as described below.

[0022] There figure 1 illustrates the main blocks of an embodiment of a device capable of implementing the method of estimating at least one indicator characterizing the operation of a passenger transport network according to the invention, and of controlling a modification of an operating parameter of a transport network.

[0023] A programmable device 10 capable of implementing the invention, typically a computer, comprises a screen 12, a means 14 for entering commands from an operator, for example a keyboard, optionally an additional pointing means 16, such as a mouse, making it possible to select graphic elements displayed on the screen 12, a central computing unit 18, or CPU, comprising at least one processor, capable of executing computer program instructions when the device 10 is powered on.

[0024] The device 10 also comprises one or more information storage units 20, for example registers, capable of storing data and executable code instructions allowing the implementation of programs comprising code instructions capable of implementing the method according to the invention. In particular, static information relating to the structure of the transport network is stored in the storage unit 20.

[0025] The various functional blocks of the device 10 described above are connected via a communication bus 22.

[0026] In one embodiment, the central computing unit 18 is capable of implementing: a module 24 for calculating and recording the routes chosen between each pair of stations in the network, a module 26 for obtaining a plurality of input / output data from the transport network during an observation period, a module 28 for determining an indicator characterizing the operation of the network by activating the chosen routes and all of the input / output data, and a module 29 for controlling the modification of at least one operating parameter of the transport network based on the comparison of the estimated indicator with at least one threshold.

[0027] These modules 24, 26, 28, 29 are implemented in the form of computer program instructions, executable by the programmable device. Alternatively, they are implemented by programmable logic components, or in the form of dedicated integrated circuits (or ASICs).

[0028] Details of implementation of the various modules implemented by a programmable device capable of implementing the invention are given below.

[0029] A passenger transport network, for example an urban metro network, comprises a set of stations and a set of lines, a line being defined by the set of stations served by a transport vehicle and a direction of travel.

[0030] There figure 2 , described in more detail below, illustrates part of a transport network R comprising lines L 1 , L 2 and L 3 .

[0031] In addition, such a transport network includes a set of platforms for loading and / or unloading passengers, for example metro platforms or bus stops.

[0032] Such a network has its own topology, with stations generally comprising several such platforms, with some stations being served by several lines of the network.

[0033] In modern transport networks, for example in a metro network, each station is equipped with automatic gates, and each user is provided with a card allowing access to the network and having an associated unique identifier, at least between entering the network and leaving it. The automatic gates are equipped with sensors adapted to read the data from the card, which is for example equipped with a chip and data communication means.

[0034] Thus, the transport network is equipped with a system for recording, in connection with an identifier, a time of entry into the network and an associated entry station, as well as a time of exit from the network and an associated exit station.

[0035] There figure 3 is a flowchart of the main steps in a process for estimating at least one indicator characterizing the operation of a passenger network.

[0036] As input to a first step 30 of calculating and recording selected journeys in the network, a set 32 ​​of static information characterizing the network is used: all the stations in the network, all the platforms, all the lines, as well as the operating schedules, and the average journey times in the absence of an incident.

[0037] The operation of the network, for a given period of time, is characterized by the frequency of vehicles for each line, and by the size or capacity of the vehicles put into circulation. The fluidity of traffic and the possible congestion of the network are dependent both on material operating conditions and on the flow of users.

[0038] Each transport line is defined by a set of stops, and by a direction of travel between the two end stations called termini. Each stop belongs to a station and has an associated loading / unloading platform, depending on the direction of travel of the line.

[0039] For each line, the average journey time between two stops in the absence of an incident is known, as well as the average stopping time at each platform.

[0040] The same loading / unloading platform can possibly be associated with several lines.

[0041] The previously recorded information 32 also includes connection information, as well as average transfer time information, for example for a passenger walking at a given average speed, to change platforms, within the same station or between stations connected by planned passages, in order to make a connection between two lines of the network.

[0042] In addition, a set 34 of additional rules is optionally used, corresponding to advice on using the transport network provided by the network operator to passengers. These include, for example, preferences for connecting between lines or for journeys indicated to passengers, for example, "to reach a destination station B from a departure station A, it is preferable to take line L and change at station C".

[0043] This prior information 32, 34 is provided as input to step 30 of calculating the routes chosen between all the distinct pairs of stations in the network.

[0044] This involves calculating and storing, for each pair (A,B) of stations in the network, one or more routes chosen from all theoretically possible routes.

[0045] A journey between a departure station A and an arrival station B is defined by a set of lines and connections connecting A and B.

[0046] A chosen route is defined as a route that is locally optimal, in particular it does not include a loop. The set of chosen routes is determined so as to be representative of the possible choices for the user,

[0047] As a non-exhaustive schematic example, the figure 2 illustrates two stations A and B, in a partially represented transport network R. The stations of the network are represented by nodes, and the platforms are not represented. Thus, the correspondence between lines involving a change of platform is not represented on the figure 2 .

[0048] Line L 1 connects stations A and B in six stops on a first route.

[0049] There is a first possibility of connection with line L 2, from station C. The journey made from station A, on line L 1 then on line L 2 from the connecting station C is a second journey between A and B and includes 3 stops.

[0050] There is also a possibility of connecting to line L3, from station D, the third journey between A and B in this case totaling 9 stops. A priori, we distinguish 3 different possible journeys between stations A and B. We assume that in the absence of incidents the first journey and the second journey have similar durations, and the third journey is twice as long.

[0051] Step 30 implements an iterative, “tree” type process, described below.

[0052] This method is applied to a graph comprising nodes which are the stations of the transport network, connected by arcs according to the lines of this network. The chosen paths correspond to journeys in the network. For each pair (A,B) of stations or nodes of the graph, the shortest path is calculated by applying any algorithm for searching for the shortest path in a graph, for example the A* algorithm, well known in the field of graph theory.

[0053] Then, on the path defined by the shortest path, for each "choice" to follow this path (starting line and direction, taking or not a possible correspondence), we create a graph, called a child, which is a copy of the original graph from which the edge corresponding to the choice made is removed. We repeat this step on each of the child graphs (and so on) until a certain stopping criterion.

[0054] For example, a stopping criterion based on the theoretical travel time compared to the theoretical travel time of the shortest path of the original graph.

[0055] For example, by taking over the network of the figure 2 , we apply the shortest path search algorithm between A and B on the complete graph. In this example, it is the path ACDB passing through L 1 . For each choice on this path, we create a child graph where this choice is removed. Child graph 0: the stop AC (corresponding to the choice to go in this direction) is removed. It will now be impossible to go from A to B, this branch of the tree stops. Child graph 1: the stop C to D via L 1 is removed (corresponding to the choice to take L 1 and not L 2 ). The shortest path on this graph will be ACB via L 2 between C and B. (then its only child graph will quickly stop being the removed stop AC) Child graph 2: the stop D to B via L 1 is removed (corresponding to the choice to take L 1 and not L 3 ). The shortest path will then be either ACB via L 2 , or ACDB via L 3 . But in both cases the path ACDB via L 3 will be discovered either directly or by a child graph of this child graph 2.

[0056] Among the set of retained paths, identical paths are eliminated.

[0057] Thus, at the end of step 30, for each pair (A, B) of stations, a number greater than or equal to 1 of chosen paths is stored, variable per pair of stations (A, B) and provided automatically by the algorithm implemented during this step 30. The details of each of the paths chosen for a pair (A, B) of stations are stored.

[0058] For example, back to the scenario of the figure 2 , according to one embodiment, the three determined paths, ACDB by line L 1 , ACB by lines L 1 then L 2 and ACDB by L 1 , then L 3 are all stored as chosen paths.

[0059] According to one variant, the chosen routes are calculated over several time slots, and stored in association with the time slot, for example a day time slot and a night time slot, these time slots having an effective impact on the topology of the network, in particular due to the number of lines in operation.

[0060] The stored results are relative to the transport network topology and the static information 32 and 34 provided as input. They are recalculated, for example, in the event of a change in the network topology.

[0061] Alternatively or in addition, the calculation of the chosen and stored routes is re-performed following changes in the operation of the network affecting the network topology.

[0062] The routes chosen for each pair (A, B) of stations are therefore stored, for a given time period of validity, in a memory 20 of the programmable device implementing the invention.

[0063] Furthermore, input / output data from the network 38 are recorded over a given observation period ΔT obs, preferably at least equal to 24 hours, but which may be equal to several days, a week, a month or more.

[0064] The input / output data 38 are systematically recorded in the transport network, in association with an identifier Id, for example a passenger subscription identifier.

[0065] An input data includes an entry station on the network, for example a station A, as well as a date and time of entry into the station, noted TA, in relation to an identifier Id.

[0066] An output data includes an exit station from the network, for example a station B, as well as a date and time of exit from station B, noted TB, in relation to an identifier Id.

[0067] In step 36 of obtaining input / output data relating to the journeys made on the transport network during the observation period ΔT obs , all the recorded input / output data are obtained and sorted by journey.

[0068] Indeed, if the identifiers Id are passenger subscription identifiers, a passenger can make many journeys during a given observation period ΔT obs. It is therefore a question of sorting the data, according to the TA and TB dates and the recorded entry / exit stations to obtain a set of entry / exit data relating to actual journeys.

[0069] An actual journey corresponds to the movement of the same passenger between a departure station A and an arrival station B.

[0070] Then a step 40 is implemented for calculating, by implementing an iterative algorithm, one or more indicators 42 characterizing the operation of the network during at least part of the observation period ΔT obs.

[0071] Step 40 comprises determining, for each input / output data set corresponding to an actual path, determined in step 36, a corresponding path among the chosen paths. Thus, step 40 comprises estimating the paths made in the network during the observation period.

[0072] Indicator 42 is for example equal to an average waiting time for each platform of the network, by elementary time periods dt e , of given duration for example equal to a quarter of an hour. Alternatively, it is possible to calculate the average waiting time over other chosen time periods, by carrying out statistics from the results obtained by elementary periods.

[0073] Elementary periods must be significantly greater than the average vehicle interval during the hours of interest. For example, a quarter-hour elementary period is chosen when the subway interval during rush hours is 2 minutes.

[0074] Alternatively, or in addition, indicator 42 is equal to the average load, in number of passengers, per platform and per elementary time period dt e .

[0075] In fact, from the previously recorded entry / exit data 36, ​​and after calculating the average waiting time for each platform in the network, we can calculate the average number of passengers waiting over the same elementary time period.

[0076] Alternatively or additionally, in a similar manner, one can also estimate the average load, in number of passengers, per transport vehicle during these elementary time periods.

[0077] Alternatively or in addition, the selection rate of the routes among the network possibilities can be estimated. Thus, when several routes are possible between an entry station A and an exit station B, it is possible to calculate, during each elementary time period dt e , what is the effective selection rate of each of the possible variants.

[0078] There figure 4 is a synopsis of the main steps implemented in step 40 of calculating an indicator characterizing the transport network.

[0079] In this embodiment, the calculated indicator is the average waiting time per loading / unloading platform.

[0080] In a first step 50, the waiting times A(Q k , dt e ) per elementary time period dt e at each platform Q k of the network are updated.

[0081] In this embodiment, an elementary period dt e is a time slice defined by a duration, as well as a start and end date, for example February 20, 2017 from 8 a.m. to 8:15 a.m.

[0082] At initialization, waiting times are all initialized to a given value, which is either fixed or calculated based on known network information, for example line timetables.

[0083] According to one embodiment, the waiting times are calculated based on previous results, for example, for the previous month. For example, the waiting times for January have already been calculated, and we now want to calculate them for February. We will initialize the waiting times to the average for January over each elementary period.

[0084] As the algorithm iterates, the waiting times at the current iteration are updated with the waiting time values ​​estimated at the previous iteration.

[0085] Then, for each actual journey TR(A, TA , B, TB ), defined by the entry stations A and exit B, and the respective times of entry TA and exit TB , recorded during the observation period, the actual duration D(TR)=TB -TA is calculated in step 52.

[0086] Knowing the entry stations A and exit B, we extract in step 54 from the memory the set of paths chosen between A and B previously calculated, noted here TR 1 (A,B), TR 2 (A,B)...TR n (A,B).

[0087] Each chosen journey TR j (A,B) can include one or more connections between lines.

[0088] In step 56 of calculating the estimated journey time, TR j (A,B) is calculated for each chosen journey, starting from A, using the pre-recorded static data 32 and taking into consideration the waiting time updated in step 50 at each platform in the event of a connection.

[0089] In one embodiment, the set of interchange platforms includes the loading / unloading platform of the entry station of the journey.

[0090] We obtain an estimated journey time D j (TR j (A,B)).

[0091] Then, in selection step 58, the chosen path TR k is selected which is closest, according to a given criterion, to the actual path.

[0092] For example, the chosen route TR k is the one whose duration D k (TR k (A,B)) is closest, in absolute value, to the actual duration D(TR). k = Arg min j D TR − D j TR j

[0093] If the estimated journey time between two or more journeys is equal, for example, the journey with the fewest connections is selected.

[0094] The time difference between the actual duration D(TR) and the estimated duration Dk(TRk(A,B)) of the selected journey is distributed in step 60 between the waiting times associated with the connecting platforms of the journey TR k (A,B) selected in the selection step 58.

[0095] For example, if the journey TR k (A,B) includes a single connection made on a platform Q m , we store in association with Q m and the elementary period dt e an error equal to: dk = D TR − D k TR k

[0096] If the journey TR k (A,B) includes two connections made respectively on a platform Q m and on a platform O s , we store dk / 2 in association with Q m and dk / 2 in association with Q s .

[0097] Generalizing, if there are p correspondences, we memorize 1 p × dk in association with each matching platform.

[0098] Alternatively, a weighting coefficient am other than 1 / p can be applied to each matching platform Q m, if: ∑ m = 1 p a m = 1

[0099] Thus, in step 60 a fraction, equal to am or 1 / p, of the time difference is assigned dk at each correspondence platform Q m , in relation to the elementary period dt e , so as to refine the estimation of the waiting time on the platform Q m during the elementary period dt e .

[0100] Steps 52 to 60 are performed for all actual recorded journeys defined by entry stations A and exit stations B, and the respective entry times TA and exit times TB.

[0101] Then, in step 62, an aggregation of the stored errors is carried out and a re-evaluation of the waiting times per platform is carried out, followed by a storage of the re-evaluated waiting times.

[0102] Preferably, a “gradient descent” type algorithm is implemented.

[0103] For example, we implement: A i + 1 Q m dt e = A i Q m dt e + α i ∑ u ∈ Ω dk u Q m dt e Avec α i + 1 = a × α i et a < 1

[0104] Where i is the iteration index, α i a weighting factor, has a constant and A i Q m dt e the waiting time calculated on the correspondence platform Q m during dt e .

[0105] In the next step 64, it is verified whether a convergence criterion is satisfied. For example, the difference between the waiting times previously recorded and used in step 56 and the waiting times estimated in the waiting time re-evaluation step 62 is estimated, for each platform and each elementary time period.

[0106] The algorithm stops when the convergence criterion is verified. For example, this convergence criterion is to reach a first given percentage, for example 99%, of the pairs (Q m , dt e ) for which the evolution of the waiting times between two iterations is less than a second given percentage, for example 1%.

[0107] If the convergence criterion is validated, the process ends.

[0108] If the convergence criterion is not validated, the method is iterated. Step 64 is followed by step 50 in which the current waiting times per platform are updated with the waiting times re-evaluated and stored in the re-evaluation step 62.

[0109] Steps 52 to 64 are then iterated until the convergence criterion is validated in step 64.

[0110] After validation of the convergence criterion, a step 66 of calculating an indicator characterizing the transport network is implemented.

[0111] Calculation 66 uses the data stored during the implementation of the iterative process, which are the updated and stored waiting times and / or the routes selected as actual routes.

[0112] Advantageously, the method of the invention is rapid, the number of journeys chosen for each pair of stations being limited, and the estimation of a journey duration per chosen journey being rapid.

[0113] Also, the method of the invention makes it possible to evaluate these indicators characterizing the operation of the network for any time period and for any element of the network.

[0114] Finally, the process is driven by the reality of journey times and not driven by a pre-established model, different for each transport network studied.

[0115] There figure 5is a flowchart of the main steps of a method for modifying at least one operating parameter of a passenger network according to one embodiment of the invention.

[0116] The method comprises a first step 70 of implementing a method for estimating an operating indicator of the transport network as described above.

[0117] The estimate is, for example, based on input / output data collected the day before, or in the preceding week, allowing fine control of the sizing of the network based on operating indicators.

[0118] At the end of this step, for a plurality of time periods, we obtain a first indicator which is an average waiting time per loading / unloading platform, and, optionally, a second load indicator for each platform.

[0119] Then, for each time period considered (step 72), and for each platform of the network (step 74), the estimated average waiting time is compared in step 76 to a predetermined threshold. This threshold can be fixed and constant for all platforms, or be dependent on the platform and / or the time period considered. The thresholds to be used are previously stored.

[0120] If the average waiting time exceeds the threshold in step 76, this step is followed by a step 78 of controlling the modification of an operating parameter of the network, this parameter being for example the frequency of circulation of the transport vehicles serving said platform during the time period considered or a more extended time period encompassing the time period considered. This parameter may be, as a variant or in addition, the load capacity of the transport vehicles serving said platform during the time period considered. For example, it is possible in certain transport networks to provide double-decker transport vehicles instead of vehicles comprising a single deck, or articulated buses instead of single buses, which makes it possible to potentially double the transport capacity and ensure a reduction in the average waiting time.

[0121] Alternatively or in addition, it is possible to divert the flow of passengers to a less congested route.

[0122] If the average waiting time is below the threshold, step 76 is followed by step 74 previously described, or by step 72 when all platforms in the network have been processed.

[0123] Alternatively, two thresholds are used in step 76, a first threshold S min and a second threshold S max . If the average waiting time is less than the first threshold S min , it is deduced that the network is oversized for the time period considered. Consequently, an operating parameter is modified, for example the frequency of circulation of the transport vehicles serving said platform during the time period considered is reduced and / or the load capacity of the transport vehicles is reduced.

[0124] When the average waiting time is greater than the second threshold S max , a network operating parameter is modified as explained above with reference to step 78.

[0125] When the average waiting time is between the two thresholds S min and S max , the network operating parameters are left unchanged.

[0126] Advantageously, the modification method can be implemented on the basis of indicators estimated for example the day before, and therefore dynamically adapt the transport network in relation to the passenger load which can be variable, for example depending on the season or events of variable duration.

[0127] Advantageously, the collection of input / output data is also carried out following the modification of one or more operating parameters of the transport network, and the method of estimating an indicator is implemented, in order to obtain operating indicators updated after the modification of the operating parameters of the network. This makes it possible to validate the improvement in the operation of the network.

Claims

1. - A method for modifying at least one operating parameter of a passenger transport network, the network comprising a set of stations, each station comprising at least one platform for loading and / or unloading passengers in a transport vehicle of the network, the network being equipped with a system for recording, in association with an identifier, entry / exit data of the network, an entry / exit data consisting of an entry station and an associated entry date and time, and an exit station and an associated exit date and time, the system comprising automatic gantries equipped with sensors adapted to read data from a card allowing a user to access the network and having an associated unique identifier, the modification method being implemented by a programmable device, and characterised in that it comprises a first step of implementing a method of estimating at least one indicator characterising the operation of said network, the indicator characterising the operation of said network being an estimated average waiting time per platform of the network, the modification method further comprising the following steps: for each elementary time period and for each platform of the network, comparison of the average waiting time estimated for the given platform with a first predetermined threshold and with a second predetermined threshold, and when the average waiting time estimated for the said given platform is less than the first predetermined threshold or greater than the second predetermined threshold, a command (78) to modify an operating parameter of the transport network from among a traffic frequency or a load capacity of the transport vehicles serving the said platform, the method of estimating at least one indicator characterising the operation of the said network comprising: - a preliminary step (30) of calculating and recording, for each pair of stations in the network, at least one selected path between the two stations in the pair of stations, as a function of static data (32) characterising said transport network; and steps of: - obtaining (36), from input / output data recorded by said passenger network system, input / output data of actual journeys corresponding to actual journeys in the network during an observation period, comprising an entry station and an associated entry date and time, and an exit station and an associated exit date and time; - for each input / output data item, calculation (52) of an actual journey time and selection (58) of a journey between an input station and an output station from among the journeys chosen in association with the pair of stations formed by said input station and said output station; - a calculation (40) of at least one indicator characterising the operation of the network, comprising the calculation of an average waiting time for each platform of the network during one or more elementary time periods by implementing an iterative algorithm implementing, at each iteration: - for each input / output data item, a calculation (60) of a time difference between an estimated duration of the selected journey and the actual duration of the journey; - when the selected journey includes at least one connection via a loading / unloading platform, allocation (60) of a fraction of said time difference to each waiting time associated with a connection platform, - an update (62) of the waiting time per elementary time period for each platform in the network, the method of estimating at least one indicator characterising the operation of said network further comprising, at each iteration, for each actual path input / output data item, a calculation (56) of the estimated path duration for each chosen path associated with the pair of stations formed by said input station and said output station as a function of said updated waiting times and of the static data characterising said transport network, and a re-selection (58), from among said chosen paths, of the path having the estimated path duration closest to the actual path duration.

2. - A method according to claim 1, in which the said fraction of the time difference is a function of a weighting coefficient associated with each loading / unloading platform.

3. - A method according to any one of claims 1 or 2, in which the prior step (30) of calculating, for each pair of stations of the network, at least one path chosen between the two stations of the pair of stations, implements an algorithm for searching for the shortest path in a graph.

4. - A method according to any one of claims 1 to 3, in which the said static data characterising the said transport network comprises all the stations in the network, all the platforms, all the lines, as well as the operating times and average journey times in the absence of an incident.

5. - A method according to any one of claims 1 to 4, in which the average waiting time for each platform of the network during one or more elementary time periods is a first indicator characterising the transport network, and in which the calculation step (40) comprises the calculation of at least one second indicator characterising the operation of the transport network from among: an average load in terms of the number of passengers waiting on a network platform during one or more elementary time periods; an average load, in terms of the number of passengers, per transport vehicle during one or more elementary time periods; a rate of effective selection of routes from among the routes chosen in the previous step.

6. - Passenger transport network comprising a set of stations, each station comprising at least one platform for loading and / or unloading passengers in a transport vehicle of the network, the network being equipped with a system for recording, in association with an identifier, entry / exit data from the network, an entry / exit data consisting of an entry station and an associated entry date and time, and an exit station and an associated exit date and time, the system comprising automatic gantries equipped with sensors adapted to read data from a card enabling a user to access the network and having an associated unique identifier, characterised in that it includes a device for estimating at least one indicator characterising the operation of the said network, the indicator characterising the operation of the said network being an estimated average waiting time per platform of the network, and a module (29) adapted to control, for each elementary time period for which the estimated average waiting time for a given platform is less than a first predetermined threshold or greater than a second predetermined threshold, a modification of an operating parameter of the transport network from among a traffic frequency or a load capacity of the transport vehicles serving said platform, the device for estimating at least one indicator characterising the operation of said passenger transport network, being a programmable device comprising a processor configured to implement: - a module for calculating and recording, for each pair of stations in the network, at least one selected path between the two stations in the pair of stations, as a function of static data (32) characterising said transport network; and: - a module for obtaining, from input / output data recorded by said passenger transport network system, input / output data of actual journeys corresponding to actual journeys in the network during an observation period, comprising an entry station and an associated entry date and time, and an exit station and an associated exit date and time; - a calculation module adapted to: - for each input / output data item, calculate an actual journey time and selecting a journey between an input station and an output station from among the journeys chosen in association with the pair of stations formed by said input station and said output station; - calculate at least one indicator characterising the operation of the network, comprising the calculation of an average waiting time for each platform of the network during one or more elementary time periods by implementing an iterative algorithm implementing, at each iteration: - for each input / output data item, a calculation of a time difference between an estimated duration of the selected journey and the actual duration of the journey; - when the selected journey includes at least one connection via a loading / unloading platform, allocation of a fraction of said time difference to each waiting time associated with a connection platform, - an update of the waiting time per elementary time period for each platform in the network, - calculate, at each iteration, for each actual journey input / output data item, an estimated journey duration for each chosen journey associated with the pair of stations formed by said input station and said output station according to said updated waiting times and static data characterising said transport network, and re-selecting, from among said chosen paths, a path having the estimated path duration closest to the actual path duration.

7. - A computer program comprising software instructions which, when implemented by a 35 programmable device, implement a method of modifying at least one operating parameter of a passenger transport network in accordance with claims 1 to 5.

8. - Information recording medium, characterised in that it comprises software instructions for executing a method of modifying at least one operating parameter of a passenger transport network in accordance with claims 1 to 5, when these instructions are executed by a programmable device.