A Method for Transportation Planning and Profit Sharing in Collaborative Multi-Carrier Vehicle Routing Academic Article uri icon

  • Overview
  • Research
  • Identity
  • Additional Document Info
  • View All


  • This paper addresses a collaborative multi-carrier vehicle routing problem (CMCVRP) where carriers tackle their orders collaboratively to reduce transportation costs. First, a hierarchical heuristics algorithm is proposed to solve the transportation planning problem. This algorithm makes order assignments based on two distance rules and solves the vehicle routing problem with a hybrid genetic algorithm. Second, the profit arising from the coalition is quantified, and an improved Shapley value method is proposed to distribute the profit fairly to individual players. Extensive experiment results showed the effectiveness of the proposed hierarchical heuristics algorithm and confirmed the stability and fairness of the improved Shapley value method.


  • Shi, Yanjun
  • Lin, Na
  • Han, Qiaomei
  • Zhang, Tongliang
  • Shen, Weiming

publication date

  • October 1, 2020