Robust Optimization of Bilateral Vehicle Scheduling for China-myanmar Container Drayaga Under Uncertain Transportation Time
Taking the vehicle scheduling problem under the cross-border container connection transpor-tation scenario between China and Myanmar as the research object,on the basis of existing research,the uncertainty of bilateral vehicle scheduling and transportation timeliness was taken into account.Aiming at minimizing the total cost of cross-border transportation,a robust optimization model of bi-lateral vehicle scheduling was constructed.By introducing genetic algorithm to generate initial solution and incorporating new neighborhood transformation criteria,a variable neighborhood tabu search al-gorithm was designed.Taking the transportation data of a logistics company as an example,the re-sults show that compared with the traditional tabu search algorithm,the improved variable neighbor-hood tabu search algorithm improves the optimization efficiency by 53.3％and optimizes the objective function value by 3.2％.
万方数据
维普
