1. This article presents a multi-objective robust optimization model for the route problem of multimodal transportation with timetable under uncertainty.
2. The proposed approach uses Non-Dominated Sorting Genetic Algorithm-II (NSGA-II) to solve the combinatorial optimization problem and analyze the diversity, distribution and convergence of the frontier solutions.
3. The proposed algorithm can provide decision reference for multimodal transportation carriers in making transportation plan under uncertainty.
The article is generally reliable and trustworthy, as it provides a comprehensive overview of the route problem of multimodal transportation with timetable under uncertainty, including a multi-objective robust optimization model and heuristic approach to solve the combinatorial optimization problem. The authors have also provided evidence for their claims by analyzing the diversity, distribution and convergence of the frontier solutions in numerical examples.
However, there are some potential biases that should be noted. For example, there is no discussion of possible risks associated with using this approach or any counterarguments that could be made against it. Additionally, there is no mention of any other approaches that could be used to solve this problem or how they compare to this one. Furthermore, there is no exploration of alternative solutions or ways to improve upon this approach. Finally, there is no discussion of any potential limitations or drawbacks associated with this approach that should be taken into consideration when using it.