{"title":"城市环境中道路疏散的最佳方案","authors":"Mickael Bestard, Emmanuel Franck, Laurent Navoret, Yannick Privat","doi":"10.1007/s00033-024-02278-9","DOIUrl":null,"url":null,"abstract":"<p>How to free a road from vehicle traffic as efficiently as possible and in a given time, in order to allow for example the passage of emergency vehicles? We are interested in this question which we reformulate as an optimal control problem. We consider a macroscopic road traffic model on networks, semi-discretized in space and decide to give ourselves the possibility to control the flow at junctions. Our target is to smooth the traffic along a given path within a fixed time. A parsimony constraint is imposed on the controls, in order to ensure that the optimal strategies are feasible in practice. We perform an analysis of the resulting optimal control problem, proving the existence of an optimal control and deriving optimality conditions, which we rewrite as a single functional equation. We then use this formulation to derive a new mixed algorithm interpreting it as a mix between two methods: a descent method combined with a fixed point method allowing global perturbations. We verify with numerical experiments the efficiency of this method on examples of graphs, first simple, then more complex. We highlight the efficiency of our approach by comparing it to standard methods. We propose an open source code implementing this approach in the Julia language.</p>","PeriodicalId":501481,"journal":{"name":"Zeitschrift für angewandte Mathematik und Physik","volume":"38 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal scenario for road evacuation in an urban environment\",\"authors\":\"Mickael Bestard, Emmanuel Franck, Laurent Navoret, Yannick Privat\",\"doi\":\"10.1007/s00033-024-02278-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>How to free a road from vehicle traffic as efficiently as possible and in a given time, in order to allow for example the passage of emergency vehicles? We are interested in this question which we reformulate as an optimal control problem. We consider a macroscopic road traffic model on networks, semi-discretized in space and decide to give ourselves the possibility to control the flow at junctions. Our target is to smooth the traffic along a given path within a fixed time. A parsimony constraint is imposed on the controls, in order to ensure that the optimal strategies are feasible in practice. We perform an analysis of the resulting optimal control problem, proving the existence of an optimal control and deriving optimality conditions, which we rewrite as a single functional equation. We then use this formulation to derive a new mixed algorithm interpreting it as a mix between two methods: a descent method combined with a fixed point method allowing global perturbations. We verify with numerical experiments the efficiency of this method on examples of graphs, first simple, then more complex. We highlight the efficiency of our approach by comparing it to standard methods. We propose an open source code implementing this approach in the Julia language.</p>\",\"PeriodicalId\":501481,\"journal\":{\"name\":\"Zeitschrift für angewandte Mathematik und Physik\",\"volume\":\"38 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Zeitschrift für angewandte Mathematik und Physik\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s00033-024-02278-9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Zeitschrift für angewandte Mathematik und Physik","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00033-024-02278-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
如何在给定时间内尽可能有效地使道路摆脱车辆通行,以便让紧急车辆等通过?我们对这个问题很感兴趣,并将其重新表述为一个最优控制问题。我们考虑了网络上的宏观道路交通模型,在空间上进行了半离散化处理,并决定为自己提供在路口控制车流的可能性。我们的目标是在固定时间内使给定路径上的交通顺畅。为了确保最优策略在实践中是可行的,我们对控制施加了简约约束。我们对由此产生的最优控制问题进行了分析,证明了最优控制的存在,并推导出最优性条件,将其重写为一个函数方程。然后,我们利用这一公式推导出一种新的混合算法,将其解释为两种方法的混合:一种是下降法,另一种是允许全局扰动的定点法。我们通过数值实验验证了这种方法在图形示例上的效率,先是简单的,然后是更复杂的。通过与标准方法的比较,我们强调了我们方法的效率。我们提出了用 Julia 语言实现这种方法的开放源代码。
Optimal scenario for road evacuation in an urban environment
How to free a road from vehicle traffic as efficiently as possible and in a given time, in order to allow for example the passage of emergency vehicles? We are interested in this question which we reformulate as an optimal control problem. We consider a macroscopic road traffic model on networks, semi-discretized in space and decide to give ourselves the possibility to control the flow at junctions. Our target is to smooth the traffic along a given path within a fixed time. A parsimony constraint is imposed on the controls, in order to ensure that the optimal strategies are feasible in practice. We perform an analysis of the resulting optimal control problem, proving the existence of an optimal control and deriving optimality conditions, which we rewrite as a single functional equation. We then use this formulation to derive a new mixed algorithm interpreting it as a mix between two methods: a descent method combined with a fixed point method allowing global perturbations. We verify with numerical experiments the efficiency of this method on examples of graphs, first simple, then more complex. We highlight the efficiency of our approach by comparing it to standard methods. We propose an open source code implementing this approach in the Julia language.