CN115271582A - Article scheduling method, device, electronic equipment and computer readable medium - Google Patents

Article scheduling method, device, electronic equipment and computer readable medium Download PDF

Info

Publication number
CN115271582A
CN115271582A CN202210723014.0A CN202210723014A CN115271582A CN 115271582 A CN115271582 A CN 115271582A CN 202210723014 A CN202210723014 A CN 202210723014A CN 115271582 A CN115271582 A CN 115271582A
Authority
CN
China
Prior art keywords
warehouse
information
article
item
score
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210723014.0A
Other languages
Chinese (zh)
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.)
Multipoint Shenzhen Digital Technology Co ltd
Original Assignee
Multipoint Shenzhen Digital 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 Multipoint Shenzhen Digital Technology Co ltd filed Critical Multipoint Shenzhen Digital Technology Co ltd
Priority to CN202210723014.0A priority Critical patent/CN115271582A/en
Publication of CN115271582A publication Critical patent/CN115271582A/en
Pending legal-status Critical Current

Links

Images

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/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
    • 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

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (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 embodiment of the disclosure discloses an article scheduling method, an article scheduling device, electronic equipment and a computer readable medium. One embodiment of the method comprises: responding to the preset processing time of the current time, and acquiring article information and a warehouse information set corresponding to the article information; acquiring warehouse acquisition information corresponding to each warehouse information in the warehouse information set from a first target database to obtain a warehouse acquisition information set; for each warehouse acquisition information in the warehouse acquisition information set, generating an article storage score according to the warehouse acquisition information; determining each article supplement value corresponding to the warehouse information set according to the generated article storage scores; and controlling the associated vehicle to carry out article scheduling on the article corresponding to the article information according to the article supplement value. This embodiment avoids a backlog of items or an insufficient number of items in the warehouse.

Description

Article scheduling method, device, electronic equipment and computer readable medium
Technical Field
The embodiment of the disclosure relates to the technical field of computers, in particular to an article scheduling method, an article scheduling device, electronic equipment and a computer readable medium.
Background
With the continuous expansion of the size of the warehouse (sample dispatching machine), how to accurately determine the replenishment quantity of the articles in the warehouse and schedule the articles according to the determined replenishment quantity becomes an important subject. Currently, when determining the replenishment quantity of an article in a warehouse, the following methods are generally adopted: the replenishment quantity of the articles is determined by the staff, and the articles in the warehouse are replenished periodically.
However, when determining the replenishment quantity of the items in the warehouse in the above manner, there are often technical problems as follows:
firstly, when the replenishment quantity of the articles in a warehouse (a sample dispatching machine) is determined by a worker, the replenishment quantity of the articles cannot be accurately determined, and overstock of the articles in the warehouse or insufficient quantity of the articles are easily caused;
secondly, because the staff regularly replenishes the articles in the warehouse, the staff can only replenish the articles in the warehouse at intervals, and cannot schedule the articles in the warehouse with insufficient articles in time;
thirdly, when determining the score of the warehouse (the score of article storage), the score of the determined warehouse is inaccurate due to inaccurate stored characteristic configuration information, and the replenishment quantity of the articles cannot be accurately determined, so that the overstock of the articles in the warehouse or the insufficient quantity of the articles are easily caused;
fourth, when determining the replenishment quantity of the item according to the quantity of the item order information, the quantity of the item order information may not be universal due to special factors (e.g., weather factors), so that the replenishment quantity of the item cannot be accurately determined when determining the replenishment quantity of the item using each item order information, which may result in overstock of the item in the warehouse or insufficient quantity of the item.
Disclosure of Invention
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary 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 disclosure propose item scheduling methods, apparatuses, electronic devices and computer readable media to solve one or more of the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide an article scheduling method, including: responding to the preset processing time of the current time, and acquiring article information and a warehouse information set corresponding to the article information; acquiring warehouse acquisition information corresponding to each warehouse information in the warehouse information set from a first target database to obtain a warehouse acquisition information set; for each warehouse acquisition information in the warehouse acquisition information set, generating an article storage score according to the warehouse acquisition information; determining each article supplementary value corresponding to the warehouse information set according to the generated article storage scores; and controlling the associated vehicle to dispatch the article corresponding to the article information according to the article supplement value.
In a second aspect, some embodiments of the present disclosure provide an article scheduling apparatus, the apparatus comprising: the first acquisition unit is configured to respond to the fact that the current time is preset processing time, and acquire article information and a warehouse information set corresponding to the article information; the second acquisition unit is configured to acquire warehouse acquisition information corresponding to each warehouse information in the warehouse information sets from the first target database to obtain warehouse acquisition information sets; a generation unit configured to generate an article storage score for each of the warehouse acquisition information sets, based on the warehouse acquisition information; the determining unit is configured to determine each item supplement value corresponding to the warehouse information set according to the generated each item storage score; and the control unit is configured to control the associated vehicle to schedule the article corresponding to the article information according to the article supplementary value.
In a third aspect, some embodiments of the present disclosure provide an electronic device, comprising: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors, cause the one or more processors to implement the method described in any of the implementations of the first aspect.
In a fourth aspect, some embodiments of the present disclosure provide a computer readable medium on which a computer program is stored, wherein the program, when executed by a processor, implements the method described in any of the implementations of the first aspect.
The above embodiments of the present disclosure have the following beneficial effects: by the article scheduling method of some embodiments of the present disclosure, article backlogs or insufficient quantity of articles in a warehouse (sample dispatching machine) can be avoided. In particular, the reasons for the backlog of items or the insufficient quantity of items in the warehouse are: when the replenishment quantity of the articles in the warehouse (sample dispatching machine) is determined by the staff, the replenishment quantity of the articles cannot be accurately determined, and the overstock of the articles in the warehouse or the insufficient quantity of the articles are easily caused. Based on this, in the article scheduling method according to some embodiments of the present disclosure, first, in response to that the current time is the preset processing time, the article information and the warehouse information set corresponding to the article information are obtained; and acquiring warehouse acquisition information corresponding to each warehouse information in the warehouse information sets from the first target database to obtain a warehouse acquisition information set. Therefore, the information of the warehouse corresponding to a certain article can be acquired at any preset time, and data support is provided for subsequently determining the article storage score of the warehouse. And secondly, generating an article storage score for each warehouse acquisition information in the warehouse acquisition information set according to the warehouse acquisition information. Thus, the number of items to be replenished in the warehouse can be determined according to the item storage scores of the warehouse. And then, determining the supplement value of each article corresponding to the warehouse information set according to the generated storage score of each article. Therefore, the warehouse can be subjected to item scheduling according to the determined quantity of the items needing to be replenished. And finally, controlling the associated vehicle to schedule the article corresponding to the article information according to the article supplementary value. Thus, the scheduling of the items in the warehouse is completed. Avoiding the overstock of the goods in the warehouse or the shortage of the quantity of the goods.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and components are not necessarily drawn to scale.
Fig. 1 is a flow diagram of some embodiments of an item scheduling method according to the present disclosure;
FIG. 2 is a schematic block diagram of some embodiments of an item scheduling apparatus according to the present disclosure;
FIG. 3 is a schematic block diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
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 disclosure are shown in the drawings, it is to be understood that the 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 for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings. The embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 illustrates a flow 100 of some embodiments of an item scheduling method according to the present disclosure. The article scheduling method comprises the following steps:
step 101, in response to that the current time is the preset processing time, acquiring the article information and a warehouse information set corresponding to the article information.
In some embodiments, an executing entity (e.g., a server) of the item scheduling method may obtain, in response to that the current time is a preset processing time, item information and a warehouse information set corresponding to the item information from an associated database. The preset processing time may be a preset time for scheduling the articles, for example, the preset processing time may be eight am each day. The database may be a database storing item information and a warehouse information set corresponding to the item information. Here, the execution main body may acquire the item information and the warehouse information set corresponding to the item information from the database by wired connection or wireless connection. The article information includes an article number and a preset article scheduling value. The item code may be a code that uniquely represents an item. The preset item scheduling value may be a preset total number of items scheduled to each warehouse (sample dispatching machine). The warehouse information in the warehouse information set may be information of a warehouse in which the article is stored. The warehouse information includes a warehouse code. The above-mentioned warehouse code may be a code uniquely representing a certain warehouse. For example, the warehouse code may be: A03.
step 102, warehouse acquisition information corresponding to each warehouse information in the warehouse information set is acquired from the first target database, and a warehouse acquisition information set is obtained.
In some embodiments, the executing subject may obtain, from the first target database, warehouse acquisition information corresponding to each piece of warehouse information in the warehouse information sets, to obtain a warehouse acquisition information set. Wherein the warehouse acquisition information comprises at least one characteristic information. The characteristic information may characterize characteristics of the warehouse corresponding to the warehouse acquisition information. For example, the characteristic information may be warehouse circulation information. The warehouse turnover may be the number of items in the warehouse that were acquired (purchased) within a historical preset time period. The first target database may be a database storing warehouse acquired information. The executing agent may obtain, from the first target database, warehouse acquisition information corresponding to a warehouse code included in each of the warehouse information sets.
And 103, generating an article storage score for each warehouse acquisition information in the warehouse acquisition information set according to the warehouse acquisition information.
In some embodiments, the execution subject may generate an item storage score for each of the warehouse acquisition information sets according to the warehouse acquisition information.
In practice, the executing agent may generate the item storage score by:
first, for each warehouse acquisition information in the warehouse acquisition information set, a feature configuration information set corresponding to the warehouse acquisition information is acquired. The feature configuration information in the feature configuration information set may be preset information for representing the degree of importance between two pieces of feature information. For example, the feature configuration information may be "feature information a/feature information B =1", and the feature configuration information may represent the same degree of importance of the feature information a and the feature information B.
And secondly, executing the following processing steps based on each warehouse acquisition information in the warehouse acquisition information set and the characteristic configuration information set corresponding to the warehouse acquisition information:
and a first processing step of generating a characteristic information matrix according to the characteristic configuration information set and each characteristic information included in the warehouse acquisition information. In practice, first, the execution subject may arrange the respective feature information included in the warehouse acquisition information in an arbitrary order to generate a feature information sequence. Then, the execution main body may determine, according to the feature configuration information set, feature configuration information corresponding to every two pieces of feature information in each piece of feature information included in the warehouse acquisition information as target feature configuration information, so as to obtain a target feature configuration information set. Finally, the execution body may generate a feature information matrix according to the target feature configuration information set. The characteristic information matrix may be a judgment matrix. Here, the respective target feature arrangement information in the horizontal direction from left to right and the respective target feature arrangement information in the vertical direction from top to bottom of the feature information matrix correspond to the respective feature information in the feature information sequence in order.
And a second processing step, generating a matrix score value according to the characteristic information matrix.
In practice, the execution agent may generate the matrix score value by:
a first substep of determining the number of feature information included in the feature information sequence as a feature information number.
A second substep of determining, for each horizontal line in the feature information matrix, a product of each feature information in the horizontal line as a feature information product, and determining a root of the power of the feature information quantity of the feature information product as a weight vector.
And a third substep of determining the sum of the obtained individual weight vectors as a total weight vector.
A fourth substep of determining, for each of the obtained weight vectors, a ratio of the weight vector to the total weight vector as a horizontal weight.
And a fifth substep of sorting the obtained horizontal weights according to the corresponding characteristic information sequence to generate a horizontal weight sequence.
A sixth substep of determining, for each horizontal row in the feature information matrix, a product of each feature information in the horizontal row and a horizontal row weight corresponding to the feature information as a feature information vector, and determining a sum of the determined respective feature information vectors as a horizontal row vector.
A sixth substep of determining, for each horizontal weight in the horizontal weight sequence, a product of the horizontal weight and a quantity of feature information as a horizontal quantity weight, and determining a ratio of a horizontal vector corresponding to the horizontal weight and the horizontal quantity weight as a horizontal feature value.
And a seventh substep of determining a ratio of the sum of the determined horizontal eigenvalues to the number of eigenvalues of the matrix as an eigenvalue of the matrix.
And an eighth substep, selecting a matrix value corresponding to the quantity of the characteristic information from a preset matrix value table, and determining the ratio of the matrix characteristic value to the matrix value as a matrix value of credit.
A third processing step of adjusting each feature configuration information included in the feature configuration information set in response to the matrix score value being greater than a preset matrix score value, taking the adjusted feature configuration information set as a feature configuration information set, and executing the processing step again. The predetermined matrix score value may be a predetermined matrix score value.
And thirdly, determining a matrix coefficient set in response to the matrix score value being less than or equal to the preset matrix score value. In practice, the execution subject may determine each horizontal weight included in the horizontal weight sequence as a matrix coefficient set.
And fourthly, generating an item storage scoring model according to the matrix coefficient set. In practice, the executing body may input each matrix coefficient included in the matrix coefficient set to a weight formula, and generate an item storage scoring model.
And step 104, determining the supplement value of each article corresponding to the warehouse information set according to the generated storage score of each article.
In some embodiments, the executing body may determine, according to the generated each item storage score, each item supplementary value corresponding to the warehouse information set.
In practice, the execution subject may determine the supplementary value of each item corresponding to the warehouse information set by the following steps:
in a first step, the sum of the generated individual item storage scores is determined as an item storage total score.
A second step of, for each of the generated individual item storage scores, performing the following determination steps:
and a first determination step, wherein the ratio of the item storage score to the total item storage score is determined as a storage score ratio.
And a second determination step of determining the product of the storage grade ratio and a preset item modulation value included in the item information as an item supplement value.
And 105, controlling the associated vehicle to dispatch the goods corresponding to the goods information according to the supplement value of each goods.
In some embodiments, the execution subject may control the associated vehicle to schedule the item corresponding to the item information according to the item supplement value. The associated vehicle may be a vehicle connected to the execution main body by wire or wirelessly. For example, the vehicle may be an unmanned smart truck.
Optionally, in response to receiving the item order information sent by the target warehouse, determining the remaining storage amount of the items in the target warehouse.
In some embodiments, the execution subject may determine the remaining storage amount of the items in the target warehouse in response to receiving the item order information sent by the target warehouse. The target warehouse may be a warehouse that transmits item order information. The item order information may be order information for a user to obtain an item in the target warehouse. The item order information includes an item code, an order generation time, and an item acquisition quantity. The above-mentioned article acquisition quantity may be a preset quantity of articles that the user can acquire in the warehouse. The order generation time may be a time point at which the item order information is generated. The remaining storage capacity of the items may be the number of the items stored in the target warehouse.
Optionally, in response to that the article remaining storage amount is less than or equal to a preset remaining storage amount, controlling the associated vehicle to perform article scheduling on the target warehouse according to the article supplement value corresponding to the target warehouse.
In some embodiments, the executing agent may control the associated vehicle to schedule the items in the target warehouse according to the item supplement value corresponding to the target warehouse in response to the item remaining storage amount being less than or equal to a preset remaining storage amount.
The related content in the above options is an inventive point of the present disclosure, and the second technical problem mentioned in the background art is solved, "since the staff regularly replenishes the articles in the warehouse, the staff can only replenish the articles in the warehouse at intervals, and cannot timely schedule the articles in the warehouse with insufficient articles". The factors that cause the failure to schedule the goods in the warehouse with insufficient goods in time are as follows: because the staff regularly supplements the articles in the warehouse, the staff can only supplement the articles in the warehouse at intervals, and the article scheduling cannot be performed on the warehouse with insufficient articles in time. If the factors are solved, the effect of timely scheduling the articles in the warehouse with insufficient articles can be achieved. To achieve this, first, in response to receiving the item order information transmitted from the target warehouse, the remaining storage amount of the items in the target warehouse is determined. Therefore, whether the articles in the warehouse are insufficient or not is determined each time the article order information is received, and the situation that the articles are insufficient during the replenishing period and are not replenished in time when the articles in the warehouse are replenished at intervals is avoided. Secondly, in response to the fact that the residual storage amount of the articles is smaller than or equal to the preset residual storage amount, controlling the associated vehicle to carry out article scheduling on the target warehouse according to the article supplement value corresponding to the target warehouse. Therefore, the goods in the warehouse with insufficient goods are dispatched in time.
Optionally, in response to that the remaining storage amount of the item is greater than the preset remaining storage amount, determining the item order information as historical order information, and storing the historical order information in a second target database.
In some embodiments, the execution subject may determine the item order information as historical order information in response to the item remaining storage amount being greater than the preset remaining storage amount, and store the historical order information in a second target database. The second target database may be a database for storing historical order information.
Optionally, in response to that the number of the historical order information stored in the second target database is greater than or equal to a preset storage number, obtaining each piece of historical order information stored in the second target database as a historical order information set, and obtaining each piece of warehouse acquisition information corresponding to each piece of historical order information as a historical warehouse acquisition information set.
In some embodiments, the execution main body may, in response to that the number of the historical order information stored in the second target database is greater than or equal to a preset storage number, obtain each piece of historical order information stored in the second target database as a historical order information set, and obtain each piece of warehouse acquisition information corresponding to each piece of historical order information as a historical warehouse acquisition information set. The preset storage quantity may be a preset quantity for storing historical order information.
Optionally, data cleaning processing is performed on the historical order information set and the historical warehouse acquisition information set to generate a historical order information set and a historical warehouse acquisition information set after data cleaning as a data cleaning order information set and a data cleaning warehouse acquisition information set.
In some embodiments, the execution subject may perform data cleaning processing on the historical order information set and the historical warehouse acquisition information set to generate a data-cleaned historical order information set and historical warehouse acquisition information set as a data cleaning order information set and a data cleaning warehouse acquisition information set. The data cleaning process may be to delete empty historical order information and historical warehouse acquisition information to generate a data cleaning order information set and a data cleaning warehouse acquisition information set. The historical order information in the historical order information set corresponds to a warehouse code.
Optionally, a data cleaning order number set is generated according to the data cleaning order information set.
In some embodiments, the execution main body may generate a data cleaning order number set according to the data cleaning order information set. And the quantity of the data cleaning orders in the data cleaning order quantity set corresponds to the data cleaning warehouse acquisition information in the data cleaning warehouse acquisition information set. In practice, the execution main body may determine the quantity of each data cleaning order information set corresponding to the same warehouse code as the quantity of the data cleaning order, to obtain the quantity set of the data cleaning order. And the warehouse code corresponding to the data cleaning order quantity is the same as the warehouse code included in the data cleaning warehouse acquisition information.
Optionally, a scoring model coefficient set is generated based on the data cleaning warehouse acquisition information set, the data cleaning order quantity set, and a preset scoring model.
In some embodiments, the execution agent may generate a set of scoring model coefficients based on the set of data cleaning warehouse acquisition information, the set of data cleaning order quantities, and a preset scoring model.
In practice, the executing subject may generate the set of scoring model coefficients by:
in the first step, the sum of the quantities of the data cleaning orders in the data cleaning order quantity set is determined as the total quantity of the orders.
And secondly, determining the ratio of the number of the data cleaning orders to the total number of the orders as a historical item storage score for each data cleaning order number in the data cleaning order number set.
And thirdly, normalizing the characteristic information included in the data cleaning warehouse acquisition information set to generate a normalized warehouse acquisition information set. The normalized warehouse acquisition information in the normalized warehouse acquisition information set comprises at least one normalized characteristic information.
And fourthly, generating a scoring model coefficient set based on the determined storage scores of the historical articles, the quantity of the characteristic information and the normalized warehouse acquisition information set. In practice, the executing agent may generate the set of scoring model coefficients using the following formula:
Figure BDA0003712330330000111
wherein i represents a number. y represents the historical item storage score. y isiIndicating the ith historical item storage score. n represents the number of characteristic information. W represents the scoring model coefficients. WiRepresenting the ith scoring model coefficient. F denotes normalized feature information. FiAnd indicating normalized characteristic information included in the normalized warehouse acquisition information corresponding to the ith historical item storage score.
Figure BDA0003712330330000112
And indicating j normalized characteristic information included in the normalized warehouse acquisition information corresponding to the i-th historical item storage score.
And fifthly, updating the item storage scoring model based on the scoring model coefficient set and the matrix coefficient set.
In practice, the executing agent may update the item storage scoring model by:
the first substep, confirm the degree of similarity of coefficient set and above-mentioned matrix coefficient set of the above-mentioned scoring model. In practice, the executing entity may determine the similarity between the score model coefficient set and the matrix coefficient set by using a euclidean distance calculation formula.
And a second substep of updating the item storage scoring model according to the scoring model coefficient set in response to the similarity being greater than or equal to a preset similarity threshold. In practice, the executing body may replace each matrix coefficient included in the item storage scoring model with each scoring model coefficient corresponding to each matrix coefficient, so as to update the item storage scoring model.
And a third substep, generating model alarm information in response to the similarity being smaller than the preset similarity threshold, and sending the model alarm information to a related terminal for display. The model alarm information may be preset information for prompting that a coefficient of the model needs to be adjusted. For example, the model alarm information may be: "please adjust model parameters".
The related content in the first substep to the third substep is an inventive point of the present disclosure, and solves the technical problem mentioned in the background art, that "when determining the replenishment quantity of an item by the quantity of item order information, the quantity of the item order information may not be universal due to a special factor (for example, a weather factor), so that the replenishment quantity of the item cannot be determined accurately when determining the replenishment quantity of the item by using each item order information, which easily causes overstock of the items in the warehouse or shortage of the quantity of the items". The factors that lead to an insufficient quantity or backlog of items in the warehouse are as follows: when the replenishment quantity of the article is determined according to the quantity of the article order information, the quantity of the article order information may not be universal due to special factors (for example, weather factors), so that the replenishment quantity of the article cannot be accurately determined when the replenishment quantity of the article is determined by using each article order information, and overstock of the article in the warehouse or shortage of the quantity of the article is easily caused. If the above factors are solved, the effect of avoiding overstock of articles in the warehouse or insufficient quantity of articles can be achieved. To achieve this, first, the similarity between the score model coefficient set and the matrix coefficient set is determined. Therefore, whether the scoring model coefficient set is inaccurate due to special factors can be determined according to the similarity. And then, in response to the fact that the similarity is larger than or equal to a preset similarity threshold value, updating the item storage scoring model according to the scoring model coefficient set. Therefore, the item storage scoring model can be updated by using the accurate scoring model coefficient set, the replenishment quantity of the items can be accurately determined, and the condition that the overstocked items in the warehouse or the quantity of the items is insufficient is avoided. And finally, generating model alarm information in response to the fact that the similarity is smaller than the preset similarity threshold, and sending the model alarm information to a related terminal for displaying. Thereby, overstocking of articles or shortage of the number of articles in the warehouse is avoided.
The related content in the above options is an inventive point of the present disclosure, and solves the technical problem mentioned in the background art, namely "when determining the score of the warehouse (item storage score), the determined score of the warehouse is not accurate due to inaccurate storage feature configuration information, and the replenishment quantity of the item cannot be determined accurately, which easily causes overstock of the item in the warehouse or shortage of the quantity of the item". The factors that lead to an insufficient quantity or backlog of items in the warehouse are as follows: when the score (article storage score) of the warehouse is determined, the determined score of the warehouse is inaccurate due to inaccurate storage characteristic configuration information, and the replenishment quantity of the articles cannot be accurately determined, so that the overstock of the articles in the warehouse or the insufficient quantity of the articles are easily caused. If the above factors are solved, the effect of avoiding overstocking of articles in the warehouse or insufficient quantity of articles can be achieved. In order to achieve the effect, firstly, in response to that the number of the historical order information stored in the second target database is greater than or equal to a preset storage number, obtaining each piece of historical order information stored in the second target database as a historical order information set, and obtaining each piece of warehouse obtaining information corresponding to each piece of historical order information as a historical warehouse obtaining information set. Thus, data support may be provided for updating the item storage scoring model. And secondly, performing data cleaning processing on the historical order information set and the historical warehouse acquisition information set to generate a historical order information set and a historical warehouse acquisition information set after data cleaning as a data cleaning order information set and a data cleaning warehouse acquisition information set. Therefore, null data can be deleted from the historical order information set and the historical warehouse acquisition information set, and the accuracy of the data is guaranteed. Then, cleaning the order information set according to the data to generate a data cleaning order quantity set; and generating a scoring model coefficient set based on the data cleaning warehouse acquisition information set, the data cleaning order number set and a preset scoring model. Therefore, each coefficient in the item storage scoring model can be updated, so that more accurate item storage scoring can be generated, the replenishment quantity of the items can be accurately determined, and the overstock of the items in the warehouse or the shortage of the items can be avoided.
The above embodiments of the present disclosure have the following beneficial effects: by the article scheduling method of some embodiments of the present disclosure, article backlogs or insufficient quantity of articles in a warehouse (sample dispatching machine) can be avoided. In particular, the reasons for the backlog of items or the insufficient quantity of items in the warehouse are: when the replenishment quantity of the articles in the warehouse (sample dispatching machine) is determined by the staff, the replenishment quantity of the articles cannot be accurately determined, and the overstock of the articles in the warehouse or the shortage of the quantity of the articles is easily caused. Based on this, in the article scheduling method according to some embodiments of the present disclosure, first, in response to that the current time is the preset processing time, the article information and the warehouse information set corresponding to the article information are obtained; and acquiring warehouse acquisition information corresponding to each warehouse information in the warehouse information sets from the first target database to obtain a warehouse acquisition information set. Therefore, the information of the warehouse corresponding to a certain article can be acquired at any preset time, and data support is provided for subsequently determining the article storage score of the warehouse. And secondly, generating an article storage score for each warehouse acquisition information in the warehouse acquisition information set according to the warehouse acquisition information. Thus, the number of items that the warehouse needs to be replenished can be determined from the item storage scores of the warehouse. And then, determining each article supplementary value corresponding to the warehouse information set according to the generated each article storage score. Therefore, the warehouse can be subjected to item scheduling according to the determined quantity of the items needing to be replenished. And finally, controlling the associated vehicle to dispatch the article corresponding to the article information according to the article supplement value. Thus, the scheduling of the items in the warehouse is completed. Avoiding the overstock of the goods in the warehouse or the shortage of the quantity of the goods.
With further reference to fig. 2, as an implementation of the methods shown in the above figures, the present disclosure provides some embodiments of an article scheduling apparatus, which correspond to those shown in fig. 1, and which may be applied in various electronic devices.
As shown in fig. 2, the article scheduling apparatus 200 of some embodiments includes: a first acquisition unit 201, a second acquisition unit 202, a generation unit 203, a determination unit 204, and a control unit 205. The first obtaining unit 201 is configured to obtain the item information and the warehouse information set corresponding to the item information in response to that the current time is a preset processing time; the second obtaining unit 202 is configured to obtain warehouse obtaining information corresponding to each warehouse information in the warehouse information sets from the first target database, so as to obtain a warehouse obtaining information set; the generation unit 203 is configured to generate an item storage score for each of the warehouse acquisition information sets, based on the warehouse acquisition information; the determining unit 204 is configured to determine, according to the generated storage scores of the respective items, the supplementary value of the respective items corresponding to the warehouse information set; the control unit 205 is configured to control the associated vehicle to perform item scheduling on the item corresponding to the item information according to the item supplement values.
It will be understood that the units described in the apparatus 200 correspond to the various steps in the method described with reference to fig. 1. Thus, the operations, features and resulting advantages described above with respect to the method are also applicable to the apparatus 200 and the units included therein, and are not described herein again.
Referring now to fig. 3, a block diagram of an electronic device 300 suitable for use in implementing some embodiments of the present disclosure is shown. The electronic device in some embodiments of the present disclosure may include, but is not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and the like, and fixed terminals such as digital TVs, desktop computers, and the like. The electronic device shown in fig. 3 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 3, the electronic device 300 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 301 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM) 302 or a program loaded from a storage means 308 into a Random Access Memory (RAM) 303. In the RAM 303, various programs and data necessary for the operation of the electronic apparatus 300 are also stored. The processing device 301, the ROM 302, and the RAM 303 are connected to each other via a bus 304. An input/output (I/O) interface 305 is also connected to bus 304.
Generally, the following devices may be connected to the I/O interface 305: input devices 306 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, or the like; an output device 307 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; and a communication device 309. The communication means 309 may allow the electronic device 300 to communicate wirelessly or by wire with other devices to exchange data. While fig. 3 illustrates an electronic device 300 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided. Each block shown in fig. 3 may represent one device or may represent multiple devices, as desired.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to the flow diagrams 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 readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In some such embodiments, the computer program may be downloaded and installed from a network through the communication device 309, or installed from the storage device 308, or installed from the ROM 302. The computer program, when executed by the processing apparatus 301, performs the above-described functions defined in the methods of some embodiments of the present disclosure.
It should be noted that the computer readable medium described 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 two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the 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, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications 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 network.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: and responding to the fact that the current time is the preset processing time, and acquiring the article information and a warehouse information set corresponding to the article information. And acquiring warehouse acquisition information corresponding to each warehouse information in the warehouse information sets from the first target database to obtain a warehouse acquisition information set. And generating an article storage score for each warehouse acquisition information in the warehouse acquisition information set according to the warehouse acquisition information. And determining the supplement value of each article corresponding to the warehouse information set according to the generated storage score of each article. And controlling the associated vehicle to dispatch the article corresponding to the article information according to the article supplement value.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. 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 latter scenario, 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 the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present 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 software, and may also be implemented by hardware. The described units may also be provided in a processor, which may be described as: a processor includes a first acquisition unit, a second acquisition unit, a generation unit, a determination unit, and a control unit. The names of the units do not form a limitation on the units themselves in some cases, and for example, the first obtaining unit may also be described as a "unit that obtains the item information and the warehouse information set corresponding to the item information in response to the current time being the preset processing time".
The functions described herein above 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 a chip (SOCs), complex Programmable Logic Devices (CPLDs), and the like.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology 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-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept as defined above. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.

