Pickup location configuration method, device, equipment and storage medium

By generating and merging the removal paths, dynamically configuring the pickup location of the supply warehouse, solving the problem of chaotic pickup locations provided by the supply warehouse to the carrier vehicles and improving the pickup efficiency.

CN113780647BActive Publication Date: 2024-11-12HANGZHOU PINPIANYI NETWORK TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111024433.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-09-02
Publication Date
2024-11-12
Estimated Expiration
2041-09-02

AI Technical Summary

Technical Problem

In the store order mode, the pickup location provided by the supply warehouse to the carrier vehicle is chaotic, resulting in inefficient pickup efficiency, and the carrier vehicle needs to wait for a long time to complete the pickup.

Method used

By responding to the pickup request signal from the driver terminal of the carrier vehicle, the pickup arrival time arrives at the supply warehouse, query the logistics order to obtain the product SKU and quantity, generate a one-way removal path and duration, calculate the removal start time, and merge the overlapping paths To configure the pickup location of the supply warehouse.

Benefits of technology

It realizes dynamic and intelligent configuration based on the arrival of carrier vehicles and supply of supply warehouses, and improves pickup efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113780647B_ABST
    Figure CN113780647B_ABST
Patent Text Reader

Abstract

The present application discloses a method, device, equipment and storage medium for configuring a pickup location. Among other things, the pickup location configuration method includes: generating the pickup arrival time of the carrier vehicle at the pickup location of the supply warehouse; obtaining the product SKUs and corresponding pickup quantities included in this pickup according to the logistics order; generating the corresponding one-way delisting path and one-way delisting duration; calculating the corresponding one-way delisting start time; merging the one-way delisting paths whose one-way delisting start time is within the set time length and whose delisting paths overlap to generate a combined delisting path; configuring the pickup location of the supply warehouse according to the combined delisting path and the product SKUs and corresponding pickup quantities included therein. The benefit of the present application is that intelligent pickup location configuration is achieved by estimating the arrival time of the carrier vehicle that is about to arrive and the delisting time of the supply warehouse and regenerating a combined delisting path planning.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a pickup location configuration method, device, equipment and storage medium. Background Art

[0002] like Figure 1 As shown, in the related technology, orders from multiple stores are aggregated through an Internet platform, and then unified procurement and logistics pickup are carried out from suppliers, and then the carrier vehicles deliver to the corresponding stores according to the purchase orders, so as to reduce the warehousing costs of stores such as convenience stores and improve procurement flexibility.

[0003] Due to the above-mentioned store group ordering model, the supply warehouse needs to face multiple carrier vehicles. There is often confusion in the pickup locations provided by the supply warehouse to the carrier vehicles. The goods of the carrier vehicle that arrives at the pickup location first have not been taken off the shelves, or the goods prepared by the supply warehouse occupy the pickup location, but the carrier vehicle has not reached the pickup location, resulting in low pickup efficiency. Most carrier vehicles need to wait for a considerable amount of time in the supply warehouse to complete the pickup. Summary of the invention

[0004] The content of this application is used to introduce concepts in a brief form, which will be described in detail in the detailed implementation section below. The content of this application is not intended to identify the key features or essential features of the technical solution claimed for protection, nor is it intended to limit the scope of the technical solution claimed for protection.

[0005] Some embodiments of the present application propose a pickup location configuration method, device, electronic device, and computer storage medium to solve the technical problems mentioned in the above background technology section.

[0006] As the first aspect of the present application, some embodiments of the present application provide a method for configuring a pickup location, including: in response to a pickup request signal issued by a driver terminal of a carrier vehicle, generating a pickup arrival time of the carrier vehicle at a pickup location of a supply warehouse; querying the logistics order included in the current pickup of the driver terminal of the carrier vehicle, and obtaining the product SKUs and corresponding pickup quantities included in this pickup according to the logistics order; generating a corresponding one-way delisting path and a one-way delisting duration according to the product SKUs and corresponding pickup quantities of the carrier vehicle; calculating a corresponding one-way delisting start time according to the pickup arrival time and the one-way delisting duration; merging the one-way delisting paths whose one-way delisting start times are within a set time length and whose delisting paths overlap to generate a merged delisting path; configuring the pickup location of the supply warehouse according to the merged delisting path, the product SKUs contained therein, and the corresponding pickup quantities, and feeding back to the driver terminal of the carrier vehicle.

