جلد 25، شماره 2 - ( 2-1393 )
جلد 25 شماره 2 صفحات 149-139 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Alinaghian M. a swift heuristic algorithm base on data mining approach for the Periodic Vehicle Routing Problem: data mining approach. IJIEPR 2014; 25 (2) :139-149
URL: http://ijiepr.iust.ac.ir/article-1-459-fa.html
URL: http://ijiepr.iust.ac.ir/article-1-459-fa.html
a swift heuristic algorithm base on data mining approach for the Periodic Vehicle Routing Problem: data mining approach. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1393; 25 (2) :139-149
چکیده: (6654 مشاهده)
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 competitive in the accuracy and its small amount of solving time point of views.
نوع مطالعه: پژوهشي |
موضوع مقاله:
زنجیره تامین و لجستیک
دریافت: 1391/5/17 | پذیرش: 1393/2/2 | انتشار: 1393/3/5
دریافت: 1391/5/17 | پذیرش: 1393/2/2 | انتشار: 1393/3/5
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
