Fuzzy programming model on collaborative vehicle route problem and algorithm

Collaborative vehicle routing problem(CVRP),where depots belonged to different companies serve their customers by sharing motorcades and warehousing to optimize total cost of collaborative transport,is a hot issue.This paper firstly built a fuzzy programming model on CVRP,considering time window,depot's capacity and maximum mileage of diffe-rent vehicles.And then converted into a deterministic one.The model was solved by self-adaptive discrete particle swarm optimization algorithm proposed by Wei Ming,et al.The experimental results show that the collaborative transport can significantly reduce total mileage and cost of the distribution compared to general logistics,which proves the model's correctness and reasonableness.