کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
386347 660883 2011 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A hybrid algorithm for vehicle routing problem with time windows
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
A hybrid algorithm for vehicle routing problem with time windows
چکیده انگلیسی

Vehicle routing problem with time windows (VRPTW) is a well-known combinatorial problem. Many researches have presented meta-heuristics are effective approaches for VRPTW. This paper proposes a hybrid approach, which consists of ant colony optimization (ACO) and Tabu search, to solve the problem. To improve the performance of ACO, a neighborhood search is introduced. Furthermore, when ACO is close to the convergence Tabu search is used to maintain the diversity of ACO and explore new solutions. Computational experiments are reported for a set of the Solomon’s 56 VRPTW and the approach is compared with some meta-heuristic published in literature. Results show that considering the tradeoff of quality and computation time, the hybrid algorithm is a competitive approach for VRPTW.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 38, Issue 1, January 2011, Pages 435–441
نویسندگان
, , ,