论文标题
通过数学程序和平衡限制的数学程序中的混合空中运输网络中的Vertiport选择
Vertiport Selection in Hybrid Air-Ground Transportation Networks via Mathematical Programs with Equilibrium Constraints
论文作者
论文摘要
城市空气流动性是一个促进城市地区航空运输方式的概念。在这些地区，佛提比特人的位置和容量 - 旅行者上车和下船飞机 - 不仅会影响飞机的飞行延误，而且还可以通过产生额外的地面旅行需求来加剧地面车辆的拥挤。我们介绍了一个数学模型，以选择Vertiports的位置和容量，以最大程度地减少混合空气地面运输网络中的交通拥堵。我们的模型基于具有双线性平衡约束的数学程序。此外，我们通过求解混合整数线性程序来展示如何计算该数学程序的全局最佳解决方案。我们通过Anaheim运输网络模型展示了我们的结果，该模型包含400多个节点和900个链接。
Urban air mobility is a concept that promotes aerial modes of transport in urban areas. In these areas, the location and capacity of the vertiports--where the travelers embark and disembark the aircraft--not only affect the flight delays of the aircraft, but can also aggravate the congestion of ground vehicles by creating extra ground travel demands. We introduce a mathematical model for selecting the location and capacity of the vertiports that minimizes the traffic congestion in hybrid air-ground transportation networks. Our model is based on a mathematical program with bilinear equilibrium constraints. Furthermore, we show how to compute a global optimal solution of this mathematical program by solving a mixed integer linear program. We demonstrate our results via the Anaheim transportation network model, which contains more than 400 nodes and 900 links.
