Research Article
Continuous Time Formulation and Lagrangian Relaxation Algorithm for the Gate Assignment Problem
Table 3
Comparison between event-based model and sequence-based model.
| Problem | Avg. CPU time (s) | MIP gap (%) | |N| | |M| | T | Event | Sequence | Event | Sequence |
| 10 | 3 | 360 | 0.43 | 2.48 | 0.00 | 0.00 | 12 | 5 | 360 | 38.26 | 163.28{2} | 0.00 | 2.95 | 14 | 5 | 360 | 176.38 | 365.84{5} | 0.01 | 5.23 | 16 | 5 | 360 | 270.94{4} | 303.93{5} | 4.32 | 3.96 | 18 | 5 | 360 | 286.27{4} | 534.04{8} | 2.18 | 3.87 | 20 | 5 | 360 | 162.48{2} | 448.95{7} | 0.28 | 2.04 |
|
|
{•}The number of instances not optimally solved in 600 s, and CPU time is set to 600 s.
|