时间 : 2024年05月30日 15时00分
地点 : B校区经管学院101室
主讲人 : 储诚斌 教授
In this talk, we consider freight transport in urban areas using passenger rail networks as an environment-friendly alternative to current predominantly fossil-fueled trucks. We focus on designing an effective and robust method d on genetic algorithm. The problem is mathematically formulated into a mixed-integer linear program. We prove that as long as a parcel-to-train assignment is known, it takes a polynomial time to check whether this assignment can lead to a feasible solution and, if yes, solve the remaining problem by transforming it into computing the longest distances in a digraph. This result makes it possible to only consider parcel-to-train assignment variables in chromosomes, while efficiently determining the values of the other variables in fitness evaluation. In order to achieve robustness regarding all instances, the control parameters of the genetic algorithm are set with Taguchi method. Computational results show that the method developed in this way is very effective. For small-size instances, it yields optimal solutions within considerably shorter computation times than a commonplace optimization solver does. For large-size instances, it outperforms such a solver, not only providing much higher-quality solutions but also consuming much shorter computation times. This method thus meets very well operational requirements where high-quality solutions are expected while computation time is very limited. We also show that the problem as well as the pricing problem in the branch-and-price work can be solved with Benders decomposition where the slave problem can be exactly solved with Bellman-Ford method.