A heuristic method for solving reverse logistics vehicle routing problems with time windows

Sally Kassem and Mingyuan Chen

International Journal of Industrial and Systems Engineering, 2012, vol. 12, issue 2, 207-222

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.

Keywords: vehicle routing; reverse logistics; time windows; simultaneous pickup and delivery; heuristics. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=48861 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:12:y:2012:i:2:p:207-222

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().