首页> 外文期刊>Conference Papers in Science >Solving a Signalized Traffic Intersection Problem with NLP Solvers
【24h】

Solving a Signalized Traffic Intersection Problem with NLP Solvers

机译:使用NLP解算器解决信号交叉口问题

获取原文
           

摘要

Mathematical Programs with Complementarity Constraints (MPCC) finds many applications in areas such as engineering design, economic equilibrium, and mathematical theory itself. In this work, weconsider a queuing system model resulting from a single signalized traffic intersection regulated by pretimed control in an urban traffic network. The model is formulated as an MPCC problem and may be used to ascertain the optimal cycle and the green split allocation. This MPCC problem is also formulated as its NLP equivalent reformulation. The goal of this work is to solve the problem, using both MPCC and NLP formulations, minimizing two objective functions: the average queue length over all queues and the average waiting time over the worst queue. The problem was codified in AMPL and solved using some optimization software packages.
机译:具有互补性约束的数学程序(MPCC)在工程设计,经济平衡和数学理论本身等领域中找到了许多应用。在这项工作中,我们考虑了一个排队系统模型,该模型是由单个交通信号交叉口产生的,该交叉路口由城市交通网络中的预先控制控制。该模型被公式化为MPCC问题,可用于确定最佳周期和绿色分割分配。这个MPCC问题也被表述为其等效的NLP。这项工作的目的是使用MPCC和NLP公式来解决问题,以最小化两个目标函数:所有队列的平均队列长度和最差队列的平均等待时间。该问题已在AMPL中整理,并使用一些优化软件包解决了。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号