考虑多行程的机场食品车调度研究OA

At present,the scheduling of airline catering trucks in China's airports is mainly dependent on manual experience and scientific and systematic decision support is lacking.The airport catering truck scheduling problem considering multiple trips is investigated,and a mathematical model is constructed with the objective of minimizing the distance costs and minimizing vehicle counts.Meanwhile,constraints such as multiple trips,vehicle capacity,and task time windows are incorporated into the model.An initial solution is generated by the greedy algorithm,and an adaptive large-neighbourhood search algorithm is designed,which combines a variety of destructive algorithms and restorative algorithms to broaden the scope of the solution space.Meanwhile,the simulated annealing mechanism is introduced to improve the search efficiency and avoid falling into local optimum.The ALNS algorithm is experimentally validated by designing different sizes of cases,and the results of the ALNS algorithm are compared and analyzed with those of Gurobi,a commercial solver.The results show that the ALNS algorithm proposed in this paper is comparable to or better than Gurobi in terms of solution quality when solving most of the arithmetic cases,with at least 18.2%improvement in resource utilisation;and the solution time is much smaller than that taken by Gurobi,which fully reflects the advantages of the algorithm in terms of computational efficiency and quality.