CN111842167A

CN111842167A - Method and device for sorting articles

Info

Publication number: CN111842167A
Application number: CN201910359741.1A
Authority: CN
Inventors: 杨凌云
Original assignee: Beijing Jingdong Qianshi Technology Co Ltd
Current assignee: Beijing Jingdong Qianshi Technology Co Ltd
Priority date: 2019-04-30
Filing date: 2019-04-30
Publication date: 2020-10-30
Anticipated expiration: 2039-04-30
Also published as: CN111842167B

Abstract

The invention discloses a method and a device for sorting articles, and relates to the technical field of warehouse logistics. One embodiment of the method comprises: dividing the collection to be sorted into a first sort batch and a second sort batch; matching each set in the first sort batch to a respective first bin; assigning the sets in the second sort batch to the remaining second bins; judging whether the articles to be sorted belong to a set in a first sorting batch; after each collection in the first sorting batch is sorted, matching the collection in the second sorting batch with the first and/or second grid, and setting the collection in the second sorting batch as a new first sorting batch. The invention avoids the technical defects that the grids cannot be completely bound when the number of the sets to be sorted is large, the times for scanning the articles to be sorted are more, and the sorting efficiency is low, thereby achieving the technical effects of reducing the scanning times and sorting times of the articles and improving the sorting efficiency.

Description

Method and device for sorting articles

Technical Field

The invention relates to the technical field of warehouse logistics, in particular to a method and a device for sorting articles.

Background

In the warehousing field, it is necessary to store a stack of items separately according to standards. With the development of automation, automatic equipment such as a cross belt sorting machine is adopted to carry out sorting operation. The automatic equipment comprises a bag supplying table, a sorting line and a grid. And binding an article set by one lattice, delivering the articles to a sorting line, finding the lattice bound by the articles by the equipment, delivering the articles to the corresponding lattice, and further finishing the sorting of the articles.

In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:

1. when the number of sets to be sorted is large and the number of the sets to be sorted is different from the number of the corresponding grids, a large number of sets cannot be bound to the grids, so that the sets without the grids cannot be sorted, and orders without the grids can be continuously sorted only when the state with the grids is idle.

2. Because the articles to be sorted are stored in a mixed manner, the corresponding set of articles cannot be determined before sorting. The collection corresponding to the item can be determined by scanning the item. When the number of sets to be sorted is large, the number of scanning times is increased, and the sorting efficiency is low.

Disclosure of Invention

In view of this, the embodiment of the present invention provides an article sorting method, which can avoid the technical defects that in the prior art, when the number of collections to be sorted is large, the grids cannot be bound completely, the grids in an idle state need to be waited for, the number of times of scanning the articles to be sorted is large, and the sorting efficiency is low, thereby achieving the technical effects of reducing the number of times of scanning the articles and the number of times of sorting the articles, and improving the sorting efficiency.

To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of sorting articles, including:

dividing the collection to be sorted into a first sort batch and a second sort batch;

matching each set in the first sort batch to a respective first bin; assigning the sets in the second sort batch to the remaining second bins;

judging whether the articles to be sorted belong to a set in a first sorting batch; if so, delivering the item to a first bin of the first sort batch where the set matches; if not, matching the item with a set in a second sorting batch and delivering the item to a second grid allocated by the set in the second sorting batch;

after each collection in the first sorting batch is sorted, matching the collection in the second sorting batch with the first and/or second grid, and setting the collection in the second sorting batch as a new first sorting batch.

Optionally, the sorting of the collection to be sorted into a first sort batch and a second sort batch comprises: sequencing the sets from more to less according to the quantity of the articles contained in each set; setting the N sets from the front to the back of the sorting as a first sorting batch, wherein N is the number of first grids; set the remaining set in the sort to a second sort batch.

Optionally, assigning the set of second sort batches to a second bin includes: setting an upper limit on the number of sets accommodated by the second bin; assigning the sets in the second sort batch to a second bin according to the upper quantity limit.

Optionally, matching the item to a collection in a second sort batch and delivering the item to a second bin allocated by the collection in the second sort batch comprises:

judging whether a sorted finished set exists in the first sorting batch;

if yes, removing the articles in the lattice matched with the sorted set, and removing the matching relation between the sorted set and the first lattice matched with the sorted set; matching the first grid opening with the unmatched relation with a set in a second sorting batch which corresponds to the article to be sorted and is not sorted, and delivering the article to be sorted to the first grid opening;

If not, matching the item with a collection in a second sorting batch, and delivering the item to a second slot allocated by the collection in the second sorting batch.

