Container swap trailer transportation routing problem based on genetic algorithm (Q1721272)

Summary: In swap trailer transportation routing problems, trucks and trailers conduct swap operations at special positions called trailer points. The parallelization of stevedoring and transportation can be achieved by means of these trailer points. This logistics organization mode can be more effective than the others. In this paper, an integer programming model with capacity and time-window constraints was established. A repairing strategy is embedded in the genetic algorithm (GA) to solve the model. The repairing strategy is executed after the crossover and mutation operation to eliminate the illegal routes. Furthermore, a parameter self-adaptive adjustment policy is designed to improve the convergence. Then numerical experiments are implemented based on the generated datasets; the performance and robustness of the algorithm parameter self-adaptive adjustment policy are discussed. Finally, the results show that the improved algorithm performs better than elementary GA.