
科学技术与工程

中国技术经济学会
基于遗传-禁忌搜索算法绿色低碳停机位分配
Green and Low Carbon Gate Assignment Based on Genetic-Tabu Search Algorithm
随着环境气候问题日益严峻,绿色低碳已成为航空运输业可持续发展的重要原则。以单跑道运输机场为研究对象,以绿色低碳、旅客步行距离为优化目标,构建多情景下绿色低碳停机位分配模型,并设计遗传-禁忌搜索组合优化算法求解,最后以中国东北部的运输机场为实例进行仿真实验。实验结果表明,与实际运行分配方案相比,若仅考虑绿色低碳,最优分配方案可减少3.1%的燃油消耗,减少3.1%的航空器滑行距离,减少4.2% HC、3.6% CO、3.1% NOX、3.1% CO2排放,但会提高5.3%的旅客步行距离;若同时兼顾绿色低碳和旅客利益,最优分配方案可减少2.1%的燃油消耗,减少2.2%的航空器滑行距离,减少3.8% HC、2.7% CO、2.0% NOX、2.1%的CO2排放,减少2.1%的旅客步行距离。可见绿色低碳发展的同时,仍可兼顾旅客利益。
With the increasingly serious problem of climate change, green and low-carbon operations have become an important principle for the sustainable development of the air transportation industry. Taking a single runway transport airport as the research object and green and low-carbon and passenger walking distance as the optimization objective, a green and low-carbon gate assignment model under multiple scenarios was constructed, and a genetic-tabu search combined optimization algorithm was designed to solve it. Finally, a transport airport in northeast China was taken as an example for simulation experiment. The experimental results are shown as follows. In the optimal assignment scheme, if considering green and low-carbon, the fuel consumption can be reduced by 3.1%, the taxiing distance of the aircraft by 3.1%, HC emission by 4.2%, CO emission by 3.6%, NOX emission by 3.1%, and CO2 emission by 3.1% comparatively. But passenger walking distance can be increased by 5.3% at the same time. If considering green and low-carbon as well as the interests of the passengers, the fuel consumption can be decreased by 2.1%, the taxiing distance of the aircraft by 2.2%, HC emission by 3.8%, CO emission by 2.7%, NOX emission by 2.0%, CO2 emission by 2.1%, and passenger walking distance by 2.1% comparatively. Thus, it is possible to strike a balance between green and low-carbon development and the interests of travelers.
停机位分配 / 绿色低碳 / 旅客步行距离 / 遗传算法 / 禁忌搜索算法
gate assignment / green and low-carbon / passenger walking distance / genetic algorithm / tabu search algorithm
/
| 〈 |
|
〉 |