[0007] As a second aspect of the present application, some embodiments of the present application provide a pickup location configuration device, including: a response module, which is used to generate a pickup arrival time of the carrier vehicle at the pickup location of the supply warehouse in response to a pickup request signal issued by the driver terminal of the carrier vehicle; a query module, which is used to query the logistics order contained in the current pickup by the driver terminal of the carrier vehicle, and obtain the product SKU and the corresponding pickup quantity contained in this pickup according to the logistics order; a generation module, which is used to generate a corresponding one-way delisting path and a one-way delisting time according to the product SKU and the corresponding pickup quantity of the carrier vehicle; a calculation module, which is used to calculate the corresponding one-way delisting start time according to the pickup arrival time and the one-way delisting time; a merging module, which is used to merge the one-way delisting paths whose one-way delisting start time is within a set time length and whose delisting paths overlap to generate a merged delisting path; a configuration module, which is used to configure the pickup location of the supply warehouse according to the merged delisting path and the product SKUs and corresponding pickup quantities contained therein, and feed back to the driver terminal of the carrier vehicle.

[0008] As the third aspect of the present application, some embodiments of the present application provide an electronic device, comprising: one or more processors; a storage device on which one or more programs are stored, and when the one or more programs are executed by one or more processors, the one or more processors implement the method described in any implementation manner of the above-mentioned first aspect.

[0009] As a fourth aspect of the present application, some embodiments of the present application provide a computer storage medium on which a computer program is stored, wherein when the program is executed by a processor, the method described in any implementation manner of the above-mentioned first aspect is implemented.

[0010] The beneficial effect of the present application is that by estimating the arrival time of the carrier vehicle and the take-off time of the supply warehouse and regenerating a combined take-off path planning, it is possible to complete intelligent pickup location configuration based on the arrival of the carrier vehicle and the supply dynamics of the supply warehouse. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The drawings constituting a part of this application are used to provide a further understanding of this application, so that other features, purposes and advantages of this application become more obvious. The illustrative embodiment drawings and their descriptions of this application are used to explain this application and do not constitute an improper limitation on this application.

[0012] In addition, throughout the drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and that the components and elements are not necessarily drawn to scale.

[0013] In the attached picture:

[0014] Figure 1 It is a schematic diagram of a mode of "group buying" by a store in the related art;

[0015] Figure 2 is a flow chart of a method for configuring a pickup location according to an embodiment of the present application;

[0016] Figure 3 It is a flowchart of some steps of a method for configuring a pickup location according to an embodiment of the present application;

[0017] Figure 4 is a flowchart of another part of the steps of the pickup location configuration method according to an embodiment of the present application;

[0018] Figure 5 is a flowchart of another part of the steps of the pickup location configuration method according to an embodiment of the present application;

[0019] Figure 6 is a flowchart of another part of the steps of the pickup location configuration method according to an embodiment of the present application;

[0020] Figure 7 is a structural diagram of a pickup location configuration device according to an embodiment of the present application;

[0021] Figure 8 is a schematic structural diagram of an electronic device according to an embodiment of the present application;

[0022] Fig. 9 It is an operating interface of a driver terminal according to an embodiment of the present application. DETAILED DESCRIPTION

[0023] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments set forth herein. On the contrary, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0024] It should also be noted that, for ease of description, only the parts related to the invention are shown in the drawings. In the absence of conflict, the embodiments and features in the embodiments of the present disclosure can be combined with each other.

[0025] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0026] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0027] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0028] The present disclosure will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

[0029] Reference Figure 2 As shown, a pickup location configuration method according to an embodiment of the present application includes the following steps:

[0030] S1: In response to a pickup request signal sent by a driver terminal of a carrier vehicle, a pickup arrival time of the carrier vehicle arriving at a pickup location of a supply warehouse is generated.

