CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

A Navel Heuristic Algorithm for the Periodic Vehicle Routing Problem

عنوان مقاله: A Navel Heuristic Algorithm for the Periodic Vehicle Routing Problem
شناسه ملی مقاله: JR_IJIEPR-25-2_006
منتشر شده در شماره 2 دوره 25 فصل در سال 1393
مشخصات نویسندگان مقاله:

M. Alinaghian - Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran
A. Danandeh - Department of Industrial and Management Systems Engineering University of South Florida, USA

خلاصه مقاله:
Periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the results obtained by best Heuristics and meta-heuristics algorithms in the literature. Computational results indicate that the algorithm performs well in terms of accuracy and solution time.

کلمات کلیدی:
Periodic vehicle routing problem; Heuristic algorithms; Data mining

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/281453/