A METHOD FOR TRANSPORTATION PLANNING AND PROFIT SHARING IN COLLABORATIVE MULTI-COPYRIGHT VEHICLE ROUTING

A Method for Transportation Planning and Profit Sharing in Collaborative Multi-copyright Vehicle Routing

A Method for Transportation Planning and Profit Sharing in Collaborative Multi-copyright Vehicle Routing

Blog Article

This paper addresses a collaborative multi-copyright vehicle routing problem (CMCVRP) where carriers tackle their orders collaboratively to reduce transportation costs.First, a hierarchical heuristics algorithm is Pulse Oximeter 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 Matching Shirts 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.

Report this page