[0031] S2: Query the logistics order included in this pickup at the driver terminal of the carrier vehicle, and obtain the product SKU and corresponding pickup quantity included in this pickup according to the logistics order.

[0032] S3: Generate the corresponding one-way take-off route and one-way take-off time according to the product SKU of the carrier vehicle and the corresponding pickup quantity.

[0033] S4: Calculate the corresponding one-way take-off start time according to the pickup arrival time and the one-way take-off time.

[0034] S5: Merge the one-way delisting paths whose start time is within the set time length and whose delisting paths overlap to generate a merged delisting path.

[0035] S6: Configure the pickup location of the supply warehouse according to the combined delisting path, the product SKUs contained therein, and the corresponding pickup quantity.

[0036] Specifically, the driver terminal of the carrier vehicle can be constructed as a smart phone, a PDA device or a PC computer. The pickup request signal can be triggered by the user of the driver terminal (for example, the driver of the carrier vehicle), such as the user of the driver terminal clicking to start pickup. As a further preferred solution, a passive triggering solution can be adopted, using a certain period to make the driver terminal send a positioning signal, and the location of the carrier vehicle is known according to the positioning data in the positioning signal. When the carrier vehicle moves to a certain distance from the supply warehouse, such as within 5 kilometers, the driver terminal sends a pickup request signal to the system server. Of course, the pickup request signal also contains the updated positioning data of the carrier vehicle.

[0037] like Figure 3 As shown, as a specific solution, step S1 specifically includes the following steps:

[0038] S11: parsing the positioning data of the carrier vehicle in the pickup request signal.

[0039] S12: Generate a navigation route for the carrier vehicle based on the positioning data of the carrier vehicle and the location data of the supply warehouse.

[0040] S13: Calculate the travel time required for the carrier vehicle to reach the supply warehouse according to the navigation route of the carrier vehicle.

[0041] S14: Generate a pickup arrival time according to the journey time and the time of receiving the pickup request signal.

[0042] Specifically, after determining the current position of the carrier vehicle and the position of the supply warehouse, step S12 may adopt a general navigation planning method, such as the shortest route or the shortest time, etc. As an optional solution, the pickup request signal may be triggered by the user of the driver terminal performing a navigation operation to obtain the position of the supply warehouse.

[0043] As a preferred solution, Fig. 9 As shown, when the user is navigating and planning the route on the driver terminal, the program background automatically sends a pickup request signal to the system server. In particular, after the user determines the navigation route on the driver terminal, while sending the pickup request signal, the navigation route and the estimated time to arrive at the supply warehouse, i.e., the pickup arrival time, are also displayed on the driver terminal.

[0044] Specifically, in step S2, according to the vehicle ID data of the carrier vehicle in the pickup request signal, the logistics order currently carried by the carrier vehicle is called in the system, and then the product SKU and the pickup quantity in the logistics order corresponding to the current supply warehouse are summarized according to the pickup address in the logistics order (i.e. the address of the supply warehouse). That is, the product SKU and the corresponding pickup quantity picked up by the carrier vehicle at the supply warehouse are summarized.

[0045] like Figure 4 As shown, as a specific solution, step S3 specifically includes the following steps:

[0046] S31: Generate a one-way off-shelf path based on the shelf location of the product SKU corresponding to the supply warehouse.

[0047] S32: Generate the single-point take-off time at each shelf location based on the pickup quantity of the product SKU.

[0048] S33: Generate a one-way take-off duration according to the sum of the path consumption of the one-way take-off path and the single-point take-off duration.

[0049] More specifically, in step S31, in the supply warehouse, the product SKU and the shelf position have a corresponding relationship, and the corresponding multiple shelf positions are queried according to the product SKU. According to these shelf positions, a one-way shelf removal path is generated in a way that the path passes through these shelf positions in the shortest manner. As a further preferred solution, a machine learning model can be constructed, and the machine learning model is defined as a shelf removal path generation model. The shelf position in a complete shelf removal process in the historical data is used as input data, and the shelf removal path corresponding to the input data in the historical data is used as output data to train the shelf removal path generation model. After the shelf removal path generation model is trained and converged, the shelf position that needs to plan the shelf removal path is input into the shelf removal path generation model, and the shelf removal path generation model outputs the corresponding shelf removal path and path confidence. If the path confidence is greater than or equal to the path confidence threshold, the shelf removal path is adopted. If the path confidence is less than the path confidence threshold, a general path planning program or a manual path planning program is used for path planning.

