CN113780650B - Capacity locking method, apparatus, device and storage medium - Google Patents

Capacity locking method, apparatus, device and storage medium Download PDF

Info

Publication number
CN113780650B
CN113780650B CN202111035690.0A CN202111035690A CN113780650B CN 113780650 B CN113780650 B CN 113780650B CN 202111035690 A CN202111035690 A CN 202111035690A CN 113780650 B CN113780650 B CN 113780650B
Authority
CN
China
Prior art keywords
capacity
locking
volume
order
signal
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
CN202111035690.0A
Other languages
Chinese (zh)
Other versions
CN113780650A (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.)
Hangzhou Pinjie Network Technology Co Ltd
Original Assignee
Hangzhou Pinjie Network 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 Hangzhou Pinjie Network Technology Co Ltd filed Critical Hangzhou Pinjie Network Technology Co Ltd
Priority to CN202111035690.0A priority Critical patent/CN113780650B/en
Publication of CN113780650A publication Critical patent/CN113780650A/en
Application granted granted Critical
Publication of CN113780650B publication Critical patent/CN113780650B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • G06Q10/0875Itemisation or classification of parts, supplies or services, e.g. bill of materials

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Quality & Reliability (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application discloses a capacity locking method, a capacity locking device, a capacity locking equipment and a storage medium, wherein the capacity locking method comprises the following steps: inquiring the generated logistics order and the generated capacity locking order to acquire the residual available capacity volume in response to a capacity locking request signal sent by the shop terminal; judging whether the requested capacity locking volume in the capacity locking request signal is smaller than or equal to the remaining available capacity volume, if so, sending a capacity locking confirmation signal to the shop terminal, and if not, sending a capacity locking invalidation signal to the shop terminal; and responding to the feedback signal of the store terminal to the capacity locking confirmation signal, generating a capacity locking order corresponding to the store terminal and matching the corresponding carrier vehicle for the capacity locking order. The method has the advantages that the capacity locking order distributed to the corresponding carrier vehicle is automatically generated through the prediction and judgment of the capacity locking request made by the shop terminal, so that the shop is helped to reserve the required capacity.

Description

Capacity locking method, apparatus, device and storage medium
Technical Field
The present application relates to the field of computer technologies, and in particular, to a capacity locking method, apparatus, device, and storage medium.
Background
As shown in fig. 1, in the related art, orders of a plurality of stores are collected by means of an internet platform, unified purchase and logistics goods taking are performed to suppliers, and then the goods are distributed to corresponding stores by carrier vehicles according to the purchase orders, so that storage cost of stores such as convenience stores is reduced, and the flexibility of purchase is improved.
However, when the store is actually purchased, the store is often busy, and the purchase order cannot be ordered in time, especially for middle and large-scale stores, the store is ordered according to the inventory because the store is not counted in time in the past, but the problem that the store cannot be distributed to the carrier vehicles if the store is not ordered in time because the daily sales are large is encountered.
Disclosure of Invention
The content of the present application is intended to introduce concepts in a simplified form that are further described below in the detailed description. The section of this application is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Some embodiments of the present application propose a capacity locking method, apparatus, electronic device, and computer storage medium to solve the technical problems mentioned in the background section above.
As a first aspect of the present application, some embodiments of the present application provide a capacity locking method comprising: inquiring the generated logistics order and the generated capacity locking order to acquire the residual available capacity volume in response to a capacity locking request signal sent by the shop terminal; judging whether the requested capacity locking volume in the capacity locking request signal is smaller than or equal to the remaining available capacity volume, if so, sending a capacity locking confirmation signal to the shop terminal, and if not, sending a capacity locking invalidation signal to the shop terminal; and responding to the feedback signal of the store terminal to the capacity locking confirmation signal, generating a capacity locking order corresponding to the store terminal and matching the corresponding carrier vehicle for the capacity locking order.
As a second aspect of the present application, some embodiments of the present application provide a capacity locking device comprising: the inquiring module is used for responding to the capacity locking request signal sent by the shop terminal and inquiring the generated logistics order and the generated capacity locking order to acquire the residual available capacity volume; the judging module is used for judging whether the volume of the capacity lock requested in the capacity lock request signal is smaller than or equal to the remaining available capacity volume, if so, sending a capacity lock confirmation signal to the shop terminal, and if not, sending a capacity lock invalid signal to the shop terminal; and the locking module is used for responding to the feedback signal of the store terminal to the capacity locking confirmation signal, generating a capacity locking order corresponding to the store terminal and matching the corresponding carrier vehicle for the capacity locking order.
As a third aspect of the present application, some embodiments of the present application provide an electronic device, including: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors causes the one or more processors to implement the method described in any of the implementations of the first aspect above.
As a fourth aspect of the present application, some embodiments of the present application provide a computer storage medium having a computer program stored thereon, wherein the program, when executed by a processor, implements the method described in any of the implementations of the first aspect.
The beneficial effects of this application lie in: the capacity locking order distributed to the corresponding carrier vehicles is automatically generated through the prediction and judgment of the capacity locking request made by the shop terminal, so that the shops are helped to reserve the required capacity.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, are included to provide a further understanding of the application and to provide a further understanding of the application with regard to the other features, objects and advantages of the application. The drawings of the illustrative embodiments of the present application and their descriptions are for the purpose of illustrating the present application and are not to be construed as unduly limiting the present application.
In addition, the same or similar reference numerals denote the same or similar elements throughout the drawings. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.
In the drawings:
FIG. 1 is a schematic diagram of a store in the related art making "order" purchases;
FIG. 2 is a flow chart of a capacity locking method according to one embodiment of the present application;
FIG. 3 is a flowchart of a portion of the steps of a capacity locking method according to one embodiment of the present application;
FIG. 4 is a flowchart of yet another portion of the steps of a capacity locking method according to one embodiment of the present application;
FIG. 5 is a flowchart of a further portion of the steps of a capacity locking method according to one embodiment of the present application;
FIG. 6 is a flowchart of another partial step of a capacity lock method according to one embodiment of the present application;
FIG. 7 is a block diagram of a capacity lock device according to one embodiment of the present application;
fig. 8 is a schematic structural view of an electronic device according to an embodiment of the present application.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.
It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings. Embodiments of the present disclosure and features of embodiments may be combined with each other without conflict.
It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.
It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.
The names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Referring to fig. 2, the capacity locking method according to one embodiment of the present application includes the steps of:
s1: in response to the capacity lock request signal sent by the store terminal, the generated logistics order and the generated capacity lock order are queried to obtain remaining available capacity volumes.
S2: and judging whether the volume of the requested capacity lock in the capacity lock request signal is smaller than or equal to the remaining available capacity volume, if so, sending a capacity lock confirmation signal to the shop terminal, and if not, sending a capacity lock invalidation signal to the shop terminal.
S3: and responding to the feedback signal of the store terminal to the capacity locking confirmation signal, generating a capacity locking order corresponding to the store terminal and matching the corresponding carrier vehicle for the capacity locking order.
Specifically, the shop terminal can be configured as a smart phone, and the shop user can realize corresponding functions by operating an operation interface of the APP on the smart phone. As a specific solution, the above steps may be performed as a server.
More specifically, the store user may click on "initiate drivability lock" or "initiate order forecast" initiate drivability lock request program at the operation interface. After the store user initiates the capacity locking request program, the volume to be locked can be set through the operation interface, in the operation interface, the capacity volume actually generated by the logistics order every day of the previous week (namely, the total transportation volume of the commodities) and the historical average capacity volume can be listed, and the store user can directly set one capacity volume to be locked according to the data and then add the capacity volume to be locked into the capacity locking request signal. Alternatively, the store user triggers the issuance of an capacity lock request signal by initiating an order forecast.
As shown in fig. 3, as a specific scheme, step S1 specifically includes the steps of:
s101: store ID data and an capacity lock volume in the capacity lock request signal are parsed.
S102: and inquiring historical data of the purchase order of the store terminal according to the store ID data.
S103: and generating purchase forecast data of the store terminal according to the historical data of the purchase order of the store terminal.
S104: and generating a capacity preset volume corresponding to the purchase forecast data.
S105: judging whether the difference value of the capacity locking volume and the capacity preset volume is smaller than or equal to the maximum historical difference value, if so, acquiring the capacity locking volume, and if not, sending a capacity locking overflow signal to a shop terminal.
The maximum historical difference value is equal to the difference value between the maximum capacity volume and the minimum capacity volume corresponding to the historical purchase order historical data of the shop terminal.
Specifically, in step S103, acquisition of purchase forecast data may be achieved by constructing a machine learning model. As a further specific embodiment, the machine learning model may be trained by using a matrix of daily purchase numbers of each commodity SKU (a row of commodity SKUs and a column of daily purchase numbers of each commodity SKU) related to the store as input data and output data, using a matrix before the set date as input data and a matrix on the set date as output data, and after the training converges, predicting a purchase order by the machine learning model, and generating purchase prediction data based on the correspondence between the last column of purchase numbers in the output matrix and the commodity SKU.
Specifically, in step S104, the obtained purchase prediction data is equal to the obtained commodity SKU and the predicted purchase quantity, and the specific volume of space occupied by the commodity, that is, the preset volume of capacity, representing the volume of capacity occupied by the commodity predicted to be purchased by the purchase prediction data can be calculated according to the number of package volumes of the commodity SKU recorded in the system.
Step S105 is mainly used for judging whether the capacity lock volume set by the shop user is reasonable, and if the judgment condition cannot be satisfied, the setting is not consistent with the history condition, and the prediction of the purchase order by the system is not satisfied.
Referring to fig. 4, as a specific scheme, step S1 further includes the following steps:
s111: a virtual purchase order is generated based on the purchase forecast data.
S112: a virtual logistics order is generated from the virtual purchase order.
S113: the carrier vehicle and the vehicle lock volume of the corresponding carrier vehicle are specified according to the virtual logistics order.
S114: the carrier vehicle designated according to the virtual logistics order queries the carrier vehicle for the generated logistics order and capacity lock order.
S115: the remaining available capacity volume is calculated from the vehicle available volume of the carrier vehicle and the logistical order and capacity lock order that the carrier vehicle has generated.
Specifically, step S111 converts the commodity SKUs and purchase quantities in the purchase forecast data into specific purchase orders. Step S112 performs the distribution of the logistics in the split purchase mode (this part is not the core solution of the present application, and is not described in detail here) in the system by using the virtual purchase order as the real purchase order according to the virtual purchase order, thereby forming the virtual logistics order. It should be noted that the virtual purchase order and the virtual logistics order are identical in the system to the real purchase order and logistics order for the system allocation, except that the virtual purchase order and the virtual logistics order are attribute tagged in the system so that they can be identified by the system and are not actually allocated to the warehouse terminal of the supply warehouse and the driver terminal of the carrier vehicle. In steps S113 and S114, the virtual logistics order is matched to the best possible carrier vehicle according to the current system logistics order dispatch situation, and the occupied volume, i.e. the vehicle locking volume, is calculated from the commodity SKUs and quantity of the distributed logistics order. The system is then queried for the logistics order that the carrier vehicle has assigned (the actual logistics order) and the capacity lock order that has been assigned. Step S115 then calculates the remaining available capacity volume based on the vehicle available volume of the carrier vehicle itself and the previously queried logistics orders (real logistics orders) and capacity lock orders that have been assigned by the carrier vehicle. The specific calculation scheme is that the volume occupied by the allocated material flow order and the volume occupied by the capacity locking order are subtracted from the available volume of the vehicle, and the remaining available capacity volume is obtained. The determination of step S2 may be made after the above data preparation is completed.
As shown in fig. 5, as a specific scheme, step S2 specifically includes the steps of:
s21: and judging whether the vehicle locking volume distributed to the carrier vehicle according to the capacity locking request signal is smaller than or equal to the remaining available capacity volume of the carrier vehicle, if so, comparing the vehicle locking volume of one carrier vehicle with the remaining available capacity volume, and if not, respectively accumulating the vehicle locking volume of the carrier vehicle and the remaining available capacity volume to the vehicle locking summarized volume and the remaining available summarized capacity volume.
S22: judging whether the vehicle locking summarized volume is smaller than or equal to the remaining available total capacity volume, and if so, sending a capacity locking confirmation signal to a shop terminal; if not, sending a capacity locking invalid signal to the shop terminal.
Specifically, step S21 functions to determine whether the carrier vehicles of each corresponding shop terminal individually meet the demand for capacity locking, and when an unsatisfied condition occurs, it is determined in step S22 whether the demand for capacity locking can be met by means of carrier vehicle re-matching by means of separate accumulation. When the vehicle locking total volume is smaller than or equal to the remaining available total capacity volume, the situation that unbalance exists in the process of respectively comparing is indicated, and capacity locking can be achieved through redistribution.
Referring to fig. 6, as a specific scheme, step S3 further includes the following steps:
s31: and analyzing the modification or/and confirmation of the virtual purchase order in the feedback signal to generate the preset purchase order.
S32: and generating a corresponding preset logistics order according to the preset purchase order to acquire the carrier vehicle designated by the logistics order and the corresponding capacity locking order.
Specifically, the store terminal can generate feedback by reducing the volume count of the capacity lock request, whether it is an inactive signal or an overflow signal. The store terminal may receive the virtual purchase order and then modify or determine to generate a preset purchase order, which the store terminal may not actually pay first, but rather use to perform capacity locking. After the preset purchase order is obtained in step S32, a logistics order is generated according to the general rule to obtain the corresponding designated carrier vehicle and the capacity lock volume of each vehicle.
After the corresponding capacity lock orders are generated in the system, the system no longer matches the volumes locked by the capacity lock orders with the goods, from a business logic perspective, the store terminal needs to pay a certain subscription fee for the capacity lock orders, if the store terminal finally uses the volumes pointed by the capacity lock orders (the goods SKUs can be adjusted), the subscription fee will be contained in the normal fee, if the store terminal does not use the volumes pointed by the capacity lock orders, and meanwhile, the volumes are not successfully distributed for the second time, and the subscription fee is deducted by the system.
Referring to fig. 7, an apparatus for locking capacity according to an embodiment of the present application includes: the inquiring module is used for responding to the capacity locking request signal sent by the shop terminal and inquiring the generated logistics order and the generated capacity locking order to acquire the residual available capacity volume; the judging module is used for judging whether the volume of the capacity lock requested in the capacity lock request signal is smaller than or equal to the remaining available capacity volume, if so, sending a capacity lock confirmation signal to the shop terminal, and if not, sending a capacity lock invalid signal to the shop terminal; and the locking module is used for responding to the feedback signal of the store terminal to the capacity locking confirmation signal, generating a capacity locking order corresponding to the store terminal and matching the corresponding carrier vehicle for the capacity locking order.
Referring to fig. 8, an electronic device 800 may include a processing means (e.g., a central processor, a graphics processor, etc.) 801, which may perform various appropriate actions and processes according to programs stored in a Read Only Memory (ROM) 802 or programs loaded from a storage 808 into a Random Access Memory (RAM) 803. In the RAM803, various programs and data required for the operation of the electronic device 800 are also stored. The processing device 801, the ROM802, and the RAM803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to the bus 804.
In general, the following devices may be connected to the I/O interface 805: input devices 806 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, and the like: an output device 807 including, for example, a Liquid Crystal Display (LCD), speakers, vibrators, etc.; including storage 808, such as magnetic tape, hard disk, etc.: communication means 809. The communication means 809 may allow the electronic device 800 to communicate wirelessly or by wire with other devices to exchange data. While fig. 8 shows an electronic device 800 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead. Each block shown in fig. 8 may represent one device or a plurality of devices as needed.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer storage medium, the computer program comprising program code for performing the methods shown in the flowcharts. In such embodiments, the computer program may be downloaded and installed from a network via communication device 809, or from storage device 808, or from ROM 802. The above-described functions defined in the methods of some embodiments of the present disclosure are performed when the computer program is executed by the processing device 801.
It should be noted that, in some embodiments of the present disclosure, the computer storage medium may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
In some embodiments of the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, the computer-readable signal medium may comprise a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer storage medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer storage medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
In some embodiments, the client, server, etc. may communicate using any currently known or future developed network protocol, such as HTTP (hypertext transfer protocol), etc., 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"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.
The computer storage medium may be included in the electronic device: or may exist alone without being incorporated into the electronic device. The computer storage medium carries one or more programs that, when executed by the electronic device, cause the electronic device to: inquiring the generated logistics order and the generated capacity locking order to acquire the residual available capacity volume in response to a capacity locking request signal sent by the shop terminal; judging whether the requested capacity locking volume in the capacity locking request signal is smaller than or equal to the remaining available capacity volume, if so, sending a capacity locking confirmation signal to the shop terminal, and if not, sending a capacity locking invalidation signal to the shop terminal; and responding to the feedback signal of the store terminal to the capacity locking confirmation signal, generating a capacity locking order corresponding to the store terminal and matching the corresponding carrier vehicle for the capacity locking order.
Computer program code for carrying out operations for some embodiments of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, or combinations thereof: such as the "C" language or similar programming language. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
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 disclosure. 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 described in some embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. The units described may also be provided in a processor, the names of these units in some cases not constituting a limitation of the unit itself.
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: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.
The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above technical features, but encompasses other technical features formed by any combination of the above technical features or their equivalents without departing from the spirit of the invention. Such as the above-described features, are mutually substituted with (but not limited to) the features having similar functions disclosed in the embodiments of the present disclosure.

Claims (8)

1. A method of capacity locking comprising:
inquiring the generated logistics order and the generated capacity locking order to acquire the residual available capacity volume in response to a capacity locking request signal sent by the shop terminal;
judging whether the volume of the requested capacity lock in the capacity lock request signal is smaller than or equal to the remaining available capacity volume, if so, sending a capacity lock confirmation signal to the shop terminal, and if not, sending a capacity lock invalidation signal to the shop terminal;
responding to a feedback signal of the store terminal to the capacity locking confirmation signal, generating a capacity locking order corresponding to the store terminal and matching a corresponding carrier vehicle for the capacity locking order;
wherein, responding to the capacity locking request signal sent by the shop terminal, inquiring the generated logistics order and the generated capacity locking order to acquire the residual available capacity volume comprises the following steps:
analyzing store ID data and a capacity locking volume in the capacity locking request signal;
inquiring historical data of a purchase order of the store terminal according to the store ID data;
generating purchase forecast data of the store terminal according to historical data of the purchase order of the store terminal;
generating a capacity preset volume corresponding to the purchase forecast data according to the purchase forecast data;
judging whether the difference value of the capacity locking volume and the capacity preset volume is smaller than or equal to the maximum historical difference value, if so, acquiring the capacity locking volume, and if not, sending a capacity locking overflow signal to the shop terminal;
and the maximum historical difference value is equal to the difference value between the maximum capacity volume and the minimum capacity volume corresponding to the historical purchase order historical data of the store terminal.
2. The capacity locking method of claim 1, wherein the querying the generated logistics order and the generated capacity locking order to obtain the remaining available capacity volume in response to the capacity locking request signal transmitted by the store terminal further comprises:
generating a virtual purchase order according to the purchase forecast data;
generating a virtual logistics order according to the virtual purchase order;
designating a carrier vehicle and a vehicle locking volume corresponding to the carrier vehicle according to the virtual logistics order;
and inquiring the generated logistics order and the capacity locking order of the carrier vehicle according to the carrier vehicle specified by the virtual logistics order.
3. The capacity locking method of claim 2, wherein the querying the generated logistics order and the generated capacity locking order to obtain the remaining available capacity volume in response to the capacity locking request signal transmitted by the store terminal further comprises:
the remaining available capacity volume is calculated from the vehicle available volume of the carrier vehicle and the logistic order and capacity lock order that the carrier vehicle has generated.
4. The capacity locking method of claim 3, wherein the determining whether the capacity lock volume requested in the capacity lock request signal is less than or equal to the remaining available capacity volume, if so, sends a capacity lock acknowledge signal to the store terminal, and if not, sends a capacity lock disable signal to the store terminal, comprises:
and judging whether the vehicle locking volume distributed to the carrier vehicle according to the capacity locking request signal is smaller than or equal to the residual available capacity volume of the carrier vehicle, if so, comparing the vehicle locking volume of one carrier vehicle with the residual available capacity volume, and if not, accumulating the vehicle locking volume of the carrier vehicle and the residual available capacity volume to the vehicle locking summarized volume and the residual available summarized capacity volume respectively.
5. The capacity lock method of claim 4, wherein the determining whether the capacity lock volume requested in the capacity lock request signal is less than or equal to the remaining available capacity volume, if so, sends a capacity lock acknowledge signal to the store terminal, and if not, sends a capacity lock disable signal to the store terminal, further comprising:
judging whether the vehicle locking summarized volume is smaller than or equal to the residual available total capacity volume, and if so, sending a capacity locking confirmation signal to the shop terminal; and if not, sending a capacity locking invalid signal to the shop terminal.
6. The capacity locking method of claim 5, wherein the generating and matching a corresponding carrier vehicle for a capacity locking order corresponding to a store terminal in response to a feedback signal of the store terminal to the capacity locking confirmation signal comprises:
analyzing the modification or/and confirmation of the virtual purchase order in the feedback signal to generate a preset purchase order;
and generating a corresponding preset logistics order according to the preset purchase order to acquire a carrier vehicle designated by the logistics order and a corresponding capacity locking order.
7. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon;
the one or more programs, when executed by the one or more processors, cause the processor to implement the method of any of claims 1-6.
8. A computer storage medium having stored thereon a computer program, wherein the computer program when executed by a processor implements the method of any of claims 1 to 6.
CN202111035690.0A 2021-09-06 2021-09-06 Capacity locking method, apparatus, device and storage medium Active CN113780650B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111035690.0A CN113780650B (en) 2021-09-06 2021-09-06 Capacity locking method, apparatus, device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111035690.0A CN113780650B (en) 2021-09-06 2021-09-06 Capacity locking method, apparatus, device and storage medium

Publications (2)

Publication Number Publication Date
CN113780650A CN113780650A (en) 2021-12-10
CN113780650B true CN113780650B (en) 2024-03-26

Family

ID=78841100

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111035690.0A Active CN113780650B (en) 2021-09-06 2021-09-06 Capacity locking method, apparatus, device and storage medium

Country Status (1)

Country Link
CN (1) CN113780650B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116739315B (en) * 2023-08-14 2024-03-15 佛山市南海区微高软件有限公司 Door and window order dispatching method and device, electronic equipment and storage medium

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107220796A (en) * 2017-06-28 2017-09-29 北京惠赢天下网络技术有限公司 A kind of kinds of goods transportation resources of distributors and device
CN107230034A (en) * 2017-06-28 2017-10-03 北京惠赢天下网络技术有限公司 One kind association ordering method and device
CN107274014A (en) * 2017-06-08 2017-10-20 北京惠赢天下网络技术有限公司 A kind of processing method, system and the terminal of the dispatching task based on standard container
CN108734344A (en) * 2018-05-07 2018-11-02 拉扎斯网络科技(上海)有限公司 Order distribution prediction method, device, equipment and computer readable storage medium
CN109508842A (en) * 2017-09-14 2019-03-22 北京小度信息科技有限公司 It dispenses transport power and regulates and controls method and apparatus
CN110619410A (en) * 2018-06-20 2019-12-27 北京京东尚科信息技术有限公司 Order re-posting prediction method, device and system
CN112749898A (en) * 2021-01-13 2021-05-04 叮当快药科技集团有限公司 Order allocation method, model training method and device and electronic equipment
CN112862319A (en) * 2021-02-08 2021-05-28 北京顺达同行科技有限公司 Order scheduling method, device, equipment and storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10282766B2 (en) * 2013-01-15 2019-05-07 Drizly, Inc. Distribution of products

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107274014A (en) * 2017-06-08 2017-10-20 北京惠赢天下网络技术有限公司 A kind of processing method, system and the terminal of the dispatching task based on standard container
CN107220796A (en) * 2017-06-28 2017-09-29 北京惠赢天下网络技术有限公司 A kind of kinds of goods transportation resources of distributors and device
CN107230034A (en) * 2017-06-28 2017-10-03 北京惠赢天下网络技术有限公司 One kind association ordering method and device
CN109508842A (en) * 2017-09-14 2019-03-22 北京小度信息科技有限公司 It dispenses transport power and regulates and controls method and apparatus
CN108734344A (en) * 2018-05-07 2018-11-02 拉扎斯网络科技(上海)有限公司 Order distribution prediction method, device, equipment and computer readable storage medium
CN110619410A (en) * 2018-06-20 2019-12-27 北京京东尚科信息技术有限公司 Order re-posting prediction method, device and system
CN112749898A (en) * 2021-01-13 2021-05-04 叮当快药科技集团有限公司 Order allocation method, model training method and device and electronic equipment
CN112862319A (en) * 2021-02-08 2021-05-28 北京顺达同行科技有限公司 Order scheduling method, device, equipment and storage medium

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
基于"动态电子围栏"的即时配送路径优化研究;刘娇;田育灵;陈嫣;叶紫;魏荣华;;商场现代化(15);74-76 *
新零售"时代我国即时物流发展链路构建;张迪;《商业经济研究》(第第16期期);第112-116页 *

Also Published As

Publication number Publication date
CN113780650A (en) 2021-12-10

Similar Documents

Publication Publication Date Title
CN102316157B (en) The cloud computing structure carried out by manager
WO2022063300A1 (en) Allocation information generation method, item allocation method and apparatus, device and medium
CN108491408B (en) Activity information processing method and device, electronic equipment and storage medium
CN114202130A (en) Flow transfer amount prediction multitask model generation method, scheduling method, device and equipment
CN112435101A (en) Order information processing method and device, electronic equipment and computer readable medium
CN113780650B (en) Capacity locking method, apparatus, device and storage medium
CN113658597B (en) Voice ordering method, device, electronic equipment and computer readable medium
CN116911805B (en) Resource alarm method, device, electronic equipment and computer readable medium
CN114493750A (en) Method, device, equipment and computer readable medium for sending recommended article information
CN112102043B (en) Item recommendation page generation method and device, electronic equipment and readable medium
CN113554400A (en) Inventory data updating method, device, equipment and storage medium
CN112085442B (en) Device operation method, apparatus, electronic device, and computer-readable medium
CN114049108A (en) Settlement payment method and system based on intelligent scale
CN116562772A (en) Method, apparatus, device, medium and program product for generating article replenishment information
CN110895777A (en) Method and device for processing overtime service list
CN110795445B (en) Concurrent task processing method and device, server equipment and medium
CN113627662B (en) Inventory data prediction method, apparatus, device and storage medium
CN113986959A (en) Logistics information acquisition method and device, electronic equipment and computer readable medium
CN111985967A (en) Article information generation method and device, electronic equipment and computer readable medium
CN112085441A (en) Information generation method and device, electronic equipment and computer readable medium
CN113610291B (en) Logistics route regeneration method, device, electronic equipment and computer readable medium
CN114897569B (en) Order generation method, device, equipment and medium based on marketing service platform
CN113762816B (en) Method, device, equipment and storage medium for generating internal distribution list
CN113780761B (en) Warehouse space merging method, device, equipment and storage medium
CN114969059B (en) Method and device for generating order information, electronic equipment and storage medium

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