Volume 25, Issue 2 (IIJEPR 2014)                   IJIEPR 2014, 25(2): 139-149 | Back to browse issues page

XML Print

Download citation:
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-en.html
a swift heuristic algorithm base on data mining approach for the Periodic Vehicle Routing Problem: data mining approach
Mehdi Alinaghian
Department of Industrial engineering, Isfahan university of technology,Isfahan,iran , Alinaghian@cc.iut.ac.ir
Abstract:   (6176 Views)
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.
Keywords: Periodic vehicle routing problem, Heuristic algorithms, data mining.
Full-Text [PDF 632 kb]   (2233 Downloads)    
Type of Study: Research | Subject: Logistic & Apply Chain
Received: 2012/08/7 | Accepted: 2014/04/22 | Published: 2014/05/26
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.