Using Time Series and Classification in Vehicle Routing Problem

doi:10.23940/ijpe.21.01.p2.1425

Abstract

Abstract:

The purpose of data mining is to process raw data and extract rules. The Vehicle Routing Problem is a logistical problem, which handles the delivery and the collection of products. In the classical problem, the position of the depot and customers are known in advance. In case of the base problem, the demand of the customer is also known in advance. But, we may need some future data, for example, the demand of the customer, so we need to forecast these data from the previous data. After the determination of the future demands of the customers, we determined whether it is worth serving customers or not with the help of the classification methods. After the time-series forecasting and classification, we also determined the route of the vehicles with the help of the genetic algorithm.

Key words: logistic, data mining, vehicle routing problem, time-series forecasting, classification

Anita Agárdi, László Kovács, and Tamás Bányai. Using Time Series and Classification in Vehicle Routing Problem [J]. Int J Performability Eng, 2021, 17(1): 14-25.

Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks

References 32.

1.	M. A.Waller and S. E. Fawcett, “Data Science, Predictive Analytics, and Big Data: A Revolution that Will Transform Supply Chain Design and Management,” Journal of Business Logistics, Vol. 34, No. 2, pp. 77-84, 2013
2.	M. J. Shaw, C. Subramaniam, G. W. Tan,M. E. Welge, “Knowledge Management and Data Mining for Marketing,” Decision Support Systems, Vol. 31, No. 1, pp. 127-137, 2001
3.	L. Aburto and R. Weber, “Improved Supply Chain Management based on Hybrid Demand Forecasts,” Applied Soft Computing, Vol. 7, No. 1, pp. 136-144, 2007
4.	A. Kusiak and M. Smith, “Data Mining in Design of Products and Production Systems,” Annual Reviews in Control, Vol. 31, No. 1, pp. 147-156, 2007
5.	S. K. Barai, “Data Mining Applications in Transportation Engineering,” Transport, Vol. 18, No. 5, pp. 216-223, 2003
6.	H. G. Santos, L. S. Ochi, E. H. Marinho,L. M. D. A. Drummond, “Combining an Evolutionary Algorithm with Data Mining to Solve a Single-Vehicle Routing Problem,” Neurocomputing, Vol. 70, No.1-3, pp. 70-77, 2006
7.	C. Ding, Y. Cheng,M. He, “Two-Level Genetic Algorithm for Clustered Traveling Salesman Problem with Application in Large-Scale TSPs,” Tsinghua Science and Technology, Vol. 12, No. 4, pp. 459-465, 2007
8.	J. Y.Potvi and F. Guertin, “The Clustered Traveling Salesman Problem: A Genetic Approach,” Meta-Heuristics, pp. 619-631, 1996
9.	A. F.El-Samak and W. Ashour, “Optimization of Traveling Salesman Problem using Affinity Propagation Clustering and Genetic Algorithm,” Journal of Artificial Intelligence and Soft Computing Research, Vol. 5, No. 4, pp. 239-245, 2015
10.	S. Salhi and G. Nagy, “A Cluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problems with Backhauling,” Journal of the Operational Research Society, Vol. 50, No. 10, pp. 1034-1042, 1999
11.	S. N. Parragh, K. F. Doerner,R. F. Hartl, “A Survey on Pickup and Delivery Problems,” Journal Für Betriebswirtschaft, Vol. 58, No. 1, pp. 21-51, 2008
12.	R. Dondo, C. A. Méndez,J. Cerdá, “The Multi-Echelon Vehicle Routing Problem with Cross Docking in Supply Chain Management,” Computers and Chemical Engineering, Vol. 35, No. 12, pp. 3002-3024, 2011
13.	Y. Zhang and X. D. Chen, “An Optimization Model for the Vehicle Routing Problem in Multi-Product Frozen Food Delivery,” Journal of Applied Research and Technology, Vol. 12, No. 2, pp. 239-250, 2014
14.	Y. Park and J.Chae, “A Review of the Solution Approaches Used in Recent G-VRP (Green Vehicle Routing Problem),” International Journal of Advanced Logistics, Vol. 3, No. 1-2, pp. 27-37, 2014
15.	A. Montoya, C. Guéret, J. E. Mendoza,J. G. Villegas, “The Electric Vehicle Routing Problem with Nonlinear Charging Function,” Transportation Research Part B:Methodological, Vol. 103, pp. 87-110, 2017
16.	E. Cao and M. Lai, “The Open Vehicle Routing Problem with Fuzzy Demands,” Expert Systems with Applications, Vol. 37, No. 3, pp. 2405-2411, 2010
17.	M. Allahviranloo, J. Y. Chow,W. W. Recker, “Selective Vehicle Routing Problems under Uncertainty without Recourse,” Transportation Research Part E:Logistics and Transportation Review, Vol. 62, pp. 68-88, 2014
18.	C. D. Tarantilis, G. Ioannou, C. T. Kiranoudis,G. P. Prastacos, “Solving the Open Vehicle Routeing Problem via a Single Parameter Metaheuristic Algorithm,” Journal of the Operational Research Society, Vol. 56, No. 5, pp. 588-596, 2005
19.	M. Gendreau, G. Laporte,R. Séguin, “Stochastic Vehicle Routing,” European Journal of Operational Research, Vol. 88, No. 1, pp. 3-12, 1996
20.	R. S. Tsay, “Analysis of Financial Time Series,” John Wiley & Sons, pp. 543, 2005
21.	C. Chatfield and M. Yar, “Holt‐Winters Forecasting: Some Practical Issues,” Journal of the Royal Statistical Society: Series D (The Statistician), Vol. 37, No. 2, pp. 129-140, 1998
22.	H. Yu, J. Vaidya,X. Jiang, “Privacy-Preserving SVM Classification on Vertically Partitioned Data,” inProceedings of Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 647-656, 2006
23.	R. Kohavi and J. R. Quinlan, “Data Mining Tasks and Methods: Classification: Decision-Tree Discovery,” Handbook of Data Mining and Knowledge Discovery, pp. 267-276, 2002
24.	W. G. Touw, J. R. Bayjanov, L. Overmars, L. Backus, J. Boekhorst, M. Wels, et al., “Data Mining in the Life Sciences with Random Forest: A Walk in the Park or Lost in the Jungle?” Briefings in Bioinformatics, Vol. 14, No. 3, pp. 315-326, 2013
25.	D. A. Adeniyi, Z. Wei,Y. Yongquan, “Automated Web Usage Data Mining and Recommendation System using K-Nearest Neighbor (KNN) Classification Method,” Applied Computing and Informatics, Vol. 12, No. 1, pp. 90-108, 2016
26.	M. M.Saritas and A. Yasar, “Performance Analysis of ANN and Naive Bayes Classification Algorithm for Data Classification,” International Journal of Intelligent Systems and Applications in Engineering, Vol. 7, No. 2, pp. 88-91, 2019
27.	H. He and E. A. Garcia, “Learning from Imbalanced Data,” IEEE Transactions on Knowledge and Data Engineering, Vol. 21, No. 9, pp. 1263-1284, 2009
28.	D. Whitley, “A Genetic Algorithm Tutorial,” Statistics and Computing, Vol. 4, No. 2, pp. 65-85, 1994
29.	I. Ono, M. Yamamura,S. Kobayashi, “A Genetic Algorithm for Job-Shop Scheduling Problems using Job-based Order Crossover,” inProceedings of IEEE International Conference on Evolutionary Computation, pp. 547-552, 1996
30.	B. Lazzerini and F. Marcelloni, “A Genetic Algorithm for Generating Optimal Assembly Plans,” Artificial Intelligence in Engineering, Vol. 14, No. 4, pp. 319-329, 2000
31.	K. Rani and V. Kumar, “Solving Travelling Salesman Problem using Genetic Algorithm based on Heuristic Crossover and Mutation Operator,” International Journal of Research in Engineering and Technology, Vol. 2, No. 2, pp. 27-34, 2014
32.	H. Braun, “On Solving Travelling Salesman Problems by Genetic Algorithms,” inProceedings of International Conference on Parallel Problem Solving from Nature, pp. 129-133, 1990