Claims (7)

1. An item scheduling method, comprising:
responding to the fact that the current time is preset processing time, and acquiring article information and a warehouse information set corresponding to the article information;
acquiring warehouse acquisition information corresponding to each warehouse information in the warehouse information set from a first target database to obtain a warehouse acquisition information set;
for each warehouse acquisition information in the warehouse acquisition information set, generating an article storage score according to the warehouse acquisition information;
determining each article supplementary value corresponding to the warehouse information set according to the generated each article storage score;
and controlling the associated vehicle to carry out article scheduling on the article corresponding to the article information according to the article supplement value.
2. The method of claim 1, wherein the warehouse acquisition information includes at least one characteristic information; and
generating an item storage score for each of the warehouse acquisition information sets according to the warehouse acquisition information, including:
for each warehouse acquisition information in the warehouse acquisition information set, acquiring a characteristic configuration information set corresponding to the warehouse acquisition information;
based on each warehouse acquisition information in the warehouse acquisition information set and the characteristic configuration information set corresponding to the warehouse acquisition information, executing the following processing steps:
generating a characteristic information matrix according to characteristic configuration information sets and each characteristic information included in the warehouse acquisition information;
generating a matrix score value according to the characteristic information matrix;
and responding to the matrix score value being larger than the preset matrix score value, adjusting each feature configuration information included in the feature configuration information set, taking the adjusted feature configuration information set as the feature configuration information set, and executing the processing step again.
3. The method of claim 2, wherein the generating, for each of the set of warehouse acquired information, an item storage score from the warehouse acquired information, further comprises:
determining a matrix coefficient set in response to the matrix score value being less than or equal to the preset matrix score value;
generating an item storage scoring model according to the matrix coefficient set;
and generating an article storage score according to the article storage score model and the warehouse acquisition information.
4. The method of claim 1, wherein the item information comprises a preset item scheduling value; and
the determining of the supplement value of each article corresponding to the warehouse information set according to the generated storage score of each article comprises the following steps:
determining the sum of the generated individual item storage scores as an item storage total score;
for each item storage score of the generated individual item storage scores, performing the following determining steps:
determining the ratio of the item storage score to the item storage total score as a storage score ratio;
and determining the product of the storage grade ratio and a preset item modulation value included by the item information as an item supplement value.
5. An article scheduling apparatus comprising:
the system comprises a first acquisition unit, a second acquisition unit and a processing unit, wherein the first acquisition unit is configured to respond to the condition that the current time is a preset processing time, and acquire article information and a warehouse information set corresponding to the article information;
a second obtaining unit, configured to obtain warehouse obtaining information corresponding to each warehouse information in the warehouse information sets from the first target database, so as to obtain a warehouse obtaining information set;
a generation unit configured to generate an item storage score for each of the warehouse acquisition information sets according to the warehouse acquisition information;
the determining unit is configured to determine each item supplement value corresponding to the warehouse information set according to the generated each item storage score;
and the control unit is configured to control the associated vehicle to schedule the article corresponding to the article information according to the article supplementary value.
6. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon;
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-4.
7. A computer-readable medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method of any one of claims 1 to 4.
CN202210723014.0A 2022-06-24 2022-06-24 Article scheduling method, device, electronic equipment and computer readable medium Pending CN115271582A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210723014.0A CN115271582A (en) 2022-06-24 2022-06-24 Article scheduling method, device, electronic equipment and computer readable medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210723014.0A CN115271582A (en) 2022-06-24 2022-06-24 Article scheduling method, device, electronic equipment and computer readable medium

