CN111598285B - Method, device, equipment and storage medium for determining picking path - Google Patents

Method, device, equipment and storage medium for determining picking path Download PDF

Info

Publication number
CN111598285B
CN111598285B CN201910125748.7A CN201910125748A CN111598285B CN 111598285 B CN111598285 B CN 111598285B CN 201910125748 A CN201910125748 A CN 201910125748A CN 111598285 B CN111598285 B CN 111598285B
Authority
CN
China
Prior art keywords
pick
picking
warehouse
common
goods
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.)
Active
Application number
CN201910125748.7A
Other languages
Chinese (zh)
Other versions
CN111598285A (en
Inventor
王野
陈灵潇
张朝东
王本玉
陈佳琦
金晶
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SF Technology Co Ltd
Original Assignee
SF Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by SF Technology Co Ltd filed Critical SF Technology Co Ltd
Priority to CN201910125748.7A priority Critical patent/CN111598285B/en
Publication of CN111598285A publication Critical patent/CN111598285A/en
Application granted granted Critical
Publication of CN111598285B publication Critical patent/CN111598285B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman 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

Abstract

The application discloses a method, a device, equipment and a storage medium for determining a picking path, wherein the method comprises the following steps: acquiring pick bin location information, wherein the pick bin location information comprises heavy bin location information and first common bin location information; determining the shortest distance between any two pick-up positions according to the pick-up position information; determining a picking path according to the shortest distance between any two picking warehouse positions, wherein the picking path meets the following conditions: the sum of the distances between all two pick-up locations is the smallest, and the first common location is connected with the pick-up origin, and the first common location is connected with the restock location. In the method, the pick path meets the minimum sum of the distances between all two pick warehouse positions, so that the walking distance of an executor can be reduced, and the pick efficiency is improved.

Description

Method, device, equipment and storage medium for determining picking path
Technical Field
The present invention relates generally to the field of logistics, and more particularly, to a method, apparatus, device, and storage medium for determining a pick path.
Background
With the development of electronic commerce, logistics plays an important role in electronic commerce. In the logistics, the operation time of picking accounts for about 30% -40% of the whole distribution operation time, so that optimizing the picking path plays an important role in improving the whole distribution operation efficiency.
In the prior art, only the shortest picking path is considered when optimizing the picking path, which may lead to picking heavy goods at heavy warehouse sites in heavy goods areas, and when transporting heavy goods, the walking speed of staff is reduced, resulting in reduced picking efficiency.
Disclosure of Invention
In view of the foregoing drawbacks or shortcomings of the prior art, it is desirable to provide a method, apparatus, device, and storage medium for determining a pick path.
In a first aspect, the present invention provides a method for determining a pick path, comprising:
acquiring pick-up bin location information, wherein the pick-up bin location information comprises heavy-load bin location information and first common bin location information;
determining the shortest distance between any two pick-up positions according to the pick-up position information;
determining the picking path according to the shortest distance between any two picking warehouse positions, wherein the picking path meets the following conditions: the sum of the distances between all the two picking positions is minimum, and the first common position is connected with the picking start point and the first common position is connected with the heavy goods position.
In one embodiment, the pick path also satisfies: the heavy goods warehouse location is connected with the goods picking terminal point.
In one embodiment, the pick-up location information further includes second general location information, the pick path further satisfying: the heavy goods warehouse location is connected with a second common warehouse location, and the second common warehouse location is connected with a goods picking terminal.
In one embodiment, the pick path satisfies the following constraints:
in the picking path, any one picking position is directly connected with other two other picking positions.
In one embodiment, the pick path satisfies the following constraints:
the pick path meets the limit of the vending man problem TSP.
In one embodiment, the heavy load location information includes weight information of heavy load location stored items, the weight of the heavy load location stored items being greater than a weight threshold.
In a second aspect, the present invention provides a pick path determination device, comprising:
the system comprises an acquisition module, a storage management module and a storage management module, wherein the acquisition module is used for acquiring the information of the pick-up storage, and the information of the pick-up storage comprises information of a heavy storage and information of a first common storage;
the first determining module is used for determining the shortest distance between any two pick-up positions according to the pick-up position information;
the second determining module is used for determining the picking path according to the shortest distance between any two picking warehouse positions, wherein the picking path meets the following conditions: the sum of the distances between all the two picking positions is minimum, and the first common position is connected with the picking start point and the first common position is connected with the heavy goods position.
In one embodiment, the pick path also satisfies: the heavy goods warehouse location is connected with the goods picking terminal point.
In a third aspect, embodiments of the present application provide a computer device, including a memory storing a computer program and a processor, the processor implementing any of the above-described pick path optimization methods when executing the computer program.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium having a computer program stored thereon, which when executed by a processor, implements the pick path optimization method of any of the above.
According to the goods picking path optimization method, device, equipment and storage medium, the first common bin is connected with the goods picking starting point, then an operator picks the goods in the first common bin firstly, the first common bin is connected with the heavy goods bin, after the operator picks the goods in the first common bin, the operator starts to pick the goods in the heavy goods bin, so that the goods in the heavy goods bin are picked later, the goods in the heavy goods bin are picked earlier, the travelling speed of the operator is not reduced, accordingly, the goods picking efficiency can be improved, the distance sum between all the two goods picking bins is minimum, the travelling distance of the operator is reduced, and the goods picking efficiency is further improved.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the following drawings, in which:
FIG. 1 is a flow chart of a method for determining a pick path according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a pick-path determining apparatus according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The present application is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be noted that, for convenience of description, only the portions related to the invention are shown in the drawings.
It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other. The present application will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
As mentioned in the background art, in the prior art, only the shortest picking path is considered when optimizing the picking path, which may result in picking heavy goods at heavy warehouse sites in heavy goods areas first, and in transporting heavy goods, the walking speed of staff is reduced, resulting in reduced picking efficiency. Accordingly, it is desirable to have a method of order picking path determination that can improve order picking efficiency.
Referring to FIG. 1, an exemplary flow chart of a method of pick path determination according to one embodiment of the present application is shown.
As shown in fig. 1, in step 110, pick bin level information is obtained, wherein the pick bin level information includes restock bin level information and first general bin level information.
Specifically, at least one row of shelves is arranged in the warehouse for storing cargoes, and each row of shelves further comprises at least one picking warehouse position, wherein the picking warehouse position comprises a heavy warehouse position and a first common warehouse position. The picking warehouse location may also include special warehouse locations, such as seafood warehouse locations, fruit warehouse locations, etc. for goods that require special storage.
Each pick bin location information includes location information of each pick bin location within the warehouse, wherein the restock bin location information includes location information of restock locations storing restock items within the warehouse, and the first general bin location information includes location information of first general bins storing general items within the warehouse. The heavy goods storage position information may further include weight information of the heavy goods storage position stored goods, the weight of the heavy goods storage position stored goods is greater than a weight threshold value, the first common storage position information may further include weight information of the first common storage position stored goods, the weight of the first common storage position stored goods is less than or equal to the weight threshold value, and the weight threshold value may be set according to a specific application scenario or application requirement, for example, may be set to 10kg.
In step 120, the shortest distance between any two pick levels is determined according to the pick level information.
Specifically, according to the above-mentioned information of the picking positions including the position information of the picking positions in the warehouse, the distance between any two picking positions can be calculated according to the position information of each picking position in the warehouse. In the warehouse, an operator has multiple walking modes from any one picking warehouse position to any other picking warehouse position, namely multiple walking distances, and among the multiple walking distances, the walking distance corresponding to one walking mode is the shortest distance, and the shortest distance is determined as the shortest distance between two picking warehouse positions.
In step 130, determining the picking path according to the shortest distance between any two picking positions, wherein the picking path satisfies: the sum of the distances between all the two picking positions is minimum, and the first common position is connected with the picking start point and the first common position is connected with the heavy goods position.
Specifically, in one pick, the operator needs to walk between multiple pick levels in the warehouse, so that the pick path is the shortest, and the sum of distances between all two pick levels is the smallest, that is, the distance between any two pick levels is the shortest among multiple pick levels that the operator needs to walk in the warehouse.
Assume that the ith pick-up bin and the jth pick-up bin are connected to x ij Wherein x is ij =0 is that the ith pick bin and the jth pick bin are not connected, x ij The number of the goods-picking positions is i, j E T, i is not equal to j, T is the collection of the goods-picking positions, and the shortest distance between any two goods-picking positions i and j is d ij The sum of the distances between all two pick-up locations is minimized by:
Figure BDA0001973529690000051
as mentioned in the background art, if the heavy goods in the heavy goods area are picked first during the picking process, so that when other goods are picked, it is necessary to push or pull the heavy goods all the time, the walking speed of the executor will be reduced.
Assuming that the pick start point is s, s e T, T is a set of pick stock positions, one of the first common stock positions is a, a e U1, U1 is a set of first common stock positions, and then one of the first common stock positions is connected with the pick start point as follows:
Figure BDA0001973529690000052
assuming that one of the first common base is a, a e U1, U1 is a set of the first common base, one of the heavy base is b, b e V, V is a set of the heavy base, then one of the first common base and one of the heavy base are connected as follows:
Figure BDA0001973529690000053
in this embodiment, the first general bin is connected with the pick-up start point, the first general bin is picked up by the operator first, the first general bin is connected with the heavy goods bin, and when the operator picks up the goods of the first general bin, the pick-up of the goods of the heavy goods bin is started, so that the later pick-up of the goods of the heavy goods bin is completed, the earlier pick-up of the goods of the heavy goods bin is not carried out, the travelling speed of the operator is not reduced, and therefore compared with the earlier pick-up of the goods of the heavy goods bin, the pick-up efficiency can be improved, and the pick-up path meets the minimum sum of the distances between all the two pick-up bins, so that the travelling distance of the operator is reduced, and the pick-up efficiency is further improved.
In one embodiment, if the pick-up location includes only a first general location and a heavy location, the pick path further satisfies: the heavy goods warehouse location is connected with the goods picking terminal.
Assuming that the picking end point is e, e epsilon T, T is a collection of picking stock positions, one of the stock positions in the heavy stock positions is b, b epsilon V, V is a collection of the heavy stock positions, and then one of the stock positions in the heavy stock positions is connected with the picking end point as follows:
Figure BDA0001973529690000061
in another embodiment, if the pick-up location information includes not only the first general location information and the restock location information, but also the second general location information, the pick path described above is satisfied, the restock location is connected to the second general location, and the second general location is connected to the pick destination. In the actual warehouse, the heavy goods warehouse position is positioned between two common warehouse positions, namely, the goods in one common warehouse position need to be picked firstly, then the goods in the heavy goods warehouse position are picked, and finally the goods in the other common warehouse position are picked, so that the walking distance of an executor can be reduced.
The second common base information is the same as the first common base information, and may include weight information of the second common base for storing the goods, where the weight of the second common base for storing the goods is also less than or equal to a weight threshold, and the weight threshold is set to be the same as the weight threshold.
Assuming that the picking end point is e, e epsilon T, T is a collection of picking stock positions, one of the heavy stock positions is b, b epsilon V, V is a collection of heavy stock positions, one of the second common stock positions is c, c epsilon U2, U2 is a collection of second common stock positions, and then one of the heavy stock positions and one of the second common stock positions are connected as follows:
Figure BDA0001973529690000062
one of the second common stock positions is connected with the picking end point as follows:
Figure BDA0001973529690000063
in one embodiment, the pick path satisfies the following constraints: in the pick path, any one pick-up location is directly connected to only two other pick-up locations.
Assuming that any one pick bin is j, the other two pick bins are i and k, i, j, k e T, i not equal to j not equal to k, and T is the set of pick bins, then any pick bin is directly connected with only the other two pick bins as follows:
Figure BDA0001973529690000064
in this embodiment, the order picking path is satisfied that any one order picking position is directly connected with other two order picking positions, and when an operator picks an order, the operator can move from one order picking position to the second order picking position, from the second order picking position to the third order picking position, and from the fourth order picking position to the second order picking position, and from the second order picking position to the fifth order picking position, so that the walking distance of the operator can be reduced, and the order picking efficiency is improved.
In one embodiment, the pick path satisfies the following constraints: the pick path meets the limit of the vending man problem TSP.
Specifically, the pick path satisfies the constraint of the vending man problem TSP, which is a minimum solving method in which the selected path is a path where there is no duplicate path among all paths, i.e., all pick stations in the pick path are connected, and no small loop exists.
Assuming se:Sub>A total of 6 pick-up bins A, B, C, D, E, F in the warehouse, the constituent pick-up paths cannot include paths with small loops such as A-B-C-A, the pick-up paths should be paths with the 6 pick-up bins on the same pick-up path such as A-C-D-B-F-E.
Assuming that the collection of pick-up levels is T, the subset S is included in the collection of pick-up levels T,
Figure BDA0001973529690000073
Figure BDA0001973529690000074
Figure BDA0001973529690000071
whether the ith pick-up bin and the jth pick-up bin of subset S are connected as x ij Wherein x is ij =0 is that the ith pick bin and the jth pick bin are not connected, x ij When =1 is that the ith pick bin is connected to the jth pick bin, i, j e S, i+.j, the pick path satisfies the limit of vending man problem TSP:
Figure BDA0001973529690000072
in this embodiment, the constraint vending man problem is used to solve the optimal solution as the preferred result of the pick path including the heavy stock level.
The minimum sum of the distances between the two picking warehouse positions can be solved by adopting solvers such as Cplex, gruobi and the like, and heuristic algorithms such as tabu search, simulated annealing, genetic algorithm and the like can be applied to solve under the condition of comprising each constraint condition. After calculation, outputting the detailed order information of the order picking positions in the order picking position collection, wherein the order picking position operation sequence information comprises a first common position, a second common position and a second common position if the order picking position is included in the order picking position collection, and the order picking position operation sequence information comprises the first common position, the order picking position is re-selected, and the second common position is finally selected.
Fig. 2 is a schematic structural diagram of a pick path determining device 200 according to an embodiment of the present invention. As shown in fig. 2, the apparatus may implement the method shown in fig. 1, and the apparatus may include:
an obtaining module 210, configured to obtain pick-up location information, where the pick-up location information includes heavy-load location information and first general location information;
a first determining module 220, configured to determine a shortest distance between any two pick-up locations according to the pick-up location information;
a second determining module 230, configured to determine the picking path according to the shortest distance between the arbitrary two picking stations, where the picking path satisfies: the sum of the distances between all the two picking positions is minimum, and the first common position is connected with the picking start point and the first common position is connected with the heavy goods position.
Optionally, the pick path further satisfies: the heavy goods warehouse location is connected with the goods picking terminal point.
Optionally, the pick-up location information further includes second general location information, and the pick path further satisfies: the heavy goods warehouse location is connected with a second common warehouse location, and the second common warehouse location is connected with a goods picking terminal.
Optionally, the pick path satisfies the following constraints: in the picking path, any one picking position is directly connected with other two other picking positions.
Optionally, the pick path satisfies the following constraints: the pick path meets the limit of the vending man problem TSP.
Optionally, the heavy load location information includes weight information of heavy load location stored items, the weight of the heavy load location stored items being greater than a weight threshold.
The order picking path determining device provided in this embodiment may execute the embodiment of the method, and its implementation principle and technical effects are similar, and will not be described herein.
Fig. 3 is a schematic structural diagram of a computer device according to an embodiment of the present invention. As shown in fig. 3, a schematic diagram of a computer system 300 suitable for use in implementing a terminal device or server of an embodiment of the present application is shown.
As shown in fig. 3, the computer system 300 includes a Central Processing Unit (CPU) 301 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 302 or a program loaded from a storage section 308 into a Random Access Memory (RAM) 303. In the RAM 303, various programs and data required for the operation of the system 300 are also stored. The CPU 301, ROM 302, and RAM 303 are connected to each other through a bus 304. An input/output (I/O) interface 306 is also connected to bus 304.
The following components are connected to the I/O interface 305: an input section 306 including a keyboard, a mouse, and the like; an output portion 307 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, a speaker, and the like; a storage section 308 including a hard disk or the like; and a communication section 309 including a network interface card such as a LAN card, a modem, or the like. The communication section 309 performs communication processing via a network such as the internet. The driver 310 is also connected to the I/O interface 306 as needed. A removable medium 311 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed on the drive 310 as needed, so that a computer program read therefrom is installed into the storage section 308 as needed.
In particular, according to embodiments of the present disclosure, the process described above with reference to fig. 1 may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing the pick path determination method described above. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 309, and/or installed from the removable medium 311.
The flowcharts 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 and/or flowchart illustration, and combinations of blocks in the block diagrams and/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 units or modules described in the embodiments of the present application may be implemented by software, or may be implemented by hardware. The described units or modules may also be provided in a processor. The names of these units or modules do not in some way constitute a limitation of the unit or module itself.
As another aspect, the present application also provides a computer-readable storage medium, which may be a computer-readable storage medium contained in the foregoing apparatus in the foregoing embodiment; or may be a computer-readable storage medium, alone, that is not assembled into a device. The computer-readable storage medium stores one or more programs for use by one or more processors in performing the pick path determination methods described herein.
The foregoing description is only of the preferred embodiments of the present application and is presented as a description of the principles of the technology being utilized. It will be appreciated by persons skilled in the art that the scope of the invention referred to in this application is not limited to the specific combinations of features described above, but it is intended to cover other embodiments in which any combination of features described above or equivalents thereof is possible without departing from the spirit of the invention. Such as the above-described features and technical features having similar functions (but not limited to) disclosed in the present application are replaced with each other.

Claims (9)

1. A method of determining a pick path, comprising:
acquiring pick-up bin location information, wherein the pick-up bin location information comprises heavy-load bin location information and first common bin location information; the heavy goods warehouse position information comprises position information of a heavy goods warehouse of heavy goods and weight information of the heavy goods, wherein the position information of the heavy goods warehouse of the heavy goods is stored, and the weight of the heavy goods is larger than a weight threshold value; the first common bin information comprises position information of a first common bin for storing common goods in a warehouse and weight information of the common goods, and the weight of the common goods is smaller than or equal to a weight threshold value;
determining the shortest distance between any two pick-up positions according to the pick-up position information;
determining the picking path according to the shortest distance between any two picking warehouse positions, wherein the picking path meets the following conditions: the first common warehouse location is connected with the picking start point, and the first common warehouse location is connected with the heavy warehouse location; and picking the common goods stored in the first common warehouse position, and then picking the heavy goods stored in the heavy goods warehouse position, wherein the sum of the distances between the two warehouse positions is the smallest.
2. The pick path determination method of claim 1, wherein the pick path further satisfies: the heavy goods warehouse location is connected with the goods picking terminal point.
3. The method of claim 1, wherein the pick-up location information further comprises second general location information,
the pick path also satisfies: the heavy goods warehouse location is connected with a second common warehouse location, and the second common warehouse location is connected with a goods picking terminal.
4. A method of determining a pick path as claimed in any one of claims 1 to 3, wherein the pick path meets the following constraints:
in the picking path, any one picking position is directly connected with other two other picking positions.
5. A method of determining a pick path as claimed in any one of claims 1 to 3, wherein the pick path meets the following constraints:
the pick path meets the limit of the vending man problem TSP.
6. A pick path determination device, comprising:
the system comprises an acquisition module, a storage management module and a storage management module, wherein the acquisition module is used for acquiring the information of the pick-up storage, and the information of the pick-up storage comprises information of a heavy storage and information of a first common storage; the heavy goods warehouse position information comprises position information of a heavy goods warehouse of heavy goods and weight information of the heavy goods, wherein the position information of the heavy goods warehouse of the heavy goods is stored, and the weight of the heavy goods is larger than a weight threshold value; the first common bin information comprises position information of a first common bin for storing common goods in a warehouse and weight information of the common goods, and the weight of the common goods is smaller than or equal to a weight threshold value;
the first determining module is used for determining the shortest distance between any two pick-up positions according to the pick-up position information;
the second determining module is used for determining the picking path according to the shortest distance between any two picking warehouse positions, wherein the picking path meets the following conditions: the first common warehouse location is connected with the picking start point, and the first common warehouse location is connected with the heavy warehouse location; and picking the common goods stored in the first common warehouse position, and then picking the heavy goods stored in the heavy goods warehouse position, wherein the sum of the distances between the two warehouse positions is the smallest.
7. The pick path determination device of claim 6, wherein the pick path further satisfies: the heavy goods warehouse location is connected with the goods picking terminal point.
8. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the method of any of claims 1-5 when executing the computer program.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the method of any of claims 1-5.
CN201910125748.7A 2019-02-20 2019-02-20 Method, device, equipment and storage medium for determining picking path Active CN111598285B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910125748.7A CN111598285B (en) 2019-02-20 2019-02-20 Method, device, equipment and storage medium for determining picking path

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910125748.7A CN111598285B (en) 2019-02-20 2019-02-20 Method, device, equipment and storage medium for determining picking path

Publications (2)

Publication Number Publication Date
CN111598285A CN111598285A (en) 2020-08-28
CN111598285B true CN111598285B (en) 2023-06-30

Family

ID=72184802

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910125748.7A Active CN111598285B (en) 2019-02-20 2019-02-20 Method, device, equipment and storage medium for determining picking path

Country Status (1)

Country Link
CN (1) CN111598285B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003078281A1 (en) * 2002-03-18 2003-09-25 Deutsche Post Ag Method and device for picking goods
CN103632026A (en) * 2012-08-28 2014-03-12 纽海信息技术（上海）有限公司 Order picking method and system
CN108460133A (en) * 2018-03-05 2018-08-28 吉林化工学院 The method and shopper device of shopping guide are carried out using mobile terminal
CN108921327A (en) * 2018-06-06 2018-11-30 北京极智嘉科技有限公司 Shelf method for carrying, apparatus and system applied to goods to people's system
CN108921464A (en) * 2018-06-01 2018-11-30 深圳大学 A kind of picking path generating method, storage medium and terminal device

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003078281A1 (en) * 2002-03-18 2003-09-25 Deutsche Post Ag Method and device for picking goods
CN103632026A (en) * 2012-08-28 2014-03-12 纽海信息技术（上海）有限公司 Order picking method and system
CN108460133A (en) * 2018-03-05 2018-08-28 吉林化工学院 The method and shopper device of shopping guide are carried out using mobile terminal
CN108921464A (en) * 2018-06-01 2018-11-30 深圳大学 A kind of picking path generating method, storage medium and terminal device
CN108921327A (en) * 2018-06-06 2018-11-30 北京极智嘉科技有限公司 Shelf method for carrying, apparatus and system applied to goods to people's system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
某电子元器件分销配送中心的货位优化研究;郭有俊;《企业技术开发》;20130326(第09期);第6-9页 *

Also Published As

Publication number Publication date
CN111598285A (en) 2020-08-28

Similar Documents

Publication Publication Date Title
Bortfeldt et al. Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
CN106980955B (en) Method and apparatus for outputting information
CN107103445B (en) Information processing method and device
CN110197350B (en) Article delivery method and device
Parragh et al. Variable neighborhood search for the dial-a-ride problem
CN110533353B (en) Method and device for handling shelves
CN109658018B (en) Method and device for improving warehousing and ex-warehouse efficiency
CN108510095B (en) Method and device for determining goods picking path
CN109840729B (en) Method and system for positioning bin, storage medium and electronic equipment
EP1357497A1 (en) Stock planning method
CN112184348A (en) Order data processing method and device, electronic equipment and medium
CN116562770A (en) Information sequence storage method, apparatus, electronic device, and computer readable medium
CN111598285B (en) Method, device, equipment and storage medium for determining picking path
CN113650997B (en) Article warehouse-out positioning method and device
CN110871980A (en) Storage position classification method and device
CN113393193A (en) Warehouse-out method and device
CN111428902B (en) Method and device for determining transport route
CN116307573A (en) Green energy-saving treatment method, equipment and medium for building site materials
CN112474368B (en) Goods picking method, device, equipment and computer readable medium
CN113450043B (en) Goods picking method, device, electronic equipment and medium
CN113642961A (en) Monitoring method and device in cargo carrying process
CN113689140A (en) Method and device for task scheduling
CN113804206A (en) Path planning method and device, electronic equipment and computer readable medium
CN112785212A (en) Transportation equipment management method and device
CN110276508B (en) Method and device for distributing task information

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
GR01 Patent grant
GR01 Patent grant