A conceptual solution to the aircraft gate assignment problem using 0,1 linear programming
Proceedings of the 12th annual conference on Computers and industrial engineering
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
An optimal solution to a dock door assignment problem
Proceedings of the 14th annual conference on Computers and industrial engineering
Tabu Search
Reducing Labor Costs in an LTL Crossdocking Terminal
Operations Research
The Airport Gate Assignment Problem: Mathematical Model and a Tabu Search Algorithm
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 3 - Volume 3
The over-constrained airport gate assignment problem
Computers and Operations Research
Experimental analysis of optimization techniques on the road passenger transportation problem
Engineering Applications of Artificial Intelligence
Truck dock assignment problem with operational time constraint within crossdocks
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
The use of meta-heuristics for airport gate assignment
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
In contrast to the existing airport gate assignment studies where flight have fixed schedules, we consider the more realistic situation where flight arrival and departure times can change. Although we minimize walking distances (or travel time) in our objective function, the model is easily adapted for other material handling costs including baggage and cargo costs. Our objectives are achieved through gate assignments, where time slots alloted to aircraft at gates deviate from scheduled slots minimally. Further, the model can be applied to cross-docking optimization in areas other than airports, such as freight terminals where material arrival times (via trucks, ships) can fluctuate. The solution approach uses insert and interval exchange moves together with a time shift algorithm. We then use these neighborhood moves in Tabu Search and Memetic Algorithms. Computational results are provided and verify that our heuristics work well in small cases and much better in large cases when compared with CPLEX solver.