According to still another aspect of an embodiment of the present invention, there is provided an apparatus for sorting articles, including:

the collection dividing module is used for dividing the collection to be sorted into a first sorting batch and a second sorting batch;

a set assignment module for matching each set in the first sort batch with a first bin, respectively; assigning the sets in the second sort batch to the remaining second bins;

the first article sorting module is used for judging whether the articles to be sorted belong to the set in the first sorting batch or not; if so, delivering the item to a first bin of the first sort batch where the set matches; if not, matching the item with a set in a second sorting batch and delivering the item to a second grid allocated by the set in the second sorting batch;

and the second item sorting module is used for matching the sets in the second sorting batch with the first grids and/or the second grids after the sets in the first sorting batch are sorted, and setting the sets in the second sorting batch as a new first sorting batch.

Optionally, assigning the set of second sort batches to a second bin includes:

setting an upper limit on the number of sets accommodated by the second bin;

assigning the sets in the second sort batch to a second bin according to the upper quantity limit.

judging whether a sorted finished set exists in the first sorting batch;

According to another aspect of an embodiment of the present invention, there is provided an article sorting electronic apparatus including:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method for sorting articles provided by the present invention.

According to a further aspect of the embodiments of the present invention, there is provided a computer-readable medium on which a computer program is stored, the program, when executed by a processor, implementing the method of sorting articles provided by the present invention.

One embodiment of the above invention has the following advantages or benefits:

this technical scheme adopts and accomplishes the letter sorting back when the set in the first letter sorting batch, can match the second letter sorting batch set that has carried out rough letter sorting with first check mouth, can sort the technical means that can reach the purpose of letter sorting according to the article after rough letter sorting when sorting the second letter sorting batch, avoided prior art can't match all sets with check mouth when the set that waits to sort is in large quantity, need wait for the check mouth that is in idle state, the number of times of scanning waiting to sort the article is many, the technical defect that letter sorting efficiency is low, and then reach the scanning number of times that reduces the article, sort the number of times, improve the technological effect of letter sorting efficiency.

Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.

Drawings

The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:

fig. 1 is a schematic view of a main flow of an article sorting method according to an embodiment of the present invention;

fig. 2 is a schematic diagram of the main modules of an apparatus for sorting articles according to an embodiment of the present invention;

FIG. 3 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;

fig. 4 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.

Detailed Description

Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

Fig. 1 is a schematic diagram of a main flow of an article sorting method according to an embodiment of the present invention, and as shown in fig. 1, according to still another aspect of the embodiment of the present invention, there is provided a method 100 of sorting articles, including:

Step S101, dividing a set to be sorted into a first sorting batch and a second sorting batch;

step S102, matching each set in the first sorting batch with a first grid respectively; assigning the sets in the second sort batch to the remaining second bins;

step S103, judging whether the articles to be sorted belong to a set in a first sorting batch; if so, delivering the item to a first bin of the first sort batch where the set matches; if not, matching the item with a set in a second sorting batch and delivering the item to a second grid allocated by the set in the second sorting batch;

step S104, after the sorting of each set in the first sorting batch is completed, matching the set in the second sorting batch with the first bin and/or the second bin, and setting the set in the second sorting batch as a new first sorting batch.

The technical scheme can be considered that the collection in the first sorting batch completes the sorting task in a short time by using the article corresponding to the first grid, and the collection in the second sorting batch performs rough sorting by using the second grid while the collection in the first sorting batch is sorted; after the collection in the first sort batch is sorted, the collection in the second sort batch, which has been roughly sorted, is sorted. The number of the first and second slots may be set according to the ratio between the total number of the actual slots and the collection to be sorted. The number of the first grid openings and the number of the second grid openings are not less than one.

In particular, assuming that there are 100 bins, there are 500 collections to be sorted. This technical scheme can adopt: and setting 90 grids as first grids and the rest 10 grids as second grids. The first sort batch is taken as a collection equal in number to the first lot (i.e., 90 collections to be sorted) and the remaining 410 collections are set as the second sort batch. The sets in the first sort batch are one-to-one matched to the first bin and the sets in the second sort batch are evenly distributed to the remaining ten second bins. When an article to be sorted is obtained, it is first determined whether the article to be sorted matches 90 sets in the first sorting batch. If the article is matched with one of the 90 sets, delivering the article to the grid of the corresponding set; if the matched set does not exist, the article is continuously matched with the second sorting batch set, and the technical effect of roughly sorting the second sorting batch set is further achieved.

