| Article ID: | iaor20114024 |
| Volume: | 8 |
| Issue: | 4 |
| Start Page Number: | 425 |
| End Page Number: | 443 |
| Publication Date: | Apr 2011 |
| Journal: | International Journal of Logistics Systems and Management |
| Authors: | Safaei Nima, Seifi Amir Ahmad, Assadi Pooria |
| Keywords: | combinatorial optimization, heuristics, vehicle routing & scheduling |
A heuristic approach is proposed to solve a real Periodic Vehicle Routing Problem (PVRP) that aims at extending the market share with the minimum transportation cost. In PVRP, vehicles are assigned to routes in different workdays to satisfy the frequency of visiting customers. The objective is to determine the scheduling and routing policies of the vehicles to minimise the fleet size and to maximise the selling benefits. The vehicle capacity and the trip time are the main constraints. The proposed approach is verified by real data and obtained results imply a significant improvement as compared to the current status.