[1]	Manpreet Singh, Gauri Jindal, Akshita Oberoi, and Rohan Dhangar. Improving Crime Detection Through Geo-MDA: A Hybrid Linear Regression Approach in Data Mining [J]. Int J Performability Eng, 2024, 20(8): 469-477.
[2]	Vikas Verma, Arun Malik, and Isha Batra. Analyzing and Classifying Malware Types on Windows Platform using an Ensemble Machine Learning Approach [J]. Int J Performability Eng, 2024, 20(5): 312-318.
[3]	Manu Jyoti Gupta and Parveen Sehgal. Optimizing Credit Card Fraud Detection: Classifier Performance and Feature Selection Empowered by Grasshopper Algorithm [J]. Int J Performability Eng, 2024, 20(3): 177-185.
[4]	Ovais Bashir Gashroo and Monica Mehrotra. DetectHATE: Detecting Targeted Hate - A Framework for Classifying Online Abuse on X [J]. Int J Performability Eng, 2024, 20(11): 699-711.
[5]	Janarthanan Sekar and Ganesh Kumar T. Hyperparameter Tuning in Deep Learning-Based Image Classification to Improve Accuracy using Adam Optimization [J]. Int J Performability Eng, 2023, 19(9): 579-586.
[6]	Aashita Rajput, Muskan Yadav, Sachin Yadav, Megha Chhabra, and Arun Prakash Agarwal. Patch-Based Breast Cancer Histopathological Image Classification using Deep Learning [J]. Int J Performability Eng, 2023, 19(9): 607-623.
[7]	Rakesh Kumar, Sunny Arora, Ashima Arya, Neha Kohli, Vaishali Arya, and Ekta Singh. Ensemble Learning for Appraising English Text Readability using Gompertz Function [J]. Int J Performability Eng, 2023, 19(6): 388-396.
[8]	Vaishali Arya and Tapas Kumar. Boosting X-Ray Scans Feature for Enriched Diagnosis of Pediatric Pneumonia using Deep Learning Models [J]. Int J Performability Eng, 2023, 19(3): 175-183.
[9]	Harshita Batra and Leema Nelson. DCADS: Data-Driven Computer Aided Diagnostic System using Machine Learning Techniques for Polycystic Ovary Syndrome [J]. Int J Performability Eng, 2023, 19(3): 193-202.
[10]	Shobhanam Krishna and Sumati Sidharth. AI-Powered Workforce Analytics: Maximizing Business and Employee Success through Predictive Attrition Modelling [J]. Int J Performability Eng, 2023, 19(3): 203-215.
[11]	Shalaka Prasad Deore. SongRec: A Facial Expression Recognition System for Song Recommendation using CNN [J]. Int J Performability Eng, 2023, 19(2): 115-121.
[12]	Shikha Choudhary and Bhawna Saxena. Image-Based Crop Disease Detection using Machine Learning Approaches: A Survey [J]. Int J Performability Eng, 2023, 19(2): 122-132.
[13]	Kamireddy Vijay Chandra, Kala Praveen Bagadi, Kalapala Vidya Sagar, R. Manjula Sri, and K. Sudha Rani. Deep Learning-Powered Corneal Endothelium Image Segmentation with Attention U-Net [J]. Int J Performability Eng, 2023, 19(11): 736-743.
[14]	Jitender Tanwar, Sanjay Kumar Sharma, Mandeep Mittal, and Ashok Kumar Yadav. Classification of Web Services for Efficient Performability [J]. Int J Performability Eng, 2023, 19(10): 654-662.
[15]	Priyanshu Verma, Ishan Sharma, Sonia Deshmukh, and Rohit Vashisht. Customer Churn Analysis using Spark and Hadoop [J]. Int J Performability Eng, 2023, 19(10): 663-675.