کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
428910 686964 2006 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm
چکیده انگلیسی

The Vehicle Routing Problem (VRP) is a hard combinatorial problem with numerous industrial applications. Among the large number of extensions to the canonical VRP, we study the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of the same capacity. A cellular Genetic Algorithm (cGA)—a kind of decentralized population based heuristic—is used for solving CVRP, improving several of the best existing results so far in the literature. Our study shows a high performance in terms of the quality of the solutions found and the number of function evaluations (effort).

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 98, Issue 6, 30 June 2006, Pages 225-230