Route optimization model in collaborative logistics network for mixed transportation problem considered cost discount based on GATS

Abstract

A mixed transportation problem with centralized and decentralized transportation is proposed in collaborative logistics network. All tasks can be centralized to transport for once, twice or transported directly to destination node. A route optimization programming model to minimize the total costs is proposed in consideration of cost discount, road section capacity, overload penalty, advance delivery cost and hard time window. The hybrid genetic tabu search algorithm is presented to solve the model. To test the feasibility and validity of proposed model and hybrid algorithm, a simulation example is presented and solved. The optimal solution of experiment shows that the hybrid algorithm can obtain better solution, better convergence speed and high calculation efficiency.