CN108320041A - Distribution set single method, apparatus, electronic equipment and readable storage medium storing program for executing - Google Patents
Distribution set single method, apparatus, electronic equipment and readable storage medium storing program for executing Download PDFInfo
- Publication number
- CN108320041A CN108320041A CN201710032382.XA CN201710032382A CN108320041A CN 108320041 A CN108320041 A CN 108320041A CN 201710032382 A CN201710032382 A CN 201710032382A CN 108320041 A CN108320041 A CN 108320041A
- Authority
- CN
- China
- Prior art keywords
- storage space
- path
- optimal path
- dispensing position
- sorter
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
Abstract
The present invention provides a kind of method, apparatus, electronic equipment and readable storage medium storing program for executing that distribution set is single.The method includes：Each set singly indicates multiple cargos to be picked, different cargos is located at storage space different in goods library, known to the distance between each storage space, and known to each the distance between dispensing position and each storage space, the single sorter of the Unclaimed set such as each is located at one of multiple dispensing positions, according to goods library database, determine that the storage space where each cargo indicated in set list, identified storage space constitute the storage space collection of the set list；It determines and concentrates each storage space by storage space from each dispensing position to complete the optimal path of picking, identified optimal path constitutes the optimal path collection of the set list, and each optimal path that wherein optimal path is concentrated corresponds to a dispensing position；The shortest path for selecting optimal path to concentrate；The set is singly distributed to the sorter positioned at the corresponding dispensing position of the shortest path.
Description
Technical field
The present invention relates to field of computer technology, single method, apparatus, electronic equipment are gathered in a kind of particularly distribution
And readable storage medium storing program for executing.
Background technology
With the fast development of Internet technology, e-commerce industry becomes more and more popular, carries out the people of shopping online
Also more and more.For electric business (e-commerce) industry, the Experience Degree of user height concerning its whether can sustainable development,
Therefore, user experience is increasingly taken seriously.However, the type of merchandize with electric business enterprise operation increases, warehouse will certainly
Become increasing, then, the commodity how rapidly sort out user places an order from warehouse, which become, improves the one of user experience
A key point.
According to related data statistical analysis it is found that logistics cost accounts for about 30% or so of the final price of commodity, and home-delivery center
The cost for carrying out commodity picking accounts for about 25% of logistics cost or so.It can be seen that planning that rational commodity sort walking
Path has decisive impact the height of home-delivery center's operational paradigm.
The commodity used at present sort the depot maintenance personnel that walking path algorithm is scene and are rule of thumb laid out with storehouse
The fixed walking route of configuration.It is as follows that the commodity used at present sort process：
1, configuration commodity sort track route, and according to the layout scenarios of storehouse, the fixed storehouse commodity of configuration one sort
Track route；
2, inside according to set single (including multiple orders, the commodity of multiple orders are sorted every time, so as to cost-effective)
To shelf storage space point to be sorted, sort track route successively according to the commodity of configuration includes commodity attribute from set list
Shelf storage space where commodity clicks through crudely-made articles object and sorts, and gathers all sortings after all commodity sort in list at one
Commodity be committed to review packaging platform further to be checked and be packaged；
3, after completing a single sorting of set, continue to sort according to the storehouse commodity sorting track route of configuration next
A set is single, until all set list sortings finish.
By taking the order of a food warehouse sorts as an example, Fig. 1 show the picking path schematic diagram of certain food warehouse.Such as figure
Shown in 1, in order to make sorter not retrace one's steps when carrying out picking, the picking path of depot maintenance personnel depaly is the U of diagram
Shape sequence.Sorter is every time when carrying out a single sorting of set, by according to from the position of the B1 of diagram points, according to U
Shape path is sorted through all the points to the position of B50 points.After the single commodity of a set sort, review packaging platform can be returned to
One of A1-A20, and the single picking task of next set is got, and go out again from the position of B1 points according to the picking path of configuration
Hair.Which review packaging platform sorter returns to, and is to overstock situation unified command according to review packaging platform by Field Force.Due to one
As in the case of, each packaging platform of checking is operated at full capacity, therefore the starting point of sorter substantially belongs to be uniformly distributed.
However, according to existing order sorting method, the sorting of order is carried out according to fixed picking sequence, then, when
After the commodity of sorting are thrown into leftmost review platform A1 by sorter, when carrying out the sorting of next order, then need from most
The position of the B1 points on the right starts picking, so the travel distance for resulting in sorter greatly increases, similarly, when sorter exists
When different starting point, distributing that set is single obviously to increase travel distance to sorter at random, commodity sort the time and are also extended,
So that the cost of commodity picking is high.
Invention content
In view of this, the present invention provides a kind of method, apparatus, electronic equipment and readable storage medium storing program for executing that distribution set is single,
By the sorting sequence of all commodity in shortest path first optimization set list to obtain the single optimal LK algorithm of set, and root
The sorter that set is singly distributed to different starting points according to optimal LK algorithm, can make sorter carry out the walking of order sorting
Distance is greatly decreased, and to improve the efficiency of order sorting, has saved the cost of logistics distribution.
To achieve the above object, according to an aspect of the invention, there is provided a kind of method that distribution set is single.
A method of distribution set is single, and each set singly indicates multiple cargos to be picked, different cargo positions
The different storage space in goods library, the distance between each storage space is it is known that and each the distance between dispensing position and each storage space
It is known that the sorter of the Unclaimed set list such as each is located at one of multiple described dispensing positions, the method passes through following
Step completes the distribution of each set single pair sorter：According to goods library database, determine indicated in the set list it is every
Storage space where a cargo, identified storage space constitute the single storage space collection of the set；Determine from each dispensing position through
It crosses the storage space and concentrates each storage space to complete the optimal path of picking, it is single most that identified optimal path constitutes the set
Good path set, wherein each optimal path that the optimal path is concentrated corresponds to a dispensing position；Select the optimal path
The shortest path of concentration；The set is singly distributed to the sorter positioned at the corresponding dispensing position of the shortest path.
Optionally, when the optimal path is concentrated, there are more than one shortest paths, then by random the set
Singly distribute to the sorter in the corresponding dispensing position of some shortest path in these shortest paths.
Optionally, the set sorter positioned at the corresponding dispensing position of the shortest path is singly distributed to also to wrap
It includes：The track route of the shortest path is exported to corresponding sorter.
Optionally it is determined that concentrating each storage space from each dispensing position by the storage space to complete the best of picking
Path further includes：The track route of each optimal path is adjusted so as to not include repeating part in the track route.
Optionally, determined using ant group algorithm concentrates each storage space with complete from each dispensing position by the storage space
At the optimal path of picking.
According to another aspect of the present invention, a kind of device that distribution set is single is provided.
A kind of device that distribution set is single, each set singly indicate multiple cargos to be picked, different cargo positions
The different storage space in goods library, the distance between each storage space is it is known that and each the distance between dispensing position and each storage space
It is known that the sorter of the Unclaimed set list such as each is located at one of multiple described dispensing positions, described device includes：Storage space
Determining module, it is identified for according to goods library database, determining the storage space where each cargo indicated in the set list
Storage space constitutes the single storage space collection of the set；Path determination module, for determining from each dispensing position by the storage
Each storage space is concentrated to complete the optimal path of picking in position, and identified optimal path constitutes the single optimal path of the set
Collection, wherein each optimal path that the optimal path is concentrated corresponds to a dispensing position；Path selection module, for selecting
State the shortest path of optimal path concentration；The single distribution module of set, for the set singly to be distributed to positioned at the shortest path
The sorter of the corresponding dispensing position of diameter.
Optionally, the single distribution module of the set is additionally operable to：The track route of the shortest path is exported to corresponding
Sorter.
Optionally, the path determination module is additionally operable to：The track route of each optimal path is adjusted so that the walking
Repeating part is not included in route.
Optionally, the path determination module is determined from each dispensing position using ant group algorithm by the storage space
Each storage space is concentrated to complete the optimal path of picking.
According to another aspect of the invention, a kind of electronic equipment is provided.
A kind of electronic equipment, including：At least one processor；And connect at least one processor communication
Memory；Wherein, the memory is stored with the instruction that can be executed by one processor, and described instruction is by described at least one
A processor executes, so that at least one processor executes the single method of distribution set provided by the present invention.
In accordance with a further aspect of the present invention, a kind of readable storage medium storing program for executing is provided.
A kind of non-transient computer readable storage medium, the non-transient computer readable storage medium storage computer refer to
It enables, the computer instruction is used to make the computer to execute the single method of distribution set provided by the present invention.
According to the technique and scheme of the present invention, it is determined from multiple and different dispensing positions, warp by shortest path first
Each storage space in set list where commodity is crossed to complete the optimal path of picking, and is concentrated apart from shortest according to optimal path
The set is singly distributed to corresponding sorter by the corresponding dispensing position in path, be may be implemented to sort from different location and be gathered
The optimal ordering of single all commodity；Meanwhile it according to the different location of sorter, being distributed from dispensing position travel distance for it
It is worth minimum set list, travel distance and the distribution of optimization set list of sorter can be greatly shortened, sorted to improve
The efficiency of order, has saved logistics cost.
Further effect possessed by above-mentioned non-usual optional mode adds hereinafter in conjunction with specific implementation mode
With explanation.
Description of the drawings
Attached drawing does not constitute inappropriate limitation of the present invention for more fully understanding the present invention.Wherein：
Fig. 1 is the picking path schematic diagram of certain existing food warehouse；
Fig. 2 is the key step schematic diagram of the single method of distribution set according to the ... of the embodiment of the present invention；
Fig. 3 is the implementation process schematic diagram of the ant group algorithm of the embodiment of the present invention；
Fig. 4 is the main modular schematic diagram of the single device of distribution set according to the ... of the embodiment of the present invention；
Fig. 5 is the hardware architecture diagram of the electronic equipment of the single method of distribution set according to the ... of the embodiment of the present invention.
Specific implementation mode
It explains to the exemplary embodiment of the present invention below in conjunction with attached drawing, including the various of the embodiment of the present invention
Details should think them only exemplary to help understanding.Therefore, those of ordinary skill in the art should recognize
It arrives, various changes and modifications can be made to the embodiments described herein, without departing from scope and spirit of the present invention.Together
The description to known function and structure is omitted for clarity and conciseness in sample in following description.
Fig. 2 is the key step schematic diagram of the single method of distribution set according to the ... of the embodiment of the present invention.In the present invention, each
Set singly indicates multiple cargos to be picked, and different cargos is located at storage space different in goods library, and the distance between each storage space is
Know, and each the distance between dispensing position and each storage space it is known that the single sorter of the Unclaimed set such as each positioned at more
One of a dispensing position.As shown in Fig. 2, the method for the distribution set list of the present invention is mainly including following step S21 to step
S24。
Step S21：According to goods library database, the storage space where each cargo indicated in set list is determined, it is identified
Storage space constitutes the storage space collection of the set list.Certain food warehouse as shown in Figure 1, wherein stored respectively in storage space B1-storage space B50
There is food (cargo), for the goods library, classification, the number of the corresponding food of each storage space are stored in the database of corresponding goods library
The related datas such as amount, date of manufacture.In order to save the time that sorter carries out picking, (can generally be had multiple according to scene
Body situation is adjusted, such as 20) be carried out at the same time picking with the order in warehouse, that is, by gather it is single in the form of carry out order
Picking.Single for each set, the storage space where each cargo in the set list can be obtained by goods library database, also,
Storage space in the set list where all cargos constitutes the storage space collection of the set list.
Step S22：It determines and concentrates each storage space from each dispensing position by the storage space to complete the best of picking
Path, identified optimal path constitute the optimal path collection of the set list, the wherein best road of each of optimal path concentration
Diameter corresponds to a dispensing position.Since sorter completes that after a single order of set sorts different review platform progress can be returned to
The review of order therefore, can be from different starting points, often when the order that sorter carries out a set list every time sorts
A starting point is a dispensing position.
Determine that it with the optimal path for completing picking is so-called to concentrate each storage space by storage space from each dispensing position
Traveling salesman problem, i.e., in non-directed graph the problem of determining shortest path, this is a np complete problem.Due to the solution of the problem
Have a wide range of applications in communications and transportation, circuit board line design and the fields such as logistics distribution, domestic and foreign scholars to its into
A large amount of research is gone.Exact algorithm method for solving includes：Branch and bound method, linear programming technique, dynamic programming etc..Approximation is calculated
Method or heuritic approach mainly have genetic algorithm, simulated annealing, ant group algorithm, tabu search algorithm, greedy algorithm and nerve
Network etc..
In the embodiment of the present invention, is determined using ant group algorithm and concentrate each storage from each dispensing position by storage space
Position is to complete the optimal path of picking.
Classical ant group algorithm process is as follows：Each ant is not telling their foods where premise in advance
Under begin look for food.After an ant finds food, it can be to a kind of volatile secretion pheromone of Environment release
(it is known as pheromones, which can gradually volatilize disappearances over time, and the size of pheromone concentration characterizes the remote of path
Closely) come what is realized, other ants are attracted to come, ants more and more in this way can find food.There is no pictures for some ants
Other ants equally always repeat same road, they can look for another way, if the road separately opened up is more than other original roads
It is short, then, gradually, more ants are attracted on this shorter road.It finally, may through running after a period of time
It will appear a shortest path to be repeated by most of ants.
In the embodiment of the present invention implementation principle of ant group algorithm approximately as：In the initial state, colony of ants is outgoing, this
When there is no pheromones, then one paths of selection that respectively will be random；In next state, every ant reaches different
Point leaves pheromones from initial point to these points, and ant continues to walk, and the ant for having arrived at target starts to return, with
This simultaneously, next group ant sets out, they can all be more likely to select according to how much selection routes of pheromones on each paths
It walks in path more than pheromones；Next one state has been arrived again, and the pheromones on route just passed through without ant are different degrees of
Vapor away, and enhance just past the route information element of ant, then set out a collection of ant again, repeat previous step
Suddenly, wherein the variation of each state to next state is known as an iteration, after iteration is multiple, a certain paths are just had
On pheromones be significantly more than other paths, this is usually exactly an optimal path.It can derive, in iteration enough times
After, algorithm can converge to optimal path.
In embodiments of the present invention, ant group algorithm is an iterative process, and core is：For optional a plurality of road
Diameter carries out the selection of walking path according to the select probability size of each path obtained after multiple walking.Meanwhile each iteration
In the process, the track route of selection may be also different.The select probability of each path can carry out more with iterations
Newly, " update " herein may include two kinds：Iteration successively decreases and selects to increase.Wherein, " iteration is successively decreased " refers to：All paths
Select probability can successively decrease as the incremental carry out of iterations is a certain proportion of, for example, for path ab from a point to point b, it can
Successively decreasing for select probability is realized according to formula T (n+1)=T (n) * k, wherein T (n+1) is that the selection after iteration n+1 times is general
Rate, T (n) are the select probability after iteration n times, and k is constant and 0<k<1." selection increases " refers to each iteration of ant group algorithm
After the completion, the select probability in the path of obtained distance minimum is subjected to a degree of increase, for example, for from a point to point b
Path ab, can realize the increase of select probability according to formula T (n+1)=T (n)+1/M, wherein T (n+1) be iteration n+1
Select probability after secondary, T (n) are the select probability after iteration n times, and M is obtained minimum range after iteration n times.In the present invention
In, select probability is the constant of a possibility size for indicating selection, and it is initial when, select probability all phases of each paths
Together, when select probability is identical, a paths can be randomly selected.
Fig. 3 is the implementation process schematic diagram of the ant group algorithm of the embodiment of the present invention.Using a dispensing position as starting point, lead to
It crosses ant group algorithm and obtains completing the process of the optimal path of the single picking of certain set as shown in figure 3, first confiring that algorithm parameter (step
S31), include mainly ant colony amount R and iterations N, wherein R is the number of nodes on circuit, be that is to say：It is each in this set list
The number of different storage space points residing for a commodity；Iterations are originally the bigger the better, but in actual operation, it is contemplated that algorithm is held
Capable efficiency, value range can generally be scheduled on 1 to 10 times of ant colony amount R.Later, corresponding number is carried out according to iterations N
Program iteration.Program iterative process is：Setting iterations first add 1 (step S32), and the current location with sorter is
Point is sent out, next storage space (step S33) is selected according to the select probability of each storage space, and so on, until each in the set list
Storage space where commodity is all passed through, to obtain R feasible path (step S34).Calculate the minimum range of the R feasible path
(step S35) then updates the select probability (step S36) of all feasible paths, in this way, completing an iteration.It
Afterwards, judge whether to meet preset iterations (step S37), if satisfied, then the corresponding path of the minimum range is
Optimal path (step S38), otherwise, iterations add 1 (step S32), continue iteration.
Finally, available from different dispensing positions by ant group algorithm, complete the best of identity set list picking
Path set and the optimal path concentrate the corresponding track route of optimal path for including.
Each storage space is concentrated to complete the optimal path of picking from each dispensing position by the storage space in addition, determining
Further include：The track route of each optimal path is adjusted so as to not include repeating part in track route.In order to make set list
Sorting is more reasonable, quick, some principles of optimality can also be arranged to advanced optimize ant group algorithm, such as：To having in path
The part repeated is adjusted, to make travel distance smaller.In specific implementation process, pass through the volume of pre-set storage space
Code sequence, can be according to the numeric order of each storage space point to determine whether there is overlapping route, certain food warehouse as shown in Figure 1,
Wherein share 50 storage spaces, respectively serial number be B1, B2 ..., B50.Such as obtain one set of ant group algorithm is single picks
Routing diameter is storage space B1, B4, B2, B7, therefore be can determine whether to there is overlapping route, need to carry out path optimization, and suitable according to storage space serial number
The sequence of storage space B1, B2, B4, B7 are optimized for after sequence sequence.In this way, can make not including unnecessary repeating portion in track route
Point, so as to more quickly complete the single picking of set.
Step S23：The shortest path for selecting the optimal path to concentrate.
Step S24：The set is singly distributed to the sorter positioned at the corresponding dispensing position of the shortest path.
Wherein, when the optimal path is concentrated, there are more than one shortest paths, then by random that the set is single
Distribute to the sorter in the corresponding dispensing position of some shortest path in these shortest paths.
It wherein, can be with when the set is singly distributed to positioned at the sorter of the corresponding dispensing position of the shortest path
The track route of the shortest path is exported to corresponding sorter, so that sorter can carry out the collection according to the path of output
Close single sorting.
According to above-mentioned step S21 to step S24, you can according to the starting point where sorter be its distribution from this
The set list that distance value minimum is walked in distribution is pointed out, so as to greatly shorten point of overall travel distance and optimization set list
Match.
Fig. 4 is the main modular schematic diagram of the single device of distribution set according to the ... of the embodiment of the present invention.As shown in figure 4, this
The device 40 that the distribution set of invention is single includes mainly storage space determining module 41, path determination module 42, path selection module 43
With set list distribution module 44.Wherein, each set singly indicates multiple cargos to be picked, and different cargos is located at goods library
Middle different storage space, the distance between each storage space it is known that and each the distance between dispensing position and each storage space it is known that often
The single sorter of the Unclaimed set such as a is located at one of multiple described dispensing positions.
Wherein, storage space determining module 41 is used to determine each cargo indicated in the set list according to goods library database
The storage space at place, identified storage space constitute the single storage space collection of the set；Path determination module 42 is for determining from each point
It sets out with position and concentrates each storage space by the storage space to complete the optimal path of picking, identified optimal path constitutes institute
The single optimal path collection of set is stated, wherein each optimal path that the optimal path is concentrated corresponds to a dispensing position；Path
The shortest path that selecting module 43 is used to that the optimal path to be selected to concentrate；The single distribution module 44 of set is used for the set is single
Distribute to the sorter positioned at the corresponding dispensing position of the shortest path.
According to the technique and scheme of the present invention, gather single distribution module 44 can be also used for：The walking of the shortest path
Route is exported to corresponding sorter.
Wherein, path determination module 42 can be also used for：The track route of each optimal path is adjusted so that the walking
Repeating part is not included in route.
In the present invention, path determination module 42 is determined from each dispensing position using ant group algorithm by the storage space
Each storage space is concentrated to complete the optimal path of picking.
According to an embodiment of the invention, the present invention also provides a kind of electronic equipment and a kind of readable storage medium storing program for executing.
The present invention electronic equipment include：At least one processor；And it is connect at least one processor communication
Memory；Wherein, the memory is stored with the instruction that can be executed by one processor, described instruction by it is described at least
One processor executes, so that at least one processor executes the single method of distribution set provided by the present invention.
The non-transient computer readable storage medium of the present invention, the non-transient computer readable storage medium storage calculate
Machine instructs, and the computer instruction is used to make the computer to execute the single method of distribution set provided by the present invention.
As shown in figure 5, being that the hardware configuration of the electronic equipment of the single method of distribution set according to the ... of the embodiment of the present invention shows
It is intended to.Such as Fig. 5, which includes：One or more processors 51 and memory 52, with a processor in Fig. 5
For 51.Wherein, memory 52 is non-transient computer readable storage medium provided by the present invention.
Distributing the electronic equipment of the single method of set can also include：Input unit 53 and output device 54.
Processor 51, memory 52, input unit 53 can be connected with output device 54 by bus or other modes,
In Fig. 5 for being connected by bus.
Memory 52 is used as a kind of non-transient computer readable storage medium, can be used for storing non-transient software program, non-
Transient computer executable program and module, such as the distribution set in the embodiment of the present invention, single corresponding program of method refers to
Order/module is (for example, attached storage space determining module 41 shown in Fig. 4, path determination module 42, path selection module 43 and set are single
Distribution module 44).Processor 51 is stored in non-transient software program, instruction and module in memory 52 by operation, from
And various function application and the data processing of execute server, that is, realize the side of the distribution set list in above method embodiment
Method.
Memory 52 may include storing program area and storage data field, wherein storing program area can storage program area,
At least one required application program of function；Storage data field can be stored to be created according to using for the single device of distribution set
Data etc..In addition, memory 52 may include high-speed random access memory, can also include non-transient memory, such as
At least one disk memory, flush memory device or other non-transient solid-state memories.In some embodiments, memory
52 it is optional include the memory remotely located relative to processor 51, these remote memories can pass through network connection to distributing
Gather single device.The example of above-mentioned network include but not limited to internet, intranet, LAN, mobile radio communication and
A combination thereof.
Input unit 53 can receive the number or character information of input, and generate the user of the device single with distribution set
Setting and the related key signals input of function control.Output device 54 may include that display screen etc. shows equipment.
One or more of modules are stored in the memory 52, when by one or more of processors 51
When execution, single method is gathered in the distribution executed in above-mentioned any means embodiment.
The said goods can perform the method that the embodiment of the present invention is provided, and has the corresponding function module of execution method and has
Beneficial effect.The not technical detail of detailed description in the present embodiment, reference can be made to the method that the embodiment of the present invention is provided.
Technical solution according to the ... of the embodiment of the present invention determines from multiple and different dispensing positions by shortest path first
Hair completes the optimal path of picking by gathering each storage space in list where commodity, and concentrates distance according to optimal path
The set is singly distributed to corresponding sorter by the corresponding dispensing position in shortest path, may be implemented to pick from different location
Selected works close the optimal ordering of single all commodity；Meanwhile according to the different location of sorter, go out distribution from dispensing position for its distribution
The set list for walking distance value minimum can greatly shorten travel distance and the distribution of optimization set list of sorter, to be promoted
The efficiency for sorting order, has saved logistics cost.
The technical solution of the embodiment of the present invention, by considering quantity on order, sorting person, storage space point and number of channels etc.
Factor can be planned as a whole to obtain the single generation of global preferably set and route optimization scheme.In practical applications, technology of the invention
Scheme can be applied to the business scenario etc. that the secondary storehouse of multiple warehouses, more waves receives order.
Above-mentioned specific implementation mode, does not constitute limiting the scope of the invention.Those skilled in the art should be bright
It is white, design requirement and other factors are depended on, various modifications, combination, sub-portfolio and replacement can occur.It is any
Modifications, equivalent substitutions and improvements made by within the spirit and principles in the present invention etc., should be included in the scope of the present invention
Within.
Claims (10)
1. a kind of method that distribution set is single, each set singly indicates multiple cargos to be picked, and different cargos is located at
Different storage space in goods library, the distance between each storage space it is known that and each the distance between dispensing position and each storage space
Knowing, the single sorter of the Unclaimed set such as each is located at one of multiple described dispensing positions, and the method is characterized in that,
The distribution of each set single pair sorter is completed by following step：
According to goods library database, determine that the storage space where each cargo indicated in the set list, identified storage space are constituted
The single storage space collection of the set；
It determines and concentrates each storage space to complete the optimal path of picking from each dispensing position by the storage space, determine
Optimal path constitute the single optimal path collection of the set, wherein each optimal path that the optimal path is concentrated corresponds to one
A dispensing position；
The shortest path for selecting the optimal path to concentrate；
The set is singly distributed to the sorter positioned at the corresponding dispensing position of the shortest path.
2. according to the method described in claim 1, it is characterized in that, the set is singly distributed to positioned at the shortest path pair
The sorter for the dispensing position answered further includes：The track route of the shortest path is exported to corresponding sorter.
3. according to the method described in claim 1, it is characterized in that, determining from each dispensing position by the storage space collection
In each storage space further include with the optimal path for completing picking：The track route of each optimal path is adjusted so that the walking road
Repeating part is not included in line.
4. according to the method described in claim 1, it is characterized in that, using ant group algorithm determine from each dispensing position through
It crosses the storage space and concentrates each storage space to complete the optimal path of picking.
5. a kind of device that distribution set is single, each set singly indicates multiple cargos to be picked, and different cargos is located at
Different storage space in goods library, the distance between each storage space it is known that and each the distance between dispensing position and each storage space
Knowing, the single sorter of the Unclaimed set such as each is located at one of multiple described dispensing positions, and described device is characterized in that,
Including：
Storage space determining module, for according to goods library database, determining the storage space where each cargo indicated in the set list,
Identified storage space constitutes the single storage space collection of the set；
Path determination module concentrates each storage space to complete picking for determining from each dispensing position by the storage space
Optimal path, identified optimal path constitutes the single optimal path collection of the set, wherein what the optimal path was concentrated
Each optimal path corresponds to a dispensing position；
Path selection module, the shortest path for selecting the optimal path to concentrate；
The single distribution module of set, for the set singly to be distributed to the picking positioned at the corresponding dispensing position of the shortest path
Member.
6. device according to claim 5, which is characterized in that the single distribution module of the set is additionally operable to：Described most short
The track route in path is exported to corresponding sorter.
7. device according to claim 5, which is characterized in that the path determination module is additionally operable to：Adjustment is each best
The track route in path is not so as to include repeating part in the track route.
8. device according to claim 5, which is characterized in that the path determination module is determined using ant group algorithm from every
A dispensing position is set out concentrates each storage space to complete the optimal path of picking by the storage space.
9. a kind of electronic equipment, which is characterized in that including：
At least one processor；And
The memory being connect at least one processor communication；Wherein,
The memory is stored with the instruction that can be executed by one processor, and described instruction is by least one processor
It executes, so that at least one processor perform claim requires the method described in any one of 1-4.
10. a kind of non-transient computer readable storage medium, which is characterized in that the non-transient computer readable storage medium is deposited
Store up computer instruction, the method that the computer instruction is used to that the computer perform claim to be made to require described in any one of 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710032382.XA CN108320041A (en) | 2017-01-16 | 2017-01-16 | Distribution set single method, apparatus, electronic equipment and readable storage medium storing program for executing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710032382.XA CN108320041A (en) | 2017-01-16 | 2017-01-16 | Distribution set single method, apparatus, electronic equipment and readable storage medium storing program for executing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108320041A true CN108320041A (en) | 2018-07-24 |
Family
ID=62891972
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710032382.XA Pending CN108320041A (en) | 2017-01-16 | 2017-01-16 | Distribution set single method, apparatus, electronic equipment and readable storage medium storing program for executing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108320041A (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109583660A (en) * | 2018-12-07 | 2019-04-05 | 陕西科技大学 | A kind of implementation method of dynamic order-picking policy |
| CN110274604A (en) * | 2018-11-06 | 2019-09-24 | 北京京东尚科信息技术有限公司 | Method and apparatus for generating routing information |
| CN110766348A (en) * | 2018-07-26 | 2020-02-07 | 北京京东振世信息技术有限公司 | Method and device for combining picking tasks |
| CN110826752A (en) * | 2018-08-09 | 2020-02-21 | 天津京东深拓机器人科技有限公司 | Collection list distribution method and device |
| WO2020063063A1 (en) * | 2018-09-29 | 2020-04-02 | 北京京东尚科信息技术有限公司 | Method, system, and apparatus for merging order goods and electronic device |
| CN111415122A (en) * | 2020-03-31 | 2020-07-14 | 北京京东振世信息技术有限公司 | Goods picking method and goods picking system |
| CN111553548A (en) * | 2019-02-12 | 2020-08-18 | 北京京东尚科信息技术有限公司 | Goods picking method and device |
| CN112132493A (en) * | 2020-11-30 | 2020-12-25 | 炬星科技（深圳）有限公司 | Order picking regulation and control method and robot |
| CN112149925A (en) * | 2019-06-26 | 2020-12-29 | 北京京东振世信息技术有限公司 | Warehousing task automatic allocation method and device, and warehousing management method and system |
| CN112990831A (en) * | 2021-04-27 | 2021-06-18 | 北京京东振世信息技术有限公司 | Vehicle scheduling method and device, electronic equipment and computer readable medium |
| CN113592199A (en) * | 2021-08-26 | 2021-11-02 | 南京希音电子商务有限公司 | Wave-order planning method utilizing roadway concentration and minimized set coverage |
| CN113642742A (en) * | 2020-04-26 | 2021-11-12 | 北京京东乾石科技有限公司 | Method and device for picking task combination |
| CN113762572A (en) * | 2020-10-29 | 2021-12-07 | 北京京东振世信息技术有限公司 | Logistics method, system, device, electronic equipment and storage medium thereof |
| CN113762570A (en) * | 2020-10-22 | 2021-12-07 | 北京京东振世信息技术有限公司 | Order picking task order forming method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101968860A (en) * | 2010-10-09 | 2011-02-09 | 北京物资学院 | Order sorting method and system |
| US20130151435A1 (en) * | 2011-12-13 | 2013-06-13 | International Business Machines Corporation | Automated Partitioning of Transportation Routing Problems |
| CN104809606A (en) * | 2015-04-29 | 2015-07-29 | 上海交通大学 | Warehouse management system with multi-guide-vehicle dispatching and distribution function |
| CN105354641A (en) * | 2015-11-12 | 2016-02-24 | 北京京东尚科信息技术有限公司 | Order picking path optimization method and order picking path optimization device |
-
2017
- 2017-01-16 CN CN201710032382.XA patent/CN108320041A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101968860A (en) * | 2010-10-09 | 2011-02-09 | 北京物资学院 | Order sorting method and system |
| US20130151435A1 (en) * | 2011-12-13 | 2013-06-13 | International Business Machines Corporation | Automated Partitioning of Transportation Routing Problems |
| CN104809606A (en) * | 2015-04-29 | 2015-07-29 | 上海交通大学 | Warehouse management system with multi-guide-vehicle dispatching and distribution function |
| CN105354641A (en) * | 2015-11-12 | 2016-02-24 | 北京京东尚科信息技术有限公司 | Order picking path optimization method and order picking path optimization device |
Non-Patent Citations (2)
| Title |
|---|
| 李哲: "物流中心拣选单处理及拣选路径优化研究", 《中国优秀硕士学位论文全文数据库 经济与管理科学辑》 * |
| 李随成等: "一种改进的TSP问题启发式算法", 《管理工程学报》 * |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110766348A (en) * | 2018-07-26 | 2020-02-07 | 北京京东振世信息技术有限公司 | Method and device for combining picking tasks |
| CN110766348B (en) * | 2018-07-26 | 2023-11-03 | 北京京东振世信息技术有限公司 | Method and device for combining goods picking tasks |
| CN110826752A (en) * | 2018-08-09 | 2020-02-21 | 天津京东深拓机器人科技有限公司 | Collection list distribution method and device |
| US11699130B2 (en) | 2018-09-29 | 2023-07-11 | Beijing Jingdong Shangke Information Technology Co., Ltd. | Method, system and device of accumulating order-goods, and electronic apparatus |
| WO2020063063A1 (en) * | 2018-09-29 | 2020-04-02 | 北京京东尚科信息技术有限公司 | Method, system, and apparatus for merging order goods and electronic device |
| CN110274604A (en) * | 2018-11-06 | 2019-09-24 | 北京京东尚科信息技术有限公司 | Method and apparatus for generating routing information |
| CN109583660A (en) * | 2018-12-07 | 2019-04-05 | 陕西科技大学 | A kind of implementation method of dynamic order-picking policy |
| CN111553548A (en) * | 2019-02-12 | 2020-08-18 | 北京京东尚科信息技术有限公司 | Goods picking method and device |
| CN111553548B (en) * | 2019-02-12 | 2024-05-17 | 北京京东振世信息技术有限公司 | Goods picking method and device |
| CN112149925A (en) * | 2019-06-26 | 2020-12-29 | 北京京东振世信息技术有限公司 | Warehousing task automatic allocation method and device, and warehousing management method and system |
| CN111415122A (en) * | 2020-03-31 | 2020-07-14 | 北京京东振世信息技术有限公司 | Goods picking method and goods picking system |
| CN111415122B (en) * | 2020-03-31 | 2023-12-05 | 北京京东振世信息技术有限公司 | Goods picking method and goods picking system |
| CN113642742A (en) * | 2020-04-26 | 2021-11-12 | 北京京东乾石科技有限公司 | Method and device for picking task combination |
| CN113762570A (en) * | 2020-10-22 | 2021-12-07 | 北京京东振世信息技术有限公司 | Order picking task order forming method and device |
| CN113762570B (en) * | 2020-10-22 | 2024-05-24 | 北京京东振世信息技术有限公司 | Method and device for sorting task group list |
| CN113762572A (en) * | 2020-10-29 | 2021-12-07 | 北京京东振世信息技术有限公司 | Logistics method, system, device, electronic equipment and storage medium thereof |
| CN113762572B (en) * | 2020-10-29 | 2024-04-16 | 北京京东振世信息技术有限公司 | Logistics method, system, device, electronic equipment and storage medium thereof |
| CN112132493B (en) * | 2020-11-30 | 2021-03-23 | 炬星科技（深圳）有限公司 | Order picking regulation and control method and robot |
| CN112132493A (en) * | 2020-11-30 | 2020-12-25 | 炬星科技（深圳）有限公司 | Order picking regulation and control method and robot |
| CN112990831A (en) * | 2021-04-27 | 2021-06-18 | 北京京东振世信息技术有限公司 | Vehicle scheduling method and device, electronic equipment and computer readable medium |
| CN113592199A (en) * | 2021-08-26 | 2021-11-02 | 南京希音电子商务有限公司 | Wave-order planning method utilizing roadway concentration and minimized set coverage |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108320041A (en) | Distribution set single method, apparatus, electronic equipment and readable storage medium storing program for executing | |
| Sahebjamnia et al. | Optimization of multi-period three-echelon citrus supply chain problem | |
| Cheikhrouhou et al. | A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy | |
| McFarlane et al. | Intelligent logistics: Involving the customer | |
| CN108805316B (en) | Cargo handling method and apparatus | |
| CN108345952A (en) | Generate set single method, apparatus, electronic equipment and readable storage medium storing program for executing | |
| Matusiak et al. | A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse | |
| Boysen et al. | Manual order consolidation with put walls: the batched order bin sequencing problem | |
| CN108764777A (en) | Electronic logistic car dispatching method with time window and system | |
| Yang et al. | An integrated optimization of location assignment and storage/retrieval scheduling in multi-shuttle automated storage/retrieval systems | |
| CN110428118A (en) | Order processing method and device, warehousing system and computer storage medium | |
| Kotowska et al. | Optimization of the supply of components for mass production with the use of the ant colony algorithm | |
| US10810542B2 (en) | Systems and methods for fulfilment design and optimization | |
| CN106447186B (en) | The method and device that transporting equipment task is distributed in a kind of intelligent storage | |
| CN104318423A (en) | Dynamic planning method and execution system for finished product warehouse entry progress | |
| WO2019090874A1 (en) | Single vehicle scheduling method for cargo collection and delivery | |
| Yousefikhoshbakht et al. | A mixed integer programming formulation for the heterogeneous fixed fleet open vehicle routing problem | |
| CN113240369A (en) | Goods sorting method, device, equipment and storage medium | |
| Yousefikhoshbakht et al. | A combination of modified tabu search and elite ant system to solve the vehicle routing problem with simultaneous pickup and delivery | |
| CN110276488A (en) | A kind of vehicle routing optimization method based on matrix in block form and fuzzy haulage time | |
| Schiffer et al. | Optimal picking policies in e-commerce warehouses | |
| Londoño et al. | A biased-randomized iterated local search for the vehicle routing problem with optional backhauls | |
| Man et al. | Bi-objective optimization for a two-depot automated storage/retrieval system | |
| Jiang | Solving multi-robot picking problem in warehouses: a simulation approach | |
| Kim et al. | Ant colony optimisation with random selection for block transportation scheduling with heterogeneous transporters in a shipyard |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180724 |
|
| RJ01 | Rejection of invention patent application after publication |