WO2014003321A1 - Procédé d'attribution de trafic basé sur des points de départ utilisant une trajectoire la plus courte - Google Patents

Procédé d'attribution de trafic basé sur des points de départ utilisant une trajectoire la plus courte Download PDF

Info

Publication number
WO2014003321A1
WO2014003321A1 PCT/KR2013/004640 KR2013004640W WO2014003321A1 WO 2014003321 A1 WO2014003321 A1 WO 2014003321A1 KR 2013004640 W KR2013004640 W KR 2013004640W WO 2014003321 A1 WO2014003321 A1 WO 2014003321A1
Authority
WO
WIPO (PCT)
Prior art keywords
bush
path
network
traffic
maximum
Prior art date
Application number
PCT/KR2013/004640
Other languages
English (en)
Korean (ko)
Inventor
조중래
Original Assignee
명지대학교 산학협력단
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 명지대학교 산학협력단 filed Critical 명지대학교 산학협력단
Publication of WO2014003321A1 publication Critical patent/WO2014003321A1/fr

Links

Images

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
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • 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"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman 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
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/065—Traffic control systems for road vehicles by counting the vehicles in a section of the road or in a parking area, i.e. comparing incoming count with outgoing count
    • 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

Definitions

  • the present invention relates to a starting point-based traffic assignment method using the shortest route. More particularly, the present invention relates to a road and surrounding road as a new road is newly expanded or expanded by using a road planning field to predict how the vehicle will pass on the actual road. The present invention relates to a method of assigning traffic for the starting point period using the shortest path for analyzing traffic conditions.
  • the Frank-wolf algorithm is a technique introduced in the 1960s and is used in most traffic S / Ws to find the optimal solution in nonlinear programming.
  • the accuracy is inferior, and the path-based algorithm is the current level of computer memory.
  • the Origin-Based algorithm has 2-3 times more precision than the Frank-Wolf, and it is installed in the recent traffic S / W but traffic demand increases. As a result, the execution time increases rapidly.
  • the present invention was created to solve the above-mentioned problems, the starting point-based traffic assignment method using the shortest path to significantly improve the accuracy of the analysis results to ensure the reliability of analysis results and to shorten the analysis time to increase the efficiency of transportation work
  • the purpose is to provide.
  • a starting point-based traffic assignment method using the shortest path includes (a) a control point of the starting point-based traffic assignment server using the shortest path for all paths stored in the basic network DB of the database unit.
  • Reading a model point connecting a starting point and an arrival point from a basic network (b) generating a bush network by extracting only a route from the basic network to an arrival point where traffic demand exists based on a starting point in the basic network; (c) transitioning from a Bush network composed of a link list to a branch network composed of only nodes that are classified and joined in the Bush network; (d) a maximum and minimum path searching unit searching for a short path (min-path) and a long path length (max-path) in the branch network; (e) assigning the traffic volume so that the traffic transition unit has the same travel time on the minimum path and the maximum path; (f) determining whether the control unit 120 reaches a balance point at which the minimum and maximum path travel times are the same as the traffic volume transition in step (e); And (g) in step (f) above, when the minimum and maximum path travel times reach the same balance point, the control unit searches for (d) step and traffic volume to search for the minimum and maximum path to maintain the balance point. And repeatedly performing the
  • the starting point-based traffic assignment method using the shortest route according to the present invention has the effect of significantly reducing the time required for searching, compared to the prior art, and thus, a considerable time in carrying out related tasks in the field of traffic planning. It has the effect of increasing work efficiency by shortening the time.
  • FIG. 1 is a block diagram of a server for providing a starting point-based traffic assignment method using the shortest path according to the present invention
  • Figure 2 is a term explanatory diagram for explaining the assignment method based on the starting point using the shortest path according to the present invention
  • 3 is an algorithm of a starting point-based traffic assignment method using the shortest path according to the present invention.
  • 5 is another sub-algorithm of the starting point-based traffic assignment method using the shortest path according to the present invention.
  • 1 is a server block for providing a starting point-based traffic assignment method using the shortest path according to the present invention.
  • a traffic assignment server based on a starting point using the shortest path includes a bush network generation unit 110, a control unit 120, a bush update unit 130, and a bush-branch transition unit 140. And a maximum and minimum route search unit 150, a traffic transition unit 160, and a database unit 170.
  • the basic network is a term generally representing a road network, as shown in FIG.
  • the bush network is a sub network of a path that can reach a plurality of destinations based on one starting point as shown in (b) of FIG. 2, and the branch network is a single network as shown in (c) of FIG. 2.
  • It is a Sketch network made up of only nodes that are classified and joined in Bush.
  • the bush network generation unit 110 searches for the shortest path between the terminal points in demand, and adds the bush network to the bush by adding a link on the path connecting all the terminal points with traffic demands from one starting point. Create
  • the bush update unit 130 first removes the link in the bush without traffic and then searches for the shortest path between new model points and updates by adding a link on the path to the bush when a new path exists.
  • the bush generated by the bush network generation unit 110 increases the size of the network as it stores all the links on the path, and accordingly increases the search time of the maximum and minimum paths in the memory and the bush.
  • the Bush-Branch transition unit 140 transfers to the branch network of the tree reconstructed by only the points that are sorted or joined in the tree structure Bush to prevent the increase in the specific gravity of the memory and shorten the search time.
  • the Bush-Branch transition unit 140 is described as transferring the Bush to the branch, the branch may be transferred back to the Bush.
  • the maximum and minimum path search unit 150 searches for a minimum path (min-path) having a short passage time and a maximum path (max-path) having a long passage time in the branch generated by the branch transition unit 140.
  • the traffic volume transfer unit 160 moves the traffic volume so that the travel time on the two paths are the same, more specifically, the travel time on the path is an increase function for the traffic volume, and passes the traffic volume of the maximum path with a long path travel time. By moving to the shortest time path, the minimum and maximum paths are equal.
  • the traffic transition unit 160 transfers the traffic volume in two or more paths on the Bush network as described above so that the vehicle moving in each path may take the same travel time.
  • control unit 120 is moved by the traffic volume transfer unit 160, the traffic volume of the maximum path with a long path passage time is moved to the minimum path with a short passage time, the passage time of the minimum path and the maximum path is equal to the balance point. Determine if you have reached it.
  • the database unit 170 is a basic network DB 171 in which information on a road network basic network is generally stored, as shown in FIG.
  • the Bush network DB 172 storing the Bush network, which is a sub network of a path that can reach a plurality of destinations based on one starting point, is classified in one Bush, It includes Branch Network DB 173, which is a sketch network made up of only joining nodes.
  • 3 is an algorithm of a starting point-based traffic assignment method using the shortest path according to the present invention.
  • node used in an embodiment of the present invention means an intersection, a road confluence point, an intersection point of an intersection and a road
  • link used in an embodiment of the present invention connects a node and a node.
  • Road that is, a road between an intersection and an intersection, a road between a road junction and a road junction, and a road between an intersection and a road junction.
  • control unit 120 performs a step of reading the model point from the basic network DB 161 in which all the path networks of the specific region including the node and the link are stored (S10).
  • step (S10) the control unit 120 reads all paths connecting the starting point (O: Origin), which is a starting point, and the ending point (D: Destination), which is a starting point, for the passenger to perform his or her activities.
  • the Bush network generator 110 extracts only a route from the basic network to an arrival point where traffic demand exists based on the starting point, and configures a bush network as shown in Table 1 below.
  • a new path according to the change exists, adding the path to create a bush network (S20).
  • Step 0 Search Minpath-Search for the best path for a single starting point.
  • Step 1 Add to Initial Bush-Extract the route to all destinations and add the link on the route to the Bush list-Add traffic demand between one model point to the link traffic on the route
  • Step 2 Ordering-Bush only link list Have.
  • the maximum and minimum path searching unit 140 searches for an optimal path for each starting point.
  • the bush network generating unit 110 extracts a path from the starting point to all the arrival points and adds a link on the path to the bush list (S22), and one model point (S23) adding the traffic demand between the departure point and the arrival point to the link traffic on the route, and ordering to create a bush network by giving a network concept through the link between the link lists added to the bush list.
  • Step S24 is performed.
  • FIG. 4 is a sub-algorithm of a starting point based traffic assignment method using the shortest path according to the present invention.
  • the Bush-Branch transition unit 140 performs a step of transitioning to a branch network made up of only nodes that are classified and joined in a Bush network composed of only a link list as shown in Table 2 below (S30).
  • Transitioning to the branch network is that the size of the network increases as the bush network generated by the bush network generation unit 110 stores all the links on the path, and accordingly, searching for the minimum path and the maximum path in the memory and bush. This is to reduce the memory capacity and shorten the search time because the time increases.
  • the maximum and minimum path search unit 150 has a short path time and a long travel time in the branch network transitioned from the Bush network by the branch transition unit 140 as shown in [Table 3].
  • the search for the maximum path (max-path) is performed (S40).
  • the traffic transition unit 160 performs a step of moving the traffic volume so that the travel time on the two paths (the minimum path and the maximum path) is the same.
  • the passage time on the route is an increase function for the traffic volume, and the minimum route and the maximum route are the same by moving the traffic volume of the maximum route with a long route passage time to the minimum route with a short passage time.
  • a traffic transition step is performed (S50).
  • step 'S50' the traffic transition unit 160 is divided into a minimum path and a maximum path in the Bush network. Use the derivative value.
  • control unit 120 performs a step of determining whether a balance point at which the passage time of the minimum route and the maximum route reaches the same as the traffic volume transition (S60).
  • the control unit 120 has a minimum path (min-path) with a short travel time by the maximum and minimum path search unit 150. Searching for the maximum path (max-path) having a long travel time (S40) and repeatedly performing the traffic transition step (S50) such that the minimum path and the maximum path by the traffic transition unit 160 are the same. Ensure that the current equilibrium point is maintained between the minimum and maximum travel times.
  • the bush update unit 130 deletes the element that prevents the balance point from being reached and updates the bush network at step S70.
  • the controller 120 determines whether the network has reached the balance point (S80), and when the balance point is reached, re-performs the step S40 after searching for the minimum path and the maximum path, and does not achieve the network balance point. If not, the allocation method algorithm ends.
  • step S70 of deleting an element that prevents reaching the balance point and updating the bush network will be described in detail with reference to FIG. 5.
  • FIG. 5 is another sub-algorithm of the starting point-based traffic assignment method using the shortest path according to the present invention.
  • the control unit 120 When the traffic transition step (S50) is completed, as shown in [Table 5], the control unit 120 there is a case where the traffic amount is close to zero in a particular branch, in this case the maximum and minimum Since it affects the path search, the step of deleting the zero branch is performed (S71).
  • Table 5 -Step 1 calculate inbound volume-Step 2: check zero branch-Whether the inbound volume is below a certain value (1.0 * 10-15) close to 0-Step 3: delete branch-Delete branch information and branch volume information
  • step S71 the branch network from which the zero branch is deleted is reversed from the step S30, and the branch network including nodes in which the Bush-Branch transition unit 140 is classified and joined as shown in [Table 6] is linked. Transition to the bush network consisting of (S72).
  • the control unit 120 checks whether a link on the new route exists in the Bush network, and if the link is not included in the Bush network, the traffic volume is transferred to the Bush network transitioned in step S72 in step S50. In step S73, a new optimal path in the changed traffic situation is added to the bush list and updated.
  • the Bush network generation unit 110 assigns a network concept to a Bush list in which a cycle exists as shown in [Table 7] through a link between link lists added to the Bush list to establish a Bush network.
  • the ordering (Ordering) step and searching for and removing a path that repeats a specific location on the path that causes the cycle, that is, the path connecting the terminal point, and performs the step of generating a bush network (S74).
  • Step 0 Search Minpath Step 1: Add to Bush Step 1-1: Check if a link on the new path exists in Bush Step 1-2: Add to Bush list if it is not included in Bush Step 2: OrderingWithCycle-cycle This technique is to complete the cycle after performing ordering on the existing bush, searching for and removing the link that causes the cycle.
  • the Bush-Branch transition unit 140 performs a step of transitioning to a branch network which is generated only in a node network which is generated in step S74 and classified and joined in a bush network composed only of a link list (S75).
  • the bush update unit 130 deletes the variable that prevents the bush network from reaching the balance point, and when the bush network is updated, the minimum path and the maximum path are searched by the maximum and minimum path search unit 150. The 'S40' step is performed again.

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Tourism & Hospitality (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Theoretical Computer Science (AREA)
  • General Business, Economics & Management (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention porte sur un procédé d'attribution de trafic basé sur des points de départ, lequel procédé utilise la trajectoire la plus courte qui prévoit la quantité d'automobiles qui passent effectivement sur une route, et qui est ensuite utilisée dans le domaine de la planification routière afin d'analyser les conditions de trafic d'une route correspondante et de routes voisines quand la route est nouvellement construite ou prolongée. Le procédé a pour effet de réduire considérablement le temps nécessaire à une recherche et d'accroître une efficacité de travail en raccourcissant le temps considérable consacré à la réalisation d'un travail associé dans le domaine de la planification de trafic.
PCT/KR2013/004640 2012-06-27 2013-05-28 Procédé d'attribution de trafic basé sur des points de départ utilisant une trajectoire la plus courte WO2014003321A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR10-2012-0068894 2012-06-27
KR1020120068894A KR101347603B1 (ko) 2012-06-27 2012-06-27 최단경로를 이용한 출발점 기반의 통행 배정방법

Publications (1)

Publication Number Publication Date
WO2014003321A1 true WO2014003321A1 (fr) 2014-01-03

Family

ID=49783418

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2013/004640 WO2014003321A1 (fr) 2012-06-27 2013-05-28 Procédé d'attribution de trafic basé sur des points de départ utilisant une trajectoire la plus courte

Country Status (2)

Country Link
KR (1) KR101347603B1 (fr)
WO (1) WO2014003321A1 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104821082A (zh) * 2015-04-29 2015-08-05 电子科技大学 一种基于综合评价的短时交通流预测方法
CN107844848A (zh) * 2016-09-20 2018-03-27 中国移动通信集团湖北有限公司 一种区域人流量预测方法及系统
CN109348404A (zh) * 2018-10-09 2019-02-15 上海世脉信息科技有限公司 一种大数据环境下个体出行道路轨迹提取的方法
CN110147971A (zh) * 2019-04-08 2019-08-20 合肥工业大学 用于规划车辆路径的方法、系统及存储介质
CN113487871A (zh) * 2021-08-13 2021-10-08 同济大学 基于网络集计策略的快速交通分配方法、装置及存储介质
CN117576913A (zh) * 2024-01-12 2024-02-20 中交第二公路勘察设计研究院有限公司 基于网络平衡的多车道公路交织区交通分配方法及装置

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108681788B (zh) * 2018-04-27 2021-09-21 东南大学 一种基于主动安全的城市离散交通网络设计方法
CN108898851B (zh) * 2018-06-20 2020-11-27 东南大学 城市道路断面交通量组合预测方法
CN112581752A (zh) * 2019-12-30 2021-03-30 西安金路交通工程科技发展有限责任公司 区域路网交通协调的控制主动干预方法及其系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100405201B1 (ko) * 2001-08-11 2003-11-12 명지대학교 기종점 기반 대규모 가로망 교통류 분석 방법
JP2009093667A (ja) * 2008-11-17 2009-04-30 Japan Tobacco Inc コース作成システムおよびコース作成方法
KR20100085426A (ko) * 2009-01-20 2010-07-29 엘지전자 주식회사 교통정보 예측장치 및 예측방법
KR20100137672A (ko) * 2009-06-23 2010-12-31 주식회사 동해종합기술공사 균형통행배정방법

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100405201B1 (ko) * 2001-08-11 2003-11-12 명지대학교 기종점 기반 대규모 가로망 교통류 분석 방법
JP2009093667A (ja) * 2008-11-17 2009-04-30 Japan Tobacco Inc コース作成システムおよびコース作成方法
KR20100085426A (ko) * 2009-01-20 2010-07-29 엘지전자 주식회사 교통정보 예측장치 및 예측방법
KR20100137672A (ko) * 2009-06-23 2010-12-31 주식회사 동해종합기술공사 균형통행배정방법

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104821082A (zh) * 2015-04-29 2015-08-05 电子科技大学 一种基于综合评价的短时交通流预测方法
CN107844848A (zh) * 2016-09-20 2018-03-27 中国移动通信集团湖北有限公司 一种区域人流量预测方法及系统
CN107844848B (zh) * 2016-09-20 2020-12-29 中国移动通信集团湖北有限公司 一种区域人流量预测方法及系统
CN109348404A (zh) * 2018-10-09 2019-02-15 上海世脉信息科技有限公司 一种大数据环境下个体出行道路轨迹提取的方法
CN109348404B (zh) * 2018-10-09 2020-10-09 上海世脉信息科技有限公司 一种大数据环境下个体出行道路轨迹提取的方法
CN110147971A (zh) * 2019-04-08 2019-08-20 合肥工业大学 用于规划车辆路径的方法、系统及存储介质
CN113487871A (zh) * 2021-08-13 2021-10-08 同济大学 基于网络集计策略的快速交通分配方法、装置及存储介质
CN113487871B (zh) * 2021-08-13 2022-08-09 同济大学 基于网络集计策略的快速交通分配方法、装置及存储介质
CN117576913A (zh) * 2024-01-12 2024-02-20 中交第二公路勘察设计研究院有限公司 基于网络平衡的多车道公路交织区交通分配方法及装置

Also Published As

Publication number Publication date
KR101347603B1 (ko) 2014-01-07

Similar Documents

Publication Publication Date Title
WO2014003321A1 (fr) Procédé d'attribution de trafic basé sur des points de départ utilisant une trajectoire la plus courte
Frank et al. Optimal design of centralized computer networks
CN105191215A (zh) 双向服务链的数据平面学习
Pierre et al. Topological design of computer communication networks using simulated annealing
CN105141524B (zh) 一种带约束条件的拓扑图最优路径算法
CN103259718B (zh) 一种流表转换方法和装置
ATE364276T1 (de) Dynamische wegeleitung in einem paketvermittelden mehrschichtigen kommunikationsnetzwerk
CN101361306A (zh) 光网络中最优化动态选路
CN106533966A (zh) 一种网络服务的资源编排方法及装置
KR970068300A (ko) 네트워크관리방법과 그 장치 및 네트워크시스템
CN114844812B (zh) 一种面向主动网络遥感的低时延低开销路径部署方法
CN114827002B (zh) 多域网络安全路径计算方法、系统、设备、介质及终端
CN109327410A (zh) 一种基于fpga交叉的改进三级clos路由算法
CN106878170A (zh) 一种转发路径确定方法和装置
CN107689884A (zh) 一种电力通信半实物网络规划仿真的方法
US7327685B2 (en) Apparatus for implementation of adaptive routing in packet switched networks
Duong et al. Efficient make before break capacity defragmentation
CN108494597A (zh) 智能光网络仿真系统及方法
CN115297048B (zh) 一种基于光纤网络的路由路径生成方法及装置
Mewanou et al. Dynamic routing algorithms in all-optical networks
CN1156112C (zh) 波分复用光网络模拟方法
Ho et al. Spare capacity allocation for WDM mesh networks with partial wavelength conversion capacity
JP2013062628A (ja) パス再配置方法及び装置
JP5898112B2 (ja) ネットワーク設計装置およびネットワーク設計プログラム
JP4315386B2 (ja) 最小経路計算方法、その装置及びこれを用いた通信ネットワーク

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13809145

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13809145

Country of ref document: EP

Kind code of ref document: A1