A Multi Depot Simultaneous Pickup and Delivery Problem with Balanced Allocation of Routes to Drivers

In this paper, a new mathematical model is developed for a multi-depot vehicle routing problem with simultaneous pickup and delivery. A non-homogenous fleet of vehicles and a number of drivers with different levels of capability are employed to service customers with pickup and delivery demands. The capability of drivers is considered to have a balanced distribution of travels. The objective is to minimize the total cost of routing, penalties for overworking of drivers and fix costs of drivers’ employment. As this problem is proven to be NP-hard, two meta-heuristic approaches based on Imperialist Competitive Algorithm (ICA) and Genetic Algorithm (GA) are employed to solve the generated problems. The parameter tuning is conducted by Taguchi experimental design method. The obtained results show the high performance of the proposed ICA in the quality of the solutions and computational time