[0050] As a preferred solution, the off-shelf path is a sequence of shelf locations, and the off-shelf path generation model is a convolutional neural network model.

[0051] More specifically, in step S32, the specific scheme for generating the single-point shelf removal time according to the number of goods picked up by the commodity SKU includes the following steps: according to the number of goods picked up by the commodity SKU M, and then according to the single handling time t of the commodity SKU, the single-point shelf removal time T1=Mt of the shelf position is obtained. Among them, the single handling time t is a value set according to experience.

[0052] As an alternative, a machine learning model can be used to obtain the single-point delisting time. The input data is the product SKU and the number of pickups, and the output is the single-point delisting time.

[0053] More specifically, in step S33, it can be assumed that the pick-up personnel are moving at a constant speed, so the shelf position, that is, the distance between each shelf position, can be used to know the time between each two shelf positions through distance and speed, and the time between shelf positions on all paths is accumulated to obtain the time spent in the moving position in the one-way shelf removal time. Then, the single-point shelf removal time of each shelf position is accumulated and then summed with the accumulated moving time to obtain the one-way shelf removal time of this time.

[0054] As a preferred solution, the following solution can be used to directly obtain the total time required for removing goods from each shelf position, which specifically includes the following steps: according to the product SKU, the corresponding product packaging volume V and the number of pick-ups M are obtained to obtain the total volume Vs, the total volume Vs=V1×M1+V2×M2+…+Vn×Mn, where n is the type of product SKU involved in this one-way removal; then the one-way removal time T1 is calculated according to the total volume V2 and the preset unit handling rate U, the one-way removal time T1=Vs×U×K. Among them, the dimension of the unit handling rate U is time / volume; K is the handling number correction coefficient, K=(Vs×Ms) / Vm; Among them, Ms is the collection of the number of pick-ups, Ms=M1+M2+…+Mn; and Va is the median product packaging volume, which is the median of all product packaging volumes. In this way, the total time taken for all product SKUs to be removed from their respective shelf positions can be obtained.

[0055] As a preferred solution, the calculation method of step S4 is to use the result of subtracting the one-way shelf removal time from the pickup arrival time as the one-way shelf removal start time.

[0056] Reference Figure 5 As shown, as a specific solution, step S5 specifically includes the following steps:

[0057] S51: Query the earliest one-way delisting start time.

[0058] S52: According to the current earliest one-way delisting start time and the preset set time length, query all other one-way delisting start times whose time difference with the current earliest one-way delisting start time is less than or equal to the set time length and their corresponding one-way delisting paths.

[0059] S53: Determine whether the number of overlapping shelf positions passed through in the two one-way take-off paths queried above is greater than or equal to a set threshold. If so, determine that the two one-way take-off paths are overlapping take-off paths. Otherwise, determine that the two one-way take-off paths are not overlapping.

[0060] S54: Summarize the product SKUs of all one-way delisting paths that are determined to have overlapping delisting paths.

[0061] S55: Generate a merged delisting path based on the aggregated product SKUs.

[0062] As a specific solution, the time length is set to 10 minutes or 15 minutes. The threshold value of the shelf position overlap data is set to 2.

[0063] Reference Figure 6 As shown, as a specific solution, step S6 specifically includes the following steps:

[0064] S61: Generate a combined delisting duration according to the combined delisting path.

[0065] S62: Generate a combined delisting end time according to the combined delisting duration and the current time.

[0066] S63: Generate a pickup location requirement according to the take-off end time and the carrier vehicle corresponding to the merged take-off path.

[0067] S64: Sort and allocate to an idle pickup location according to the pickup arrival time of the carrier vehicle in the pickup location demand.

[0068] As a specific solution, step S61 may refer to the previous method for generating the one-way shelf removal time.

