Order batching method based on improved K-Means algorithm

An order and algorithm technology, applied in the field of data mining, can solve the problems of lack of reasonable selection of initial cluster centers, failure to consider order correlation, and failure to deeply consider the order relationship of the order itself.

Active Publication Date: 2016-06-15
HEFEI UNIV OF TECH
View PDF2 Cites 30 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Among these algorithms, the priority rule algorithm is relatively simple, but it does not consider the correlation between orders, resulting in the repetition of sorting paths; the selection of the initial value of the seed algorithm is difficult to determine; and the saving algorithm only considers the target sorting distance The shortest, without in-depth consideration of the attributes of the order itself and the relationship between orders
The traditional heuristic algorithm can only be calculat

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Order batching method based on improved K-Means algorithm
  • Order batching method based on improved K-Means algorithm
  • Order batching method based on improved K-Means algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] The order batching method in this embodiment uses a large amount of real data from e-commerce websites, then preprocesses the data set, converts the order into a vector, and then performs cross-validation on the data set to determine the distance threshold value T 1 and T 2 The size of the order set is divided into K Canopy by the Canopy method, and the center point and K value of each Canopy are obtained. Finally, the K-Means algorithm is used for clustering to obtain each batch. Finally, the collected real order data set is compared with other basic algorithms. Specifically:

[0032] Such as figure 1 As shown, an order batching method based on the improved K-Means algorithm is applied to the order batching problem. The order batching includes the order set X and the division of the order set X; the division result of the order set X is recorded as for T X ={K 1 , K 2 ,...,K j ,...,K k};K j Indicates the jth batch; 1≤j≤k, k is the number of batches; and proce...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an order batching method based on an improved K-Means algorithm, and the method is based on data mining. The method comprises the following steps: 1, conducting vectorization of a data set and obtaining an order set X; 2, obtaining a distance threshold T1 and a distance threshold T2 through a cross-validation method; 3, using a Canopy algorithm to obtain a cluster number K and a center point; 4, using the K and the center point obtained in the previous step and the improved K-Means algorithm to conduct clustering; and 5, after obtaining a final clustering result, sorting orders according to the average arrival time of the orders of each cluster, and obtaining a result of order batching. The method can accurately batch a large number of logistics orders, so that the efficiency of sorting operation is improved and the time taken for the sorting step is reduced.

Description

technical field [0001] The invention belongs to the field of data mining, in particular to an order batching method based on an improved K-Means algorithm. Background technique [0002] With the advent of the online shopping era, e-commerce companies will generate a large number of logistics orders. The number of these orders is massive, and the items in the orders are characterized by small batches, multiple varieties, and multiple batches. It's very difficult. The sorting link is the most time-consuming link in the entire order fulfillment link except transportation. The average sorting time accounts for more than 40% of the order fulfillment time in the warehouse. Sorting according to the order of order arrival time is not only time-consuming and laborious, but also easy Mistakes, inefficiencies. [0003] Order batching is an NP-hard problem, which cannot be effectively solved using traditional precise algorithms, so heuristic algorithms are generally used to solve it. ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06Q30/06G06K9/62
CPCG06Q30/0601G06F18/23213
Inventor 胡小建韦超豪张美艳
Owner HEFEI UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap