A heuristic approach for Periodic Vehicle Routing Problem: a case study
by Amir Ahmad Seifi, Nima Safaei, Pooria Assadi
International Journal of Logistics Systems and Management (IJLSM), Vol. 8, No. 4, 2011

Abstract: 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.

Online publication date: Wed, 06-May-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com