The over-constrained airport gate assignment problem

被引：91

作者：

Ding, H

Lim, A

Rodrigues, B

Zhu, Y

机构：

[1] Singapore Management Univ, Sch Business, Singapore 259756, Singapore

[2] Natl Univ Singapore, Dept Comp Sci, Singapore 117543, Singapore

[3] Hong Kong Univ Sci & Technol, Dept IEEM, Hong Kong, Hong Kong, Peoples R China

来源：

COMPUTERS & OPERATIONS RESEARCH | 2005年 / 32卷 / 07期

关键词：

airlines; transportation; tabu search; simulated annealing;

D O I：

10.1016/j.cor.2003.12.003

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：1867 / 1880

页数：14

共 20 条

[1] AIRCRAFT STAND ASSIGNMENT TO MINIMIZE WALKING [J].