Model and Simulation for Collaborative VRPSPD

Abstract

This paper studies the collaborative vehicle routing problem of multiple distribution centers with simultaneous pickup and delivery considering the constraint of the number of vehicles and vehicle’s work time, and the fairness of routing arrangement. The objective functions include minimizing the number of utilized vehicles, the travel distance, and the standard deviation of maximum load and vehicle’s utilized time. This paper proposes a mutiobjective mathematical programming model to formulate this problem. And a TS algorithm with Lagrangian Relaxation Approach is designed. This algorithm gives the maximum lower bound of the solutions, achieves the optimal feasible solutions by routes assignment and adjustment strategies. The Tabu Search is embedded with a random neighborhood ordering with restart and shaking methods. The experimental results show that the proposed algorithm presented satisfactory solutions, and the collaborative routing arrangement is more economical, fair, and reasonable than non-collaborative arrangement.