Optimation Cavacity Vehicle Routing Problem with K-Nearest Neighbor in Classification of Goods Ditribution Route

Industrial and distribution service problems that belong to combinatorial optimization include vehicle routing with Vehicle Routing Problem. This research builds a framework and implements it in a multi-class optimization model to reduce overfitting and misclassification results caused by unbalanced multiclassification in the influence of the number of ‘nodes’ on vehicle routes with machine learning. The problem of imbalance in vehicle route classification has been a challenge in the classification process and attracted the attention of a number of researchers. The purpose of the model in general is to gain an understanding of the mechanism in the problem so as to classify the imbalanced vehicle route data based on JNE delivery routes. The solution method that will be used by applying k-nearest neighbor to determine the amount of carrying capacity of the goods will then determine the delivery location point with the vehicle routing problem. So that this model can be a model in determining vehicle routes based on the capacity limit of the number of shipments of goods.