And continuing to finely sort the grids corresponding to the second sorting batch after the rough sorting. In particular, upon completion of the sorting of the respective sets of the first lot and the coarse sorting of the second sorted lot, a fine sort may be performed for each of the second cells.

For example, matching the respective sets of bin a assignments in the second bin to the first bin; matching the roughly sorted articles belonging to the cell A with the sets in the cell A to obtain the fine sorting of each set in the cell A.

In the present embodiment, since the number of the second gates is 10, the number of the second sort batches is 410. When the second bin allocates the 410 sets equally, the total number of sets allocated by bin a is 41, which is much smaller than the number of first bins. Optionally, a second cell B is selected and a fine sorting operation is performed simultaneously with the cell a.

Still take the existing 100 slots, 500 scenes of the collection to be sorted as an example. The scheme of the prior art is as follows: and taking 100 collections to be sorted as a first sorting batch, matching the first sorting batch with 100 existing grids, and then sorting the collections, and recycling 100 grids for matching sorting after the first sorting batch is sorted. The items which are not sorted need to be scanned and sorted repeatedly, and the cost is high.

Compared with the prior art, after the collection in the first sorting batch is sorted, the collection in the second sorting batch which is roughly sorted can be matched with the first lattice opening, the second sorting batch can be sorted according to the roughly sorted articles, the technical defects that the collection to be sorted in the prior art cannot be completely matched with the lattice opening when the collection to be sorted is large in quantity, the lattice opening in an idle state needs to be waited for, the number of times of scanning the articles to be sorted is large, the sorting efficiency is low are overcome, and the technical effects of reducing the scanning number of the articles, the sorting number of times and improving the sorting efficiency are achieved.

In order to avoid the excessive times of the secondary sorting batch circulation, the number of the collections to be sorted can be controlled during distribution.

Optionally, the sorting of the collection to be sorted into a first sort batch and a second sort batch comprises:

sequencing the sets from more to less according to the quantity of the articles contained in each set;

setting the N sets from the front to the back of the sorting as a first sorting batch, wherein N is the number of first grids;

set the remaining set in the sort to a second sort batch.

By adopting the technical means of sequencing the quantity of the articles contained in the set from large to small, more articles can be sorted when the first sorting batch is sorted, the probability of successful sorting of the articles in the first sorting batch is improved, and the technical effect of improving the overall sorting efficiency is further achieved.

Optionally, assigning the set of second sort batches to a second bin includes:

setting an upper limit on the number of sets accommodated by the second bin;

The allocation of the sets of the second sort batch to the second bins includes: the number of sets accommodated by each second cell is randomly set on the condition that the upper limit of the second cell is satisfied.

By setting the upper limit of the number of the sets contained in the second grids, the articles roughly matched with each second grid can be more uniform, and the scanning times of the second sorting batch in the refining sorting process can be reduced, and the sorting efficiency can be improved.

judging whether a sorted finished set exists in the first sorting batch;

Specifically, for example, when the collection x in the 90 collections of the first sorting batch completes the sorting of the items first relative to the other collections of the first sorting batch, the items in the slot C corresponding to the collection x may be removed, the matching relationship between the collection x and the slot C is then released, the collection y in the second sorting batch where no sorting occurs is matched with the slot C, and the items to be sorted belonging to the collection x are delivered to the slot C.

During the actual scanning of the items, there may be a case where the collection in the first sort batch completes the sorting of the items first. In order to improve the utilization rate of the grid and further improve the sorting efficiency, the first grid and the set in the first sorting batch completing sorting can be unmatched, the articles in the first grid are removed, and then the set in the second sorting batch is conveniently matched with the grid, so that the technical effect of improving the sorting efficiency is achieved.

Preferably, the set matched with the idle-state slots is the set of second sorting batches in which sorting does not occur, and in practical application, the set can also be the set of second sorting batches in which sorting occurs. By finely sorting the articles of the collection in the second sort batch in advance, secondary sorting can be avoided, and then the efficiency of sorting is improved.

Fig. 2 is a schematic diagram of main modules of an apparatus for sorting articles according to an embodiment of the present invention, and as shown in fig. 2, according to still another aspect of an embodiment of the present invention, there is provided an apparatus 200 for sorting articles, including:

a collection dividing module 201 for dividing the collection to be sorted into a first sorting batch and a second sorting batch;

A set assignment module 202 for matching each set in the first sort batch with a first bin, respectively; assigning the sets in the second sort batch to the remaining second bins;

