EP2402229A1 - Procédé et système pour simuler, planifier et/ou contrôler les procédés de fonctionnement dans un système de transport guidé sur voie - Google Patents

Procédé et système pour simuler, planifier et/ou contrôler les procédés de fonctionnement dans un système de transport guidé sur voie Download PDF

Info

Publication number
EP2402229A1
EP2402229A1 EP10006446A EP10006446A EP2402229A1 EP 2402229 A1 EP2402229 A1 EP 2402229A1 EP 10006446 A EP10006446 A EP 10006446A EP 10006446 A EP10006446 A EP 10006446A EP 2402229 A1 EP2402229 A1 EP 2402229A1
Authority
EP
European Patent Office
Prior art keywords
performer
resources
performers
feasible
route
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.)
Withdrawn
Application number
EP10006446A
Other languages
German (de)
English (en)
Inventor
Ullrich Prof. Dr.-Ing. Martin
Yong Cui
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.)
Universitaet Stuttgart
Original Assignee
Universitaet Stuttgart
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 Universitaet Stuttgart filed Critical Universitaet Stuttgart
Priority to EP10006446A priority Critical patent/EP2402229A1/fr
Publication of EP2402229A1 publication Critical patent/EP2402229A1/fr
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B61—RAILWAYS
    • B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
    • B61L27/10—Operations, e.g. scheduling or time tables
    • B61L27/12—Preparing schedules

