Network PaPs (NetPaPs) are PaPs designated to foster the optimal use of infrastructure capacity and address the needs for capacity in specific geographical relations or of market segments with special requirements in train path characteristics. They may be offered on a single RFC or on two or more connected RFCs. Network PaPs consist of contiguous PaP sections linked together and are identified by a special ID or marker in PaP catalogues and IT tools.
Network PaP is not a new a product, it is only a layer created by RFCs for the PaPs that can contain several PaPs (Fix or Flex) to help in the conflict resolution. RFCs can combine PaPs to be part of a Network PaP after the import when they are in Path Elaboration (PaP) or Published (PaP) phase.
Please find below the summary of the priority calculation and the impact of the Network PaPs.
If no “Network PaP” is involved in the conflicting requests
The priority is calculated according to this formula:
K = (LPAP + LF/O ) x YRD
LPAP = Total requested length of all PaP sections on all involved RFCs included in one request.
LF/O = Total requested the length of the feeder/outflow path(s) included in one request; for the sake of practicality, is assumed to be the distance as the crow flies.
YRD = Number of requested running days for the timetable period. A running day will only be taken into account for the priority calculation if it refers to a date with a published PaP offer for the given section.
K = The rate for priority
All lengths are counted in kilometres.
The method of applying this formula is:
in a first step, the priority value (K) is calculated using only the total requested length of the pre-arranged path (LPAP) multiplied by the Number of requested running days (YRD);
- if the requests cannot be separated in this way, the priority value (K) is calculated using the total length of the complete paths (LPAP + LF/O) multiplied by the number of requested running days (YRD) in order to separate the requests;
- if the requests cannot be separated in this way, a random selection is used to separate the requests. This random selection shall be defined in the CID.
Added to ensure consistency with the other variables.
If a “Network PaP” is involved in at least one of the conflicting requests:
- If the conflict is not on a “Network PaP”, the priority rule described above applies
- If the conflict is on a “Network PaP”, the priority is calculated according to the following formula:
K = (LNetPAP + LOther PAP + LF/O ) x YRD
K = Priority value
LNetPAP = Total requested length (in kilometres) of the PaP defined as “Network PaP” on either RFC included in one request.
LOther PAP = Total requested length (in kilometres) of the PaP (not defined as “Network PaP”) on either RFC included in one request.
LF/O = Total requested the length of the feeder/outflow path(s) included in one request; for the sake of practicality, is assumed to be the distance as the crow flies.
YRD = Number of requested running days for the timetable period. A running day will only be taken into account for the priority calculation if it refers to a date with a published PaP offer for the given section.
The method of applying this formula is:
- in a first step, the priority value (K) is calculated using only the total requested the length of the “Network PaP” (LNetPAP) multiplied by the Number of requested running days (YRD)
- if the requests cannot be separated in this way, the priority value (K) is calculated using the total length of all requested “Network PaP” sections and other PaP sections (LNetPAP + LOther PAP) multiplied by the Number of requested running days (YRD) in order to separate the requests
- if the requests cannot be separated in this way, the priority value (K) is calculated using the total length of the complete paths (LNetPAP + LOther PAP + LF/O) multiplied by the Number of requested running days (YRD) in order to separate the requests
If the requests cannot be separated in this way, a random selection is used to separate the requests. This random selection shall be defined in the CID.
Added to ensure consistency with the other variables.