[0069] As a preferred solution, the specific steps of step S63 are: generating a pickup location requirement for each carrier vehicle corresponding to the merged delisting path, and the pickup location requirement is a program task, which includes the delisting end time, that is, the time when the goods of the carrier vehicle are delisted, and also includes the vehicle ID of the carrier vehicle and the specific product SKU and pickup quantity, etc.

[0070] As a preferred solution, in step S64, the pickup location requirements are sorted according to the time when the carrier vehicle arrives at the supply warehouse, and then allocated to the vacant pickup locations based on the sorting. At the same time, the combined delisting path and the corresponding configured pickup locations are sent to the warehouse manager of the supply warehouse to arrange for the warehouse manager to delist the goods.

[0071] As shown in reference 7, a pickup location configuration device of an embodiment of the present application includes: a response module, which is used to generate a pickup arrival time of the carrier vehicle at the pickup location of the supply warehouse in response to a pickup request signal issued by the driver terminal of the carrier vehicle; a query module, which is used to query the logistics order included in the current pickup of the driver terminal of the carrier vehicle, and obtain the product SKU and the corresponding pickup quantity included in this pickup according to the logistics order; a generation module, which is used to generate a corresponding one-way delisting path and a one-way delisting time according to the product SKU and the corresponding pickup quantity of the carrier vehicle; a calculation module, which is used to calculate the corresponding one-way delisting start time according to the pickup arrival time and the one-way delisting time; a merging module, which is used to merge the one-way delisting paths whose one-way delisting start time is within a set time length and whose delisting paths overlap to generate a merged delisting path; a configuration module, which is used to configure the pickup location of the supply warehouse according to the merged delisting path and the product SKUs and corresponding pickup quantities contained therein, and feed back to the driver terminal of the carrier vehicle.

[0072] Reference Figure 8As shown, the electronic device 800 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 801, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 802 or a program loaded from a storage device 808 into a random access memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the electronic device 800 are also stored. The processing device 801, the ROM 802, and the RAM 803 are connected to each other via a bus 804. An input / output (I / O) interface 805 is also connected to the bus 804.

[0073] Typically, the following devices may be connected to the I / O interface 805: input devices 806 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; output devices 807 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 808 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 809. The communication device 809 may allow the electronic device 800 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 8 The electronic device 800 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead. Figure 8 Each block shown in the figure may represent one device, or may represent multiple devices as required.

[0074] In particular, according to some embodiments of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, some embodiments of the present disclosure include a computer program product, which includes a computer program carried on a computer storage medium, and the computer program contains program code for executing the method shown in the flowchart. In some such embodiments, the computer program can be downloaded and installed from the network through the communication device 809, or installed from the storage device 808, or installed from the ROM 802. When the computer program is executed by the processing device 801, the above-mentioned functions defined in the method of some embodiments of the present disclosure are executed.

[0075] It should be noted that the computer storage medium described above in some embodiments of the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to, an electrical connection with one or more wires, a portable computer disk, 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 disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0076] In some embodiments of the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, device, or device. In some embodiments of the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer storage medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in combination with an instruction execution system, device, or device. The program code contained on the computer storage medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0077] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (HyperTextTransferProtocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an adhoc peer-to-peer network), as well as any currently known or future developed network.

[0078] The computer storage medium may be included in the electronic device, or may exist independently without being installed in the electronic device. The computer storage medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: generates a pickup arrival time of the carrier vehicle at the pickup location of the supply warehouse in response to a pickup request signal sent by the driver terminal of the carrier vehicle; queries the logistics order included in the pickup by the driver terminal of the carrier vehicle, and obtains the product SKU and the corresponding pickup quantity included in this pickup according to the logistics order; generates a corresponding one-way delisting path and a one-way delisting time according to the product SKU and the corresponding pickup quantity of the carrier vehicle; calculates the corresponding one-way delisting start time according to the pickup arrival time and the one-way delisting time; merges the one-way delisting paths whose one-way delisting start time is within the set time length and whose delisting paths overlap to generate a merged delisting path; configures the pickup location of the supply warehouse according to the merged delisting path and the product SKUs and corresponding pickup quantities contained therein, and feeds back to the driver terminal of the carrier vehicle.

