摘要：The incorporation of CO2 emissions minimization in the vehicle routing problem (VRP) is of critical importance to enterprise
practice. Focusing on the tractor and semitrailer routing problem with full truckloads between any two terminals of the network,
this paper proposes a mathematical programming model with the objective of minimizing CO2 emissions per ton-kilometer.
A simulated annealing (SA) algorithm is given to solve practical-scale problems. To evaluate the performance of the proposed
algorithm, a lower bound is developed. Computational experiments on various problems generated randomly and a realistic
instance are conducted.The results show that the proposed methods are effective and the algorithm can provide reasonable solutions
within an acceptable computational time.