a first article sorting module 203, configured to determine whether an article to be sorted belongs to a set in a first sorting batch; if so, delivering the item to a first bin of the first sort batch where the set matches; if not, matching the item with a set in a second sorting batch and delivering the item to a second grid allocated by the set in the second sorting batch;

the second item sorting module 204 is configured to match the sets in the second sorting batch with the first bin and/or the second bin after the sorting of each set in the first sorting batch is completed, and set the sets in the second sorting batch as a new first sorting batch.

Set the remaining set in the sort to a second sort batch.

Optionally, assigning the set of second sort batches to a second bin includes:

setting an upper limit on the number of sets accommodated by the second bin;

judging whether a sorted finished set exists in the first sorting batch;

Fig. 3 illustrates an exemplary system architecture 300 of an article sorting method or apparatus to which embodiments of the present invention may be applied.

As shown in fig. 3, the system architecture 300 may include

terminal devices

301, 302, 303, a network 304, and a server 305. The network 304 serves as a medium for providing communication links between the

terminal devices

301, 302, 303 and the server 305. Network 304 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

The user may use the

terminal device

301, 302, 303 to interact with the server 305 via the network 304 to receive or send messages or the like. The

terminal devices

301, 302, 303 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).

The

terminal devices

301, 302, 303 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 305 may be a server providing various services, such as a background management server (for example only) providing support for shopping-like websites browsed by users using the

terminal devices

301, 302, 303. The backend management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (for example, target push information, product information — just an example) to the terminal device.

It should be noted that the article sorting method provided by the embodiment of the present invention is generally executed by the server 305, and accordingly, the article sorting apparatus is generally disposed in the server 305.

It should be understood that the number of terminal devices, networks, and servers in fig. 3 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

Referring now to FIG. 4, a block diagram of a computer system 400 suitable for use with a terminal device implementing an embodiment of the invention is shown. The terminal device shown in fig. 4 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 4, the computer system 400 includes a central processing module (CPU)401 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data necessary for the operation of the system 400 are also stored. The CPU 401, ROM 402, and RAM 403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.

The following components are connected to the I/O interface 405: an input section 406 including a keyboard, a mouse, and the like; an output section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. A driver 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 as necessary, so that a computer program read out therefrom is mounted into the storage section 408 as necessary.

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 409, and/or installed from the removable medium 411. The computer program performs the above-described functions defined in the system of the present invention when executed by the central processing module (CPU) 401.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a sending module, an obtaining module, a determining module, and a first processing module. The names of these modules do not form a limitation on the modules themselves in some cases, and for example, the sending module may also be described as a "module sending a picture acquisition request to a connected server".

As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise:

According to the technical scheme of the embodiment of the invention, the following technical effects can be achieved:

compared with the prior art, this technical scheme is after the collection in the first letter sorting batch is accomplished to sort, can match the second letter sorting batch collection that has carried out rough letter sorting with first check mouth, when sorting the second letter sorting batch can sort according to the article after rough letter sorting, avoided prior art can't all bind the check mouth when the collection quantity that waits to sort is big, need wait for the check mouth that is in idle state, the number of times of scanning waiting to sort the article is many, the technical defect that sorting efficiency is low, and then reach the scanning number of times that reduces the article, sort the number of times, improve the technological effect of letter sorting efficiency.

The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method of sorting articles, comprising:

2. The method of claim 1, wherein separating the collection to be sorted into a first sort batch and a second sort batch comprises:

Set the remaining set in the sort to a second sort batch.

3. The method of claim 1, wherein assigning the set in the second sort batch to a second bin comprises:

setting an upper limit on the number of sets accommodated by the second bin;

4. The method of claim 1, wherein matching the item to a collection in a second sort batch and delivering the item to a second bin allocated by the collection in the second sort batch comprises:

judging whether a sorted finished set exists in the first sorting batch;

5. An apparatus for sorting articles, comprising:

6. The apparatus according to claim 5, wherein the separation of the collection to be sorted into a first sort batch and a second sort batch comprises:

set the remaining set in the sort to a second sort batch.

7. The apparatus of claim 6, wherein assigning the set in the second sort batch to a second bin comprises:

setting an upper limit on the number of sets accommodated by the second bin;

8. The apparatus of claim 7, wherein matching the item to a collection in a second sort batch and delivering the item to a second bin allocated by the collection in the second sort batch comprises:

judging whether a sorted finished set exists in the first sorting batch;

9. An electronic device for sorting articles, comprising:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-4.

10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-4.