[0079] Computer program code for performing the operations of some embodiments of the present disclosure may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0080] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram may represent a module, a program segment, or a part of a code, which contains one or more executable instructions for implementing a specified logical function.

[0081] 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.

[0082] For example, two boxes shown in succession may actually be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of boxes in the block diagram and / or flow chart, can be implemented by a dedicated hardware-based system that performs the specified function or operation, or can be implemented by a combination of dedicated hardware and computer instructions.

[0083] The units described in some embodiments of the present disclosure may be implemented by software or hardware. The units described may also be arranged in a processor, and the names of these units do not constitute limitations on the units themselves in some cases.

[0084] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0085] The above descriptions are only some preferred embodiments of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the embodiments of the present disclosure is not limited to the technical solutions formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above inventive concept. For example, the above features are replaced with (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure.

Claims

1. A method for configuring a pickup location, comprising: In response to a pickup request signal sent by a driver terminal of a carrier vehicle, generating a pickup arrival time of the carrier vehicle at a pickup location of a supply warehouse; Query the logistics order included in this pickup at the driver terminal of the carrier vehicle, and obtain the product SKU and corresponding pickup quantity included in this pickup according to the logistics order; Generate a corresponding one-way delisting path and one-way delisting duration according to the commodity SKU of the carrier vehicle and the corresponding pickup quantity; Calculate the corresponding one-way delisting start time according to the pickup arrival time and the one-way delisting time; Merge the one-way delisting paths whose one-way delisting start time is within the set time length and whose delisting paths overlap to generate a merged delisting path; The pickup location of the supply warehouse is configured according to the combined delisting path, the product SKUs contained therein, and the corresponding pickup quantity, and the information is fed back to the driver terminal of the carrier vehicle; The pickup arrival time of the carrier vehicle at the pickup location of the supply warehouse includes: parsing the positioning data of the carrier vehicle in the pickup request signal; Generating a navigation route of the carrier vehicle according to the positioning data of the carrier vehicle and the location data of the supply warehouse; Calculating the travel time required for the carrier vehicle to reach the supply warehouse according to the navigation route of the carrier vehicle; Generate the pickup arrival time according to the journey time and the time of receiving the pickup request signal; The generating of a corresponding one-way shelf removal path and one-way shelf removal time according to the commodity SKU of the carrier vehicle and the corresponding pickup quantity includes: Generate the one-way off-shelf path according to the shelf position of the supply warehouse corresponding to the product SKU; Generate a single-point take-off time at each shelf location according to the pickup quantity of the commodity SKU; Generate the one-way shelf removal duration according to the sum of the path consumption of the one-way shelf removal path and the single-point shelf removal duration; The step of calculating the corresponding one-way shelf removal start time according to the pickup arrival time and the one-way shelf removal time includes: The one-way delisting start time is the result of subtracting the one-way delisting time from the pickup arrival time; The step of merging the one-way delisting paths whose start time of the one-way delisting is within the set time length and whose delisting paths overlap to generate a merged delisting path comprises: Query the current earliest one-way delisting start time; based on the current earliest one-way delisting start time and the preset set time length, query all other one-way delisting start times whose time difference with the current earliest one-way delisting start time is less than or equal to the set time length and the one-way delisting paths corresponding thereto; Determine whether the number of overlapping shelf positions passed through in the two one-way unloading paths queried above is greater than or equal to a set threshold, if so, determine that the two one-way unloading paths are unloading path overlaps, if not, determine that the two one-way unloading paths do not overlap; The step of merging the one-way delisting paths whose start time of the one-way delisting is within the set time length and whose delisting paths overlap to generate a merged delisting path further includes: Aggregate the SKUs of the products in all the one-way delisting paths that are determined to have overlapping delisting paths; Generate the combined delisting path according to the aggregated product SKUs; The configuration of the pickup location of the supply warehouse according to the combined delisting path, the commodity SKUs contained therein, and the corresponding pickup quantity, and the feedback to the driver terminal of the carrier vehicle, includes: Generate a combined delisting duration according to the combined delisting path; Generate a combined delisting end time according to the combined delisting duration and the current time; Generate a pickup location requirement according to the take-off end time and the carrier vehicle corresponding to the combined take-off path; The carrier vehicles are arranged to the idle pickup locations according to the pickup arrival time in the pickup location requirements.

2. A pickup location configuration device, comprising: A response module, for generating a pickup arrival time of the carrier vehicle at a pickup location of a supply warehouse in response to a pickup request signal sent by a driver terminal of the carrier vehicle; A query module is used to query the logistics order included in the current pickup of the driver terminal of the carrier vehicle, and obtain the commodity SKU and corresponding pickup quantity included in the current pickup according to the logistics order; A generation module, used to generate a corresponding one-way shelf removal path and a one-way shelf removal time according to the commodity SKU of the carrier vehicle and the corresponding pickup quantity; A calculation module, used for calculating the corresponding one-way shelf removal start time according to the pickup arrival time and the one-way shelf removal time; A merging module, used for merging the one-way delisting paths whose start time of the one-way delisting is within a set time length and whose delisting paths overlap to generate a merged delisting path; A configuration module, used to configure the pickup location of the supply warehouse according to the combined delisting path, the commodity SKUs contained therein, and the corresponding pickup quantity, and feed back to the driver terminal of the carrier vehicle; The pickup arrival time of the carrier vehicle at the pickup location of the supply warehouse includes: parsing the positioning data of the carrier vehicle in the pickup request signal; Generating a navigation route of the carrier vehicle according to the positioning data of the carrier vehicle and the location data of the supply warehouse; Calculating the travel time required for the carrier vehicle to reach the supply warehouse according to the navigation route of the carrier vehicle; Generate the pickup arrival time according to the journey time and the time of receiving the pickup request signal; The generating of a corresponding one-way shelf removal path and one-way shelf removal time according to the commodity SKU of the carrier vehicle and the corresponding pickup quantity includes: Generate the one-way off-shelf path according to the shelf position of the supply warehouse corresponding to the product SKU; Generate a single-point take-off time at each shelf location according to the pickup quantity of the commodity SKU; Generate the one-way shelf removal duration according to the sum of the path consumption of the one-way shelf removal path and the single-point shelf removal duration; The step of calculating the corresponding one-way shelf removal start time according to the pickup arrival time and the one-way shelf removal time includes: The one-way delisting start time is the result of subtracting the one-way delisting time from the pickup arrival time; The step of merging the one-way delisting paths whose start time of the one-way delisting is within the set time length and whose delisting paths overlap to generate a merged delisting path comprises: Query the current earliest one-way delisting start time; based on the current earliest one-way delisting start time and the preset set time length, query all other one-way delisting start times whose time difference with the current earliest one-way delisting start time is less than or equal to the set time length and the one-way delisting paths corresponding thereto; Determine whether the number of overlapping shelf positions passed through in the two one-way unloading paths queried above is greater than or equal to a set threshold, if so, determine that the two one-way unloading paths are unloading path overlaps, if not, determine that the two one-way unloading paths do not overlap; The step of merging the one-way delisting paths whose start time of the one-way delisting is within the set time length and whose delisting paths overlap to generate a merged delisting path further includes: Aggregate the SKUs of the products in all the one-way delisting paths that are determined to have overlapping delisting paths; Generate the combined delisting path according to the aggregated product SKUs; The configuration of the pickup location of the supply warehouse according to the combined delisting path, the commodity SKUs contained therein, and the corresponding pickup quantity, and the feedback to the driver terminal of the carrier vehicle, includes: Generate a combined delisting duration according to the combined delisting path; Generate a combined delisting end time according to the combined delisting duration and the current time; Generate a pickup location requirement according to the take-off end time and the carrier vehicle corresponding to the combined take-off path; The carrier vehicles are arranged to the idle pickup locations according to the pickup arrival time in the pickup location requirements.

3. An electronic device, comprising: one or more processors; a storage device having one or more programs stored thereon; When the one or more programs are executed by the one or more processors, the processors implement the method as claimed in claim 1.

4. A computer storage medium having a computer program stored thereon, wherein: When the computer program is executed by a processor, the method according to claim 1 is implemented.