A Navel Heuristic Algorithm for the Periodic Vehicle Routing Problem
Publish place: International Journal of Industrial Engineering & Production Research، Vol: 25، Issue: 2
Publish Year: 1393
نوع سند: مقاله ژورنالی
زبان: English
View: 630
This Paper With 11 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-25-2_006
تاریخ نمایه سازی: 7 شهریور 1393
Abstract:
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.
Keywords:
Authors
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