Vehicle routing model and algorithm study for the network of container transportation with dumping trailers under hard time window constraint

Abstract

The network of container transportation with dumping trailers is a typical NP-hard problem and has strict requirement on time. Therefore, vehicle routing becomes the core problem of the network. In this paper, the vehicle routing optimization model is built for the network of container transportation with dumping trailers to analyze the vehicle routing optimization problem under hard time constraint. In addition, via simulated annealing algorithm, the model is solved and finally verified via sample calculation.