Publications (1)

Publication Number Publication Date
CN115271582A true CN115271582A (en) 2022-11-01

Family

ID=83760973

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210723014.0A Pending CN115271582A (en) 2022-06-24 2022-06-24 Article scheduling method, device, electronic equipment and computer readable medium

Country Status (1)

Country Link
CN (1) CN115271582A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116245595A (en) * 2022-12-07 2023-06-09 国网物资有限公司 Method, apparatus, electronic device and computer readable medium for transporting supply end article

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116245595A (en) * 2022-12-07 2023-06-09 国网物资有限公司 Method, apparatus, electronic device and computer readable medium for transporting supply end article

Similar Documents

Publication Publication Date Title
CN111932161B (en) Vehicle scheduling method and device for articles, electronic equipment and computer medium
CN111932189B (en) Inventory related information display method, device, electronic equipment and computer medium
CN115130065B (en) Method, device and equipment for processing characteristic information of supply terminal and computer readable medium
CN113034090B (en) Transportation equipment scheduling method and device, electronic equipment and computer readable medium
CN112184100A (en) Article inventory monitoring method and device, electronic equipment and computer readable medium
CN109345166B (en) Method and apparatus for generating information
CN112562229A (en) Settlement device control method, settlement device control device, electronic device and computer readable medium
CN114048931B (en) Replenishment information generation method and device, electronic equipment and computer readable medium
CN115271582A (en) Article scheduling method, device, electronic equipment and computer readable medium
CN114066363A (en) Order information processing method and device, electronic equipment and computer readable medium
CN113610448A (en) Article scheduling method and device, electronic equipment and computer readable medium
CN114663015A (en) Replenishment method and device
CN112581043A (en) Device control method, device, electronic device and computer readable medium
CN112102043A (en) Item recommendation page generation method and device, electronic equipment and readable medium
CN112308378A (en) Scheduling device control method, scheduling device control device, electronic device and computer readable medium
CN116245595A (en) Method, apparatus, electronic device and computer readable medium for transporting supply end article
CN112862415A (en) Transportation vehicle scheduling method and device, electronic equipment and computer readable medium
CN113673931A (en) Vehicle scheduling method, device, equipment and computer readable medium for article
CN112085441A (en) Information generation method and device, electronic equipment and computer readable medium
CN113112202A (en) Item information sending method, item information sending device, electronic equipment and computer readable medium
CN112364232A (en) Information generation method and device, electronic equipment and computer readable medium
CN111985967A (en) Article information generation method and device, electronic equipment and computer readable medium
CN111932191A (en) Shelf scheduling method and device, electronic equipment and computer readable medium
CN113222304A (en) Inventory scheduling method and device
CN113554385B (en) Distribution robot control method, distribution robot control device, electronic equipment and computer readable 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