.png){kind=icon}
返回
MIP-based heuristics for solving robust gate assignment problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2015.12.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers the problem of robust gate assignment. Three factors having significant impact on gate assignment are considered: schedule robustness, facility and personnel cost during tows, and passenger satisfaction level. To precisely evaluate passenger satisfaction level, especially for transfer passengers, a model with quadratic terms is formulated. The quadratic model can exactly represent the traveling distance of transfer passengers, which cannot be precisely considered by traditional approximate models. However, the quadratic model is rather difficult to solve. Therefore, we then transform the model to an equivalent MIP model which is proven to be more efficient than the linearized models proposed in previous literature. In addition, in order to handle large size instances, we developed four different algorithms including diving, local branching, and relaxation induced neighborhoods (RINS), which are popular algorithms for solving general MIP models, together with a new algorithm which hybridizes the strength of RINS and diving. Extensive experiments are performed to compare the performance of the proposed algorithms. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Gate assignment problem
Robustness
Linear transformation
MIP-based heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Recovery of salinity gradient energy in desalination plants by reverse electrodialysis.png)
Desalination
OAAI
DesalinationIF0
OAAI分享收藏Nonneoplastic Cystic Lesions of Pancreas: A Practical Clinical, Histologic, and Radiologic Approach
PREAI
分享收藏Alginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environmentsRSC Advances
RSC AdvancesIF0
PREAI
分享收藏
查看更多内容