A heuristic method for solving reverse logistics vehicle routing problems with time windows
by Sally Kassem; Mingyuan Chen
International Journal of Industrial and Systems Engineering (IJISE), Vol. 12, No. 2, 2012

Abstract: Vehicle routing problems with simultaneous pickup and delivery with time windows are studied in this paper. In a closed-loop logistics network, vehicles visiting customers for pickup and delivery may be only allowed for certain time intervals. A mixed integer programming model of the problem is presented. It has been known that solving vehicle routing problems with time windows is NP-hard. A heuristic solution procedure is developed to solve the problem. The proposed heuristic is tested on a number of numerical examples based on modified benchmark problems in the literature.

Online publication date: Sat, 20-Dec-2014

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 Industrial and Systems Engineering (IJISE):
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