.png){kind=icon}
返回
The over-constrained airport gate assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2003.12.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the over-constrained airport gate assignment problem where the objectives are to minimize the number of ungated flights and total walking distances or connection times. We first use a greedy algorithm to minimize ungated flights. Exchange moves are employed to facilitate the use of heuristics. Simulated annealing and a hybrid of simulated annealing and tabu search are used. Experimental results are good and exceed those previously obtained. (C) 2003 Elsevier Ltd. All rights reserved.
Keyword:
airlines
transportation
tabu search
simulated annealing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Nonneoplastic Cystic Lesions of Pancreas: A Practical Clinical, Histologic, and Radiologic Approach
PREAI
分享收藏分享收藏分享收藏SIRIUS-LTG-UiO at SemEval-2018 Task 7: Convolutional Neural Networks
with Shortest Dependency Paths for Semantic Relation Extraction and
Classification in Scientific PapersSIRIUS-LTG-UiO在SemEval-2018任务7：用于科学论文中语义关系提取和分类的卷积神经网络与最短依赖路径
OAAI
OAAI分享收藏分享收藏
查看更多内容