A vehicle routing problem with backhauls and time windows: a guided local search solution

Yingjie Zhong and Michael H. Cole

Transportation Research Part E: Logistics and Transportation Review, 2005, vol. 41, issue 2, 131-144

Abstract: This paper presents a guided local search heuristic to solve a vehicle routing problem with backhauls and time windows. The VRPBTW with and without customer precedence are both considered. Customer precedence requires that all linehaul customers be visited before any backhaul customer. The basic approach is to construct an initial infeasible solution and then use a guided local search to improve the solution feasibility and quality. A new technique--section planning--is used to enhance the feasibility. Computational results show that the new heuristic can solve problems in which customers are distributed normally or in clusters. Some of the results are better than the best solutions that have appeared in the literature.

Keywords: Vehicle; routing; Time; windows; Metaheuristic (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S136655450400016X
Full text for ScienceDirect subscribers only

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:eee:transe:v:41:y:2005:i:2:p:131-144

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().