کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10495476 | 941659 | 2005 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A vehicle routing problem with backhauls and time windows: a guided local search solution
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
علوم انسانی و اجتماعی
مدیریت، کسب و کار و حسابداری
کسب و کار و مدیریت بین المللی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part E: Logistics and Transportation Review - Volume 41, Issue 2, March 2005, Pages 131-144
Journal: Transportation Research Part E: Logistics and Transportation Review - Volume 41, Issue 2, March 2005, Pages 131-144
نویسندگان
Yingjie Zhong, Michael H. Cole,