Definitions

  • the invention relates to track guided transportation systems in general, and especially to a method and a system for simulating, planning and/or controlling operating processes in a track guided transportation system.
  • deadlock In the field of railway operation, a deadlock is accordingly defined as a situation in which a number of trains cannot continue their path at all, because every train is blocked by another one.
  • the MCA and the Petersen and Taylor algorithm however have the drawback that many solutions of certain operating situations which are not a deadlock are however falsely indicated as deadlocks. These methods therefore are of very limited or no practical use, since too few valid solutions are detected. Furthermore, the DRR, the Petersen and Taylor algorithm and the labeling algorithm can only be employed in simple infrastructure networks and accordingly are of limited or no use for complex infrastructures or operating conditions.
  • an inventive method for simulating, planning and/or controlling operating processes of a track guided transportation system firstly comprises the step of defining resources which represent the transportation system, wherein in particular resources are defined for individual track segments.
  • the track guided transportation system may exemplary be a railway system.
  • Resources may preferably defined for a complete track guided transportation network or only for parts thereof, for instance for a pre-determined area of a network to be observed.
  • the defined resources are associated with respective parameters such as type of track segment, length of track segment and/or connections to other resources.
  • the track guided transportation network under observation may be represented by a graph comprising the defined resources and their interconnections.
  • the method further proposes to define performers which represent transportation vehicles moving into, within and/or out of the transportation system, wherein for each performer at least one associated route with a starting location and a destination location is defined.
  • the routes associated with the respective performers are calculated by applying a route searching algorithm to the graph which represents the track guided transportation network under observation.
  • at least one request from a performer is provided, requesting to occupy at least one resource, and for each of said at least one request a corresponding system state is determined as safe or unsafe, wherein only requests are granted for which a safe state is determined, thereby ensuring deadlock avoidance. Any request for which a corresponding system state is determined as unsafe is denied.
  • not every request for which a corresponding safe system state is determined necessarily is granted, since additional boundary conditions might be provided, like for instance different priorities associated with different requesting performers.
  • Simulating, planning and/or controlling operating processes of a track guided transportation system preferably comprises the step of at least partially automatic dispatching, in particular dispatching in a railway operation control system.
  • a basic idea of the invention is the utilization of the per se known banker's algorithm in the context of simulating, planning and/or controlling a track guided transportation system.
  • the system state preferably is determined utilizing the banker's algorithm.
  • the banker's algorithm is utilized in synchronous simulation of a track guided transportation system or network, wherein simulation results with special advantage are utilized for planning and/or controlling operating processes of the track guided transportation system, and in particular for dispatching purposes.
  • the step of determining the system state comprises the steps of
  • the modifications in particular have the purpose of increasing the solution space for determining a safe system state and accordingly reducing the solution space for determining an unsafe system state. This is possible, since not all unsafe system states determined using the unmodified banker's algorithm lead to a deadlock and hence are so-called false positives.
  • the request of a moving performer which has been moved to the set of feasible performers is granted, although an unsafe system state is determined, if no resource of the destination location of its associated route is requested by any moving performer which has not been moved to the set of feasible performers, or a resource of the destination location of its associated route is requested by a moving performer which has not been moved to the set of feasible performers, but it is occupied by another performer.
  • requests of performers which are not the cause for the determined unsafe system state are granted, and thus the possibility of deadlocks due to an increasing number of such innocent performers being blocked is advantageously reduced.
  • the defined resources typically can be categorized into junction-type and non-junction type resources, wherein a non-junction-type resource in particular represents a track segment which is connectable to only two further track segments, typically one at either end, and wherein a junction-type resource represents a track segment which is connectable to more than two further track segments.
  • the step of determining a system state is repeated after determining an unsafe system state if a feasible track is identifiable for a requesting performer.
  • a track is identified as a feasible track, if the track lies within the route associated with the requesting performer and all resources in the route between the currently occupied resources of the requesting performer and the track are available resources, i.e. are free to enter, the track comprises sufficient resources to hold the requesting performer, and - when the track is occupied by the requesting performer - at least one alternative route exists between the currently occupied resources of the requesting performer and the next junction-type resource behind the track. Available resources again shall identify all resources not occupied by a performer.
  • the feasible track and the requesting performer each are associated with a respective length, wherein the length associated with the feasible track is equal or larger than the length associated with the requesting performer.
  • the feasible track may also comprise more than one track segment, i.e. more than one defined resource, wherein each defined resource preferably is associated with a length, so that the length of the feasible track is the sum of the lengths of the respective resources making up the feasible track.
  • the order in which the performers are selected may also have an influence on the determined system state and may result in a false positive. Therefore according to a third preferred modification of the banker's algorithm with advantage the order in which a performer is selected from the set of moving performers in step e), as described above, is defined such that first all performers are selected, for which the destination location of their respective associated route lies outside the defined resources, second all performers are selected, for which the destination location of their respective associated route comprises resources which represent a dead-end track segment, and third all remaining performers are selected.
  • a fourth preferred modification of the banker's algorithm is based on at least one performer being associated with at least two routes, wherein if an unsafe system state is determined, a moving performer which has not been moved to the set of feasible performers is associated with an alternative route, the system state is determined again and granting and/or denying requests is performed in response to the newly determined system state.
  • the defined resources and their interconnections are represented by a graph and based on that graph routes are determined by utilizing a pre-defined route searching algorithm.
  • the alternative route may then with special advantage be determined by applying said route searching algorithm to a modified graph from which at least one resource within the original route of the moving performer which is neither an available resource or a resource presently occupied by the moving performer is removed. Thereby an alternative route is forced to be calculated which does not comprise the resource which presumably is the cause of the determined unsafe system state.
  • a fifth preferred modification of the banker's algorithm relates to system performance in that the system state is not determined for certain requests.
  • a system state is determined only depending on requests requesting to occupy at least one resource which is not a non-junction type resource.
  • a request requesting to occupy a non-junction type resource is simply granted if the respective resource is an available resource without determining a corresponding system state for such a request.
  • the modifications preferably are only applied when necessary.
  • a maximum waiting time may be defined and if a request has not been granted after said maximum waiting time, the steps for determining the system state are altered, i.e. one or more of the above described modifications of the banker's algorithm are employed.
  • the maximum waiting time may be defined generally, individually for a request, individually for a requesting performer, and/or depending on further parameters such as for instance pre-defined priorities or other user-defined parameters.
  • the described method most preferably allows for performers simultaneously occupying more than one resource and/or for performers dividing into at least two separate performers and/or at least two performers combining into one common performer during the simulation. That way the method may be utilized flexibly for even very complex track guided transportation networks.
  • An inventive system for simulating, planning and/or controlling operating processes of a track guided transportation system is adapted to perform a method as described above.
  • the system is adapted for automated, semi-automated or computer aided steering of operating processes of the track guided transportation system.
  • the system may be provided as a dispatching system adapted for dispatching in an operation control system.
  • a digital storage medium lies within the scope of the invention, which comprises electronically readable control instructions adapted to perform, when executed in at least one computer, a method as described above.
  • Such a synchronous simulation preferably forms the basis for automatic and/or semiautomatic planning, controlling and/or dispatching of the railway system.
  • deadlocks may be produced if there are track sections with bi-directional operations in synchronous simulation.
  • a synchronous simulation to resolve deadlock problems is a necessary feature to prevent simulation failure.
  • a deadlock is defined as a situation in which a number of trains cannot continue their path at all, because every train is blocked by another one.
  • Fig. 1 A simple example of a deadlock situation is shown in Fig. 1 .
  • trains Z1, Z2 and Z3 are going to run along the routes R1, R2 and R3 respectively.
  • the correct sequence of the train movements should be: Z1, Z3 and Z2. If they ran in another order, as shown in the bottom part of Fig. 2 , wherein train Z3 instead of train Z1 gets the chance to reach track G3, then train Z1 is waiting for train Z3 to leave track G3, whereas train Z3 is waiting for train Z1 to leave track G1.
  • train Z1 and train Z3 are blocked by each other and a deadlock situation occurs.
  • COFFMAN conditions There are four necessary conditions, known as COFFMAN conditions, that lead to deadlocks. These are:
  • Deadlock avoidance is achieved by examining the system state dynamically before allocating a resource to a requester. A request is only granted if the system will still keep in a safe state.
  • a safe state means the resources can be allocated to each task in some order without leading to deadlock.
  • the test for system state is also referred to as deadlock-free test. To execute a deadlock-free test, the potential usage of resources typically is known in advance.
  • deadlock avoidance can deal with deadlock problems with high resource utilization.
  • a typical characteristic of deadlock avoidance is that a safe state can ensure the operation being out of deadlocks, however, an unsafe state does not always sufficiently lead to deadlocks.
  • an unsafe state does not always sufficiently lead to deadlocks.
  • the situation called "false positive” may occur: a deadlock-free test result that is read as positive but actually is negative.
  • a false positive test shows evidence of a deadlock when it not actually present.
  • the banker's algorithm is based on the approach of deadlock avoidance.
  • the principle of deadlock avoidance is to grant a request only if that request will not lead the system to an unsafe state.
  • the banker's algorithm is used to test the system state for deadlocks in order to determine whether an infrastructure resource is allowed to be allocated to a requester.
  • the structure of the banker's algorithm fits the simulation model quite well.
  • the money of a banking system i.e. a resource
  • a debtor is mapped to a simulation performer that requests infrastructure resources to the railway operating control system.
  • a loan program i.e. a process, is similar to a simulation movement task.
  • the prediction of the maximal requested resources is easier to be handled in a railway simulation system than in a computer operating system.
  • a movement task always specifies its target, from which the maximum requested infrastructure resources can be predicted via its route. Especially in a dispatching system, the default route and the request resources can be obtained based on the predefined train path in a timetable.
  • a request can be granted if the system will still be in a safe state in case the requested resources are allocated.
  • the banker's algorithm can be regarded as an algorithm to test a system state.
  • Two sets of data structure need to be managed for the banker's algorithm: the processes and the resources.
  • the purpose of the banker's algorithm is to try to allocate resources for each process in some order. If a process, i.e. a movement task, can get all the required resources, it can be regarded as a feasible task.
  • a request can be approved if all the processes are proven as feasible tasks.
  • the processes are the movement tasks. Since a movement task is always related to one simulation performer and a simulation performer can only execute one movement task in a certain point of time, the performer of a movement task is chosen to identify a process.
  • Two performer sets are used to represent two groups of processes, i.e. movement simulation tasks, in the banker's algorithm:
  • the resources in the banker's algorithm are the infrastructure resources of the track guided transportation network. Each resource is initialized with exact one instance.
  • a resource may be defined based on a large section, e.g. a station track section or a line section.
  • a resource in a macroscopic infrastructure model can be initialized with many instances according to its capacity. Supporting a resource type with multiple instances is an important feature of the banker's algorithm.
  • the key to check the system state in the Banker's algorithm is to find a feasible task. If such a feasible task does not exist, the system state is unsafe. Otherwise, even in the case that only one feasible task is found, the feasible task is still able to be completed since it obtains all required resources. More important, the resources blocked by that feasible task will be returned to AR after the simulation task is completed. Therefore, the currently available resources are increased and the other tasks may get more chances to be completed. More feasible tasks are found, more resources are returned. A safe state will be concluded when all the simulation tasks are feasible tasks. The detailed steps of the banker's algorithm are shown in Fig. 1 :
  • a requester p can be sufficiently identified as an irrelevant requester if it satisfies all the following conditions:
  • Identification of irrelevant requesters is a modification of the banker's algorithm providing an improvement.
  • the example 1 is based on the simple network shown in Fig. 2 .
  • the routes of the performers and the requested resources are listed in the following table: Performer Route Requested Resource Z1 G1, W1, G3, W2, G4, out W1 Z2 G2, W1, G3, W2, G5, out W1 Z3 G5, W2, G3, W1, G1, out W2
  • Steps Analysis for the Request of W1 from Z1 Step 1 P1 ⁇ ⁇ Step 2 P0 ⁇ Z1, Z2, Z3 ⁇ Step 3 AR ⁇ G3, W2, G4 ⁇ Step 4-1 Take Z1 from P0 MR ⁇ G1, W1, G3, W2, G4 ⁇ ; OR ⁇ G1, W1 ⁇ All resources in MR are in AR or OR, go to Step 6 Step 6-1 AR ⁇ W1, G3, W2, G4, G1 ⁇ P1 ⁇ Z1 ⁇ ; P0 ⁇ Z2, Z3 ⁇ Step 7-1 P0 is not empty, go to Step 4.
  • Step 4-2 Take Z2 from P0 MR ⁇ G2, W1, G3, W2, G5 ⁇ ; OR ⁇ G2 ⁇ G5 is not in AR or OR, go to Step 5 Step 5-2 Z3 has not been tested, go back to Step 4 Step 4-3 Take Z3 from P0 MR ⁇ G5, W2, G3, W1, G1 ⁇ ; OR ⁇ G5 ⁇ All resources in MR are in AR or OR, go to Step 6 Step 6-3 AR ⁇ W1, G3, W2, G4, G1, G5 ⁇ P1 ⁇ Z1, Z3 ⁇ ; P0 ⁇ Z2 ⁇ Step 7-3 P0 is not empty, go to Step 4.
  • Step 4-4 Take Z2 from P0 MR ⁇ G2, W1, G3, W2, G5 ⁇ ; OR ⁇ G2 ⁇ All resources in MR are in AR or OR, go to Step 6 Step 6-4 AR ⁇ W1, G3, W2, G4, G1, G5, G2 ⁇ P1 ⁇ Z1, Z3, Z2 ⁇ ; P0 ⁇ ⁇ Step 7-4 P0 is Empty, go to Step 8 Step 8 Safe State
  • AR and OR of each performer may vary in Step 3 for different request tests. This is due to the fact that a test is to check the system safe state for a request based on the assumption that the requested resource is allocated to the requester already. Although the requested resource has not been blocked yet, it will be put in OR of the requester instead of in AR.
  • Example 2 Using the banker's algorithm for macroscopic models
  • the banker's algorithm can also be used in a macroscopic model, in which a simulation is carried out without concerning the most detailed infrastructure information.
  • a station section may be abstracted as a node in the network, and a track section links two nodes with each other. An example of such an abstraction is shown in Fig. 3 .
  • All the operations in the network are bidirectional, with 3 abstracted nodes S1, S2 and S3 and 3 links L1, L2 and L3.
  • the trains Z1 and Z3 are running from left to right and the trains Z2, Z4 and Z5 are running from right to left.
  • a node or a link can be regarded as a resource.
  • An important attribute of a node or link is the capacity. It defines the maximum number of performers that can be held in a resource simultaneously. For example, in the station S1, if there are two trains are allowed to stop or pass in the same time, the capacity of the station S1 is 2.
  • the capacities of the resources are listed in the following table: Resource S1 S3 S3 L1 L2 L3 Capacity 2 2 2 1 1 1
  • the banker's algorithm supports a resource type with multiple instances. For executing an analysis of the system safe state for a request, the number of available instances is introduced as an attribute for AR. For instance, the available resource "S1(2)" means that the resource S1 is still available for two trains to stop or pass.
  • AR ⁇ S1(1), L2(1), S3(1) ⁇ Step 4-1 Take Z1 from P0 MR ⁇ S1, L1, S2, L2, S3, L3 ⁇ ; OR ⁇ S1, L1 ⁇ S2, L3 are not in AR or OR, go to Step 5 Step 5-1 Z2, Z3, Z4 and Z5 have not been tested, go back to Step 4 Step 4-2 Take Z2 from P0 MR ⁇ S2, L1, S1 ⁇ ; OR ⁇ S2 ⁇ L1 is not in AR or OR, go to Step 5 Step 5-2 Z3, Z4 and Z5 have not been tested, go back to Step 4 Step 4-3 Take Z3 from P0 MR ⁇ S2, L2, S3, L3 ⁇ ; OR ⁇ S2 ⁇ L3 are not in AR or OR,
  • AR ⁇ S1(1) , L2(1) , S3(1) ⁇ Step 4-1 Take Z1 from P0 MR ⁇ S1, L1, S2, L2, S3, L3 ⁇ ; OR ⁇ S1 ⁇ L1, S2 and L3 are not in AR or OR, go to Step 5 Step 5-1 Z2, Z3, Z4 and Z5 have not been tested, go back to Step 4 Step 4-2 Take Z2 from P0 MR ⁇ S2, L1, S1 ⁇ ; OR ⁇ S2, L1 ⁇ All resources in MR are in AR or OR, go to Step 6 Step 6-2 AR ⁇ S1(1), L2 (1) , S3 (1) , S2 (1) , L1 (1) ⁇ P1 ⁇ Z2 ⁇ ; P0 ⁇ Z3, Z4, Z5, Z1 ⁇
  • Example 2 only demonstrates the basic principle for using the banker's algorithm for a macroscopic network. Since in most cases a microscopic simulation is more suitable than a macroscopic simulation for a dispatching system to operate single train movement, the following described embodiments are based on a microscopic simulation.
  • the banker's algorithm can guarantee a system against deadlocks when the system is in a safe state.
  • a safe state will never lead to a deadlock situation, and a deadlock situation is always related to an unsafe state.
  • not all unsafe states will lead to deadlocks. As long as an unsafe state is identified, the request of the resource will be rejected, and the performer should wait for next chances. If an unsafe state not sufficiently leads to deadlocks, such a stop will decrease the utilization level of infrastructure resources.
  • the main purpose of the inventive improvements of the banker's algorithm is to increase the space of safe states and reduce the possibility of false positives. Therefore, system efficiency and infrastructure utilization level will be improved with specific measures designed for railway operation.
  • the timing to apply the improvement preferably also is carefully designed. Although it is highly depending on the application context, the following principles are most commonly used:
  • the longitudinal principle is more practical than the transversal principle in a large network with not busy traffics, and the transversal principle is easier to be implemented than the longitudinal principle. It is also possible that both of them are integrated together. For example, if the transversal principle is applied in a single processing step, the performer with the highest waiting time due to deadlock will be given the highest priority to apply the improvements.
  • Train Z1 is associated with route R1 and train Z2 is associated with route R2.
  • the routes and requested resources are given in the following table. Performer Route Requested Resource Z1 G1, W1, G2, W2, G4, out W1 Z2 G4, W2, G3, W1, G1, out W2
  • Steps Analysis for the Request of W1 from Z1 Step 1 P1 ⁇ ⁇ Step 2 P0 ⁇ Z1, Z2 ⁇ Step 3 AR ⁇ G2, G3, W2 ⁇ Step 4-1 Take Z1 from P0 MR ⁇ G1, W1, G2, W2, G4 ⁇ ; OR ⁇ G1, W1 ⁇ G4 is not in AR or OR, go to Step 5 Step 5-1 Z2 has not been tested, go back to Step 4 Step 4-2 Take Z2 from P0 MR ⁇ G4, W2, G3, W1, G1 ⁇ ; OR ⁇ G4 ⁇ W1 and G1 are not in AR or OR, go to Step 5 Step 5-2 All performers are tested, go to Step 9 Step 9 Unsafe State
  • the request will be rejected since it will lead to an unsafe state.
  • a key point of the improvement is to identify a feasible track as the new location of the tested requester in future transited state.
  • a feasible track for the tested requester is defined as:
  • the resources in the partial route preferably are reserved as a whole for the tested requester. Additional alternative route searching should be executed for the performers that are supposed to enter the feasible track. Since the feasible track will be blocked by the tested requester, other performers are not able to enter the feasible track. An alternative route that excludes the feasible track is required.
  • the requested resource for train Z1 has been changed to W2, based on the assumption that Z1 passes G1, W1 and occupies G2.
  • the new test is to analyze the situation if G2 is blocked by Z1. In this situation, G1 and W1 will be regarded as available resource, and G2 will be put into the OR of Z1. The whole procedure is illustrated in the following table.
  • Step 4-3 Take Z1 from P0 MR ⁇ G2, W2, G4 ⁇ ; OR ⁇ G2 ⁇ All resources in MR are in AR or OR, go to Step 6 Step 6-3 AR ⁇ G1, W1, G3, W2, G4, G2 ⁇ P1 ⁇ Z2, Z1 ⁇ ; P0 ⁇ ⁇ Step 7-3 P0 is Empty, go to Step 8 Step 8 Safe State
  • the analysis shows that the further allocation of W2 to Z2 with the potential state transition is feasible.
  • the test is only executed for the request of W2 by Z2, the whole route W1 and G2 preferably is reserved for Z1.
  • An analysis can also be carried out for Z1 requesting for W2. The result will show that Z1 should not be allowed to enter W2, and Z1 should wait at G2 until Z2 passes.
  • a state test may unnecessarily lead to an unsafe state when an inappropriate order of processes is used in the test.
  • An improvement is proposed, wherein the space of safe states is increased by executing the state test for processes in a right order.
  • the original P0 includes all the performers Z1, Z2, Z3 and Z4.
  • a performer will be taken from P0 to test the possibility of resource allocation. Assume that Z1 is chosen as the first tested performer. All the required resources in MR ( ⁇ G6, W3, G4, W2, G3 ⁇ ) are in AR ( ⁇ W3, G4, W2, G3, W4 ⁇ ) or OR ( ⁇ G6 ⁇ ). Z1 will be moved from P0 to P1 and its current blocked resources will be returned to AR.
  • Another improvement is proposed for the case that a state test fails with the original scheduled route, while a feasible solution exists when an alternative route is used. This improvement increases the space of safe state with alternative routes.
  • Fig. 9 an example with predefined fixed routes is shown, wherein an unsafe state will be concluded in the system state test.
  • Trains Z1, Z2, Z3 and Z4 are respectively associated with routes R1, R2, R3 and R4.
  • the routes and requested resources are given in the following table. Performer Route Requested Resource Z1 G1, W1, G3, W2, W3, G4, W4, out W1 Z2 G2, W1, G3, W2, G5, out W1 Z3 G5, W2, G3, W1, G1, out W2 Z4 G4, W3, W2, G3, W1, G2, out W3
  • a further important improvement proposed by the invention is to take alternative routes into consideration if a train with alternative routes is in a deadlock situation or causes an unsafe state to be determined.
  • Train routes preferably are determined by certain route searching algorithms.
  • the station-relevant destinations are the scheduled destinations that should be respected in a fixed sequence during route searching processes. Any modification of scheduled destinations should be carefully evaluated during the dispatching and optimization process.
  • the rest of the destinations in the original train route are the relative destinations.
  • the original relative destinations may be excluded when an alternative route is utilized from a scheduled destination to the next scheduled destination.
  • the determination of scheduled destinations starts at first, and alternative routes including a series of relative destinations between every two adjacent, scheduled destinations are searched afterwards.
  • a route with the shortest running time can be searched by some kind of route searching algorithm, for instance using Dijkstra's algorithm as described in ,, A Note on Two Problems in Connexion with Graphs" by E.W. Dijkstra, Numerant Mathematik 1, 1959, No. 1, pages 269-271 .
  • the route with the secondary shortest running time can also be searched with Dijkstra's algorithm in such a way: each time an edge in the shortest route is removed from the whole network, and the optimum solution to this network is searched. Repeating the operation for all the edges, a ranked list of less-than-optimal solutions is generated. The route with the secondary shortest running time can be obtained from the list. This approach requires many times of route searching, and possibly deadlocks still occur when applying the route with the second shortest running time.
  • a more practical solution can be utilized based on the principle of the banker's algorithm.
  • the improvement with alternative routes is applied only if the request cannot pass the first round deadlock-free test with original route.
  • the test must be ended at the Step 9 when all the performers in P0 are not able to get all required resources in MR.
  • the process of the improvement with alternative routes is illustrated in Fig. 10 .
  • a system state test for a request is unnecessarily executed when the result of test does not influence the system state.
  • a further preferred improvement lies in skipping those unnecessary state tests, thereby improving the system performance. Deadlock-free tests are carried out when allocating new requested resources for performers. When the banker's algorithm is applied, the test will go through all the processes to determine the system state. In some cases such a time consuming job can be skipped to gain a higher system performance.
  • infrastructure resources can be defined based on block sections or infrastructure elements, and there are two types of infrastructure resources: junction type resources and non-junction type resources.
  • a deadlock-free test i.e. a system state test, preferably is not carried out for a request of entering a non-junction type resource.

Landscapes

  • Engineering & Computer Science (AREA)
  • Mechanical Engineering (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
EP10006446A 2010-06-22 2010-06-22 Procédé et système pour simuler, planifier et/ou contrôler les procédés de fonctionnement dans un système de transport guidé sur voie Withdrawn EP2402229A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP10006446A EP2402229A1 (fr) 2010-06-22 2010-06-22 Procédé et système pour simuler, planifier et/ou contrôler les procédés de fonctionnement dans un système de transport guidé sur voie

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP10006446A EP2402229A1 (fr) 2010-06-22 2010-06-22 Procédé et système pour simuler, planifier et/ou contrôler les procédés de fonctionnement dans un système de transport guidé sur voie

Publications (1)

Publication Number Publication Date
EP2402229A1 true EP2402229A1 (fr) 2012-01-04

Family

ID=43034404

Family Applications (1)

Application Number Title Priority Date Filing Date
EP10006446A Withdrawn EP2402229A1 (fr) 2010-06-22 2010-06-22 Procédé et système pour simuler, planifier et/ou contrôler les procédés de fonctionnement dans un système de transport guidé sur voie

Country Status (1)

Country Link
EP (1) EP2402229A1 (fr)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103473130A (zh) * 2013-09-23 2013-12-25 扬州大学 一种基于随机进程代数的并发系统死锁检测方法
CN103676664A (zh) * 2013-11-21 2014-03-26 上海申通地铁集团有限公司 轨道车辆门控单元运行模拟系统
WO2013066494A3 (fr) * 2011-11-04 2014-08-28 General Electric Company Système et procédé de planification de réseau de transport
US9003039B2 (en) 2012-11-29 2015-04-07 Thales Canada Inc. Method and apparatus of resource allocation or resource release
EP2821314A3 (fr) * 2013-07-03 2015-07-08 Hitachi Ltd. Système de commande du fonctionnement d'un train, dispositif de simulation d'opération de train et procédé de simulation du fonctionnement d'un train
EP2873586A4 (fr) * 2012-07-13 2016-07-27 Hitachi Ltd Procédé pour sélectionner un itinéraire d'exploitation différent pour un train, et système correspondant
TWI548553B (zh) * 2012-11-15 2016-09-11 Nippon Sharyo Ltd The route determination system for railway vehicles
CN109229155A (zh) * 2018-08-29 2019-01-18 北京交通大学 一种规避列车运行死锁状态的方法及列车运行全局优化控制方法
CN109871993A (zh) * 2019-01-31 2019-06-11 上海天好电子商务股份有限公司 基于银行家算法的政务系统待办功能优化方法及终端
WO2020255492A1 (fr) * 2019-06-18 2020-12-24 三菱重工業株式会社 Dispositif de génération de programme de commande d'itinéraire, procédé de génération de programme de commande d'itinéraire et programme

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4883245A (en) * 1987-07-16 1989-11-28 Erickson Jr Thomas F Transporation system and method of operation
US5828979A (en) * 1994-09-01 1998-10-27 Harris Corporation Automatic train control system and method
EP0911778A2 (fr) * 1997-10-23 1999-04-28 Toyota Jidosha Kabushiki Kaisha Système de contrÔle de la circulation pour véhicule
WO2003097425A1 (fr) * 2002-05-20 2003-11-27 Tmg International Holdings Pty Limited Procede de programmation et systeme de reseau ferroviaire
US20060212188A1 (en) 2003-02-27 2006-09-21 Joel Kickbusch Method and apparatus for automatic selection of alternative routing through congested areas using congestion prediction metrics

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4883245A (en) * 1987-07-16 1989-11-28 Erickson Jr Thomas F Transporation system and method of operation
US5828979A (en) * 1994-09-01 1998-10-27 Harris Corporation Automatic train control system and method
EP0911778A2 (fr) * 1997-10-23 1999-04-28 Toyota Jidosha Kabushiki Kaisha Système de contrÔle de la circulation pour véhicule
WO2003097425A1 (fr) * 2002-05-20 2003-11-27 Tmg International Holdings Pty Limited Procede de programmation et systeme de reseau ferroviaire
US7428452B2 (en) 2002-05-20 2008-09-23 Ausrail Technologies Pty Limited Scheduling method and system for rail networks
US20060212188A1 (en) 2003-02-27 2006-09-21 Joel Kickbusch Method and apparatus for automatic selection of alternative routing through congested areas using congestion prediction metrics

Non-Patent Citations (8)

* Cited by examiner, † Cited by third party
Title
BOBANAC V ET AL: "Routing and scheduling in Multi-AGV systems based on dynamic banker algorithm", CONTROL AND AUTOMATION, 2008 16TH MEDITERRANEAN CONFERENCE ON, IEEE, PISCATAWAY, NJ, USA, 25 June 2008 (2008-06-25), pages 1168 - 1173, XP031308505, ISBN: 978-1-4244-2504-4 *
E.W. DIJKSTRA: "A Note on Two Problems in Connexion with Graphs", NUMERISCHE MATHEMATIK 1, 1959, pages 269 - 271, XP000837527, DOI: doi:10.1007/BF01386390
G. MILLS; P. PUDNEY: "The effects of deadlock avoidance on rail network capacity and performance", PROCEEDINGS OF THE 2003 MATHEMATICS-IN-INDUSTRY STUDY GROUP, 2008, pages 49 - 63
J. PACHL, STEUERLOGIK FUR ZUGLENKANLAGEN ZUM EINSATZ UNTER STOCHASTISCHEN BETRIEBSBEDINGUNGEN, 1993
J. PACHL: "Avoiding Deadlocks in Synchronous Railway Simulations", PROCEEDINGS OF THE 2ND INTERNATIONAL SEMINAR ON RAILWAY OPERATIONS MODELLING AND ANALYSIS, 28 March 2007 (2007-03-28), Retrieved from the Internet <URL:http://www.digibib.tu-bs.de/?docid=00020794>
J. SCHLAICH, BEITRAG ZUR ENTWICKLUNG EINES DISPOSITIONSWERKZEUGS ZUR OPTIMIERUNG BETRIEBSBEDINGTER WARTEZEITEN IM SCHIENENGEBUNDENEN VERKEHR, 2002
PETERSEN; TAYLOR; E.R. PETERSEN; A.J. TAYLER: "Line Block Prevention in Rail Line Dispatch", INFOR JOURNAL, vol. 21, no. 1, 1983, pages 46 - 51
U. MARTIN: "Verfahren zur Bewertung von Zug- und Rangierfahrten bei der Disposition", DISSERTATION, 1995

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013066494A3 (fr) * 2011-11-04 2014-08-28 General Electric Company Système et procédé de planification de réseau de transport
EP2873586A4 (fr) * 2012-07-13 2016-07-27 Hitachi Ltd Procédé pour sélectionner un itinéraire d'exploitation différent pour un train, et système correspondant
TWI548553B (zh) * 2012-11-15 2016-09-11 Nippon Sharyo Ltd The route determination system for railway vehicles
US9003039B2 (en) 2012-11-29 2015-04-07 Thales Canada Inc. Method and apparatus of resource allocation or resource release
EP2821314A3 (fr) * 2013-07-03 2015-07-08 Hitachi Ltd. Système de commande du fonctionnement d'un train, dispositif de simulation d'opération de train et procédé de simulation du fonctionnement d'un train
CN103473130A (zh) * 2013-09-23 2013-12-25 扬州大学 一种基于随机进程代数的并发系统死锁检测方法
CN103473130B (zh) * 2013-09-23 2016-07-06 扬州大学 一种基于随机进程代数的并发系统死锁检测方法
CN103676664A (zh) * 2013-11-21 2014-03-26 上海申通地铁集团有限公司 轨道车辆门控单元运行模拟系统
CN109229155A (zh) * 2018-08-29 2019-01-18 北京交通大学 一种规避列车运行死锁状态的方法及列车运行全局优化控制方法
CN109871993A (zh) * 2019-01-31 2019-06-11 上海天好电子商务股份有限公司 基于银行家算法的政务系统待办功能优化方法及终端
WO2020255492A1 (fr) * 2019-06-18 2020-12-24 三菱重工業株式会社 Dispositif de génération de programme de commande d'itinéraire, procédé de génération de programme de commande d'itinéraire et programme
EP3971053A4 (fr) * 2019-06-18 2022-07-20 Mitsubishi Heavy Industries, Ltd. Dispositif de génération de programme de commande d'itinéraire, procédé de génération de programme de commande d'itinéraire et programme

Similar Documents

Publication Publication Date Title
EP2402229A1 (fr) Procédé et système pour simuler, planifier et/ou contrôler les procédés de fonctionnement dans un système de transport guidé sur voie
Pellegrini et al. RECIFE-MILP: An effective MILP-based heuristic for the real-time railway traffic management problem
CN110009259B (zh) 一种应用于双向路径下柔性制造车间的多agv调度方法
US8392233B2 (en) Rolling stock scheduling apparatus and method
CN107167154A (zh) 一种基于时间代价函数的时间窗路径规划冲突解决方法
CN108364100B (zh) 一种基于动态节点检测的多agv调度方法
CN106997674A (zh) 一种特勤线路交通控制方法和装置
Beaulieu et al. An enumeration algorithm for solving the fleet management problem in underground mines
KR20200059394A (ko) 선로 배분 방법 및 장치
CN118083804B (zh) 基于降低轨道繁忙程度的路径选择方法及装置
Mazzanti et al. Deadlock avoidance in train scheduling: a model checking approach
CN104182283A (zh) 一种任务同步方法
Verhaegh et al. A heuristic for real-time crew rescheduling during small disruptions
JP2006213445A (ja) エレベータの制御方法及びその装置
CN113743679B (zh) 基于赋权图和多旅行商的高铁路网维修调度方法及设备
Khadilkar Scheduling of vehicle movement in resource-constrained transportation networks using a capacity-aware heuristic
KR20230058857A (ko) 다중 작업장 및 작업장 수행 능력 기반의 연속적 생산 계획 전역 최적화 스케줄링 방법 및 장치
Hofman et al. Robustness and recovery in train scheduling-a case study from DSB S-tog a/s
JPH10315102A (ja) 生産ラインの編成方法および編成装置
Cui et al. Searching feasible resources to reduce false-positive situations for resolving deadlocks with the Banker's algorithm in railway simulation
WO2016155790A1 (fr) Procédé destiné à fournir des informations de configuration pour un système comprenant une pluralité d&#39;objets mobiles
CN111950869A (zh) 改进航天测控网调度问题初始解的迭代求解方法及系统
JPH10149347A (ja) 資源割り当て方法及び資源割り当て装置
ZIEGER et al. A simulation framework for the operation of automated small rail vehicles in rural areas
CN117114379B (zh) 一种堆场内多场桥任务调度方法、装置、设备及存储介质

Legal Events

Date Code Title Description
AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME RS

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20120705