CN113159467A - Vehicle dispatching order processing method and device - Google Patents

Vehicle dispatching order processing method and device Download PDF

Info

Publication number
CN113159467A
CN113159467A CN202010074727.XA CN202010074727A CN113159467A CN 113159467 A CN113159467 A CN 113159467A CN 202010074727 A CN202010074727 A CN 202010074727A CN 113159467 A CN113159467 A CN 113159467A
Authority
CN
China
Prior art keywords
articles
total
storage position
picking
platform
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.)
Granted
Application number
CN202010074727.XA
Other languages
Chinese (zh)
Other versions
CN113159467B (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.)
Beijing Jingdong Zhenshi Information Technology Co Ltd
Original Assignee
Beijing Jingdong Zhenshi Information 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 Beijing Jingdong Zhenshi Information Technology Co Ltd filed Critical Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority to CN202010074727.XA priority Critical patent/CN113159467B/en
Publication of CN113159467A publication Critical patent/CN113159467A/en
Application granted granted Critical
Publication of CN113159467B publication Critical patent/CN113159467B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/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
    • G06Q10/06315Needs-based resource requirements planning or analysis
    • 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

Landscapes

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

Abstract

The invention discloses a method and a device for processing a car dispatching order, and relates to the technical field of computers. One embodiment of the method comprises: receiving a plurality of vehicle dispatching orders, and acquiring the identification and the demand quantity of the articles in the orders based on the orders in the vehicle dispatching orders; counting the total quantity of the demand of the articles, positioning the bays with the inventory quantity being more than or equal to the total quantity of the demand according to the inventory quantity of the articles in each bay, and acquiring the platform in the idle state currently in the positioning bays; and acquiring the total number of the platforms corresponding to all the articles, and combining a plurality of vehicle dispatching lists into one wave number if the total number is greater than or equal to a preset platform number threshold value. The implementation mode breaks through the mode that the existing one car dispatching order corresponds to one wave number, and the purpose of generating one wave number for mixed production by a plurality of car dispatching orders is achieved through the mode that the WMS establishes the production wave number; through the multiple-time monthly platform building rule, the warehouse/monthly platform capable of providing goods picking service can be determined, so that the goods picking efficiency is improved.

Description

Vehicle dispatching order processing method and device
Technical Field
The invention relates to the field of warehouse logistics, in particular to a method and a device for processing a car dispatching order.
Background
With the rapid development of electronic commerce, online shopping has become a hot tide, and the demand of users for the delivery speed of merchants is higher and higher. At present, after orders, especially large orders, enter a scheduling system, a carrier needs to make an appointment and dispatch, and a warehouse produces the orders based on the dispatch result of the carrier and produces the orders in a single-pass mode.
In the process of implementing the invention, the inventor finds that the prior art has at least the following problems:
1) the production rhythm of the warehouse is influenced by the dispatching result of the carrier and cannot be controlled autonomously;
2) the carrier has fewer orders for each vehicle dispatching order, lower polymerization degree of articles in the wave, scattered picking, a plurality of picking tasks in the same storage position need to be reciprocated back and forth by a plurality of persons, the picking path is longer as a whole, and the efficiency is low.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for processing a dispatch list, which can at least solve the problem in the prior art that an article delivery rate is slow because one dispatch list only corresponds to one pass.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a car park order processing method including:
receiving a plurality of vehicle dispatching orders, and acquiring the identification and the demand quantity of the articles in the orders based on the orders in the vehicle dispatching orders;
counting the total quantity of the demand of the articles, positioning the bays with the inventory quantity being more than or equal to the total quantity of the demand according to the inventory quantity of the articles in each bay, and acquiring the platform in the idle state currently in the positioning bays;
and acquiring the total number of the platforms corresponding to all the articles, and combining the plurality of vehicle dispatching lists into one wave number if the total number is greater than or equal to a preset platform number threshold.
Optionally, the positioning the warehouse quantity is greater than or equal to the warehouse space of the total amount of the demand, further comprising:
if the storage quantity is not larger than or equal to the warehouse of the total demand quantity, accumulating the storage quantity according to the sequence from large to small;
and if the accumulated amount is larger than or equal to the total amount required, taking the plurality of bins corresponding to the accumulated amount as the positioning bins of the article.
Optionally, after combining the plurality of car delivery lists into one wave, the method further includes:
determining storage positions in the positioning cabin, wherein the storage positions store the articles, and obtaining the inventory satisfaction rate of each storage position to the articles according to the inventory and the positioned quantity of the articles in each storage position and the total quantity of the demand;
if a first storage position with the first stock satisfaction rate exists, taking the first storage position as a positioning storage position of the article; or
If the first storage position does not exist but a storage position with the stock satisfaction rate smaller than one exists, extracting a second storage position with the maximum stock satisfaction rate from all storage positions with the stock satisfaction rate smaller than one, and taking the second storage position as a positioning storage position of the article; or
And if the first storage position and the second storage position do not exist, gradually accumulating the available stock of the articles in each storage position according to the sequence from small stock satisfaction rate to large stock satisfaction rate, and taking a plurality of storage positions with the accumulated amount larger than or equal to the required total amount as the positioning storage positions of the articles.
Optionally, before determining the storage location of the item stored in the positioning compartment, the method further includes:
if the quantity of the warehouse where the articles are positioned is multiple, determining a first warehouse which is ranked according to the sequence of the stock quantity of the articles in each warehouse from large to small, and taking the first warehouse as the supply quantity of the articles in the first warehouse;
obtaining the residual demand total amount of the demand total amount after the first stock amount is removed, judging whether the second stock amount is larger than or equal to the residual demand total amount according to a second sorted stock amount, and if so, taking the residual demand total amount as the supply amount of the goods between second bins;
otherwise, repeating the operation until the supply amount of the articles among the bins is determined.
Optionally, the storage positions include a total lifting storage position and a non-total lifting storage position; wherein, the total storage position is a storage position capable of supplying articles in batches;
the method further comprises the following steps:
if the located storage position is a total storage position, determining the picking tasks corresponding to the storage position in the times so as to combine all the determined picking tasks into a task group; or
If the located storage position is a non-total storage position, determining a platform corresponding to the storage position and a seeding area corresponding to the determined platform, and counting the total number of the determined platform and the seeding area;
judging whether the counted total number is greater than or equal to a preset number threshold value, and if so, combining the picking tasks corresponding to the storage positions in the times into a task group;
otherwise, accumulating the total number counted and the total number counted by the rest storage positions, determining the storage positions with the accumulated amount larger than or equal to the preset number threshold value, and combining the picking tasks corresponding to the accumulated storage positions in the times into a task group.
Optionally, the method further includes: distributing task groups to corresponding storage positions to trigger the storage positions to perform order picking operation according to order picking tasks in the task groups, and combining picked items to obtain order picking sets; determining the number of platforms corresponding to the task group, and if the number is one, transmitting the picking set to the determined platform; or if the quantity is more than one, the order picking sets are transmitted to the positions to be sowed, and sowing tasks of the order picking sets are generated.
Optionally, after generating the seeding task for the picking set, the method further includes:
sequencing the determined platforms according to the platform numbers, determining first articles corresponding to a first platform which is sequenced first, extracting the first articles from the picking collection and sowing the first articles into the first platform; wherein, seeding is the process of picking up goods to the platform;
acquiring a remaining picking set of the picking set after the first item is removed, and extracting a second item from the remaining picking set and sowing the second item into a second platform based on the second item corresponding to the second platform which is sorted;
and repeating the operation until the objects in the picking collection are sown.
To achieve the above object, according to another aspect of the embodiments of the present invention, there is provided a car park order processing apparatus including:
the vehicle dispatching order receiving module is used for receiving a plurality of vehicle dispatching orders and acquiring the identification and the demand quantity of the items in the orders based on the orders in the vehicle dispatching orders;
the inter-bin positioning module is used for counting the total quantity of the required articles, positioning the inter-bin with the stock quantity greater than or equal to the total quantity of the required articles according to the stock quantity of the articles in each inter-bin, and acquiring the platform in an idle state currently in the positioning inter-bin;
and the wave number establishing module is used for acquiring the total number of the platforms corresponding to all the articles, and combining the plurality of vehicle dispatching lists into one wave number if the total number is greater than or equal to a preset platform number threshold.
Optionally, the inter-bin positioning module is further configured to:
if the storage quantity is not larger than or equal to the warehouse of the total demand quantity, accumulating the storage quantity according to the sequence from large to small;
and if the accumulated amount is larger than or equal to the total amount required, taking the plurality of bins corresponding to the accumulated amount as the positioning bins of the article.
Optionally, the positioning device further comprises a storage location positioning module, configured to:
determining storage positions in the positioning cabin, wherein the storage positions store the articles, and obtaining the inventory satisfaction rate of each storage position to the articles according to the inventory and the positioned quantity of the articles in each storage position and the total quantity of the demand;
if a first storage position with the first stock satisfaction rate exists, taking the first storage position as a positioning storage position of the article; or
If the first storage position does not exist but a storage position with the stock satisfaction rate smaller than one exists, extracting a second storage position with the maximum stock satisfaction rate from all storage positions with the stock satisfaction rate smaller than one, and taking the second storage position as a positioning storage position of the article; or
And if the first storage position and the second storage position do not exist, gradually accumulating the available stock of the articles in each storage position according to the sequence from small stock satisfaction rate to large stock satisfaction rate, and taking a plurality of storage positions with the accumulated amount larger than or equal to the required total amount as the positioning storage positions of the articles.
Optionally, the storage location positioning module is further configured to:
if the quantity of the warehouse where the articles are positioned is multiple, determining a first warehouse which is ranked according to the sequence of the stock quantity of the articles in each warehouse from large to small, and taking the first warehouse as the supply quantity of the articles in the first warehouse;
obtaining the residual demand total amount of the demand total amount after the first stock amount is removed, judging whether the second stock amount is larger than or equal to the residual demand total amount according to a second sorted stock amount, and if so, taking the residual demand total amount as the supply amount of the goods between second bins;
otherwise, repeating the operation until the supply amount of the articles among the bins is determined.
Optionally, the storage positions include a total lifting storage position and a non-total lifting storage position; wherein, the total storage position is a storage position capable of supplying articles in batches;
the apparatus also includes a task combination module to:
if the located storage position is a total storage position, determining the picking tasks corresponding to the storage position in the times so as to combine all the determined picking tasks into a task group; or
If the located storage position is a non-total storage position, determining a platform corresponding to the storage position and a seeding area corresponding to the determined platform, and counting the total number of the determined platform and the seeding area;
judging whether the counted total number is greater than or equal to a preset number threshold value, and if so, combining the picking tasks corresponding to the storage positions in the times into a task group;
otherwise, accumulating the total number counted and the total number counted by the rest storage positions, determining the storage positions with the accumulated amount larger than or equal to the preset number threshold value, and combining the picking tasks corresponding to the accumulated storage positions in the times into a task group.
Optionally, the system further comprises a pick generation module, configured to:
distributing task groups to corresponding storage positions to trigger the storage positions to perform order picking operation according to order picking tasks in the task groups, and combining picked items to obtain order picking sets;
determining the number of platforms corresponding to the task group, and if the number is one, transmitting the picking set to the determined platform; or
And if the quantity is more than one, transmitting the picking collection to a position to be sowed, and generating a sowing task for the picking collection.
Optionally, the system further comprises an article sowing module, configured to:
sequencing the determined platforms according to the platform numbers, determining first articles corresponding to a first platform which is sequenced first, extracting the first articles from the picking collection and sowing the first articles into the first platform; wherein, seeding is the process of picking up goods to the platform;
acquiring a remaining picking set of the picking set after the first item is removed, and extracting a second item from the remaining picking set and sowing the second item into a second platform based on the second item corresponding to the second platform which is sorted;
and repeating the operation until the objects in the picking collection are sown.
To achieve the above object, according to still another aspect of embodiments of the present invention, there is provided a car park order processing electronic device.
The electronic device of the embodiment of the invention comprises: one or more processors; and the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors realize any one of the dispatch list processing methods.
To achieve the above object, according to still another aspect of embodiments of the present invention, there is provided a computer-readable medium having a computer program stored thereon, the program, when executed by a processor, implementing any one of the dispatch orders processing methods described above.
According to the scheme provided by the invention, one embodiment of the invention has the following advantages or beneficial effects: in order to improve the delivery speed of the warehouse, break through the mode that one current car dispatching order corresponds to one wave number, and realize the purpose of generating one wave number for mixed production by a mode that a WMS self constructs the production wave number, the warehouse can independently control the production rhythm; through the multiple-wave-time building rule of the platforms, the warehouse/platform capable of providing the picking service can be determined, so that the whole picking efficiency is improved, and the delivery speed is increased.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic flow chart illustrating a method for processing a dispatch list according to an embodiment of the present invention;
FIG. 2 is a flow chart diagram illustrating an alternative method for processing a pick-up order according to an embodiment of the present invention;
FIG. 3 is a schematic flow chart diagram illustrating an alternative method for processing a pick-up order according to an embodiment of the present invention;
FIG. 4 is a schematic flow chart diagram illustrating an alternative method for processing a pick-up order according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of the main modules of a dispatch list processing apparatus according to an embodiment of the present invention;
FIG. 6 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
FIG. 7 is a schematic block diagram of a computer system suitable for use with a mobile device or server implementing an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
It should be noted that the embodiment of the present invention is applicable to a dispatching and ex-Warehouse scene of all goods in a wireless commercial logistics storage System (WMS), such as a refrigerator, a color tv, a wardrobe, etc.
Referring to fig. 1, a main flowchart of a method for processing a car dispatch list according to an embodiment of the present invention is shown, which includes the following steps:
s101: receiving a plurality of vehicle dispatching orders, and acquiring the identification and the demand quantity of the articles in the orders based on the orders in the vehicle dispatching orders;
s102: counting the total quantity of the demand of the articles, positioning the bays with the inventory quantity being more than or equal to the total quantity of the demand according to the inventory quantity of the articles in each bay, and acquiring the platform in the idle state currently in the positioning bays;
s103: and acquiring the total number of the platforms corresponding to all the articles, and combining the plurality of vehicle dispatching lists into one wave number if the total number is greater than or equal to a preset platform number threshold.
In the above embodiment, for step S101, the article needs to be taken out of the warehouse via the warehouse WMS, and the warehouse may receive a plurality of car delivery orders within the same time period; the order is an order for transporting a plurality of orders in a vehicle unit.
In the invention, a plurality of vehicle dispatching orders are processed simultaneously. A wave frequency building switch is arranged in the warehouse, and when the switch is turned on, the dispatching orders are analyzed, so that the identification of each order contained in each dispatching order is determined according to the identification of the dispatching order, and further the identification and the demand quantity of each article in each order are determined; for example, the car order 1 includes order 1 and order 2, where order 1 includes 10 refrigerators, 10 color tvs, and 20 closets, and order 2 includes 30 refrigerators, 5 color tvs, and 10 tables.
Further, the warehouse can sequentially process the car dispatch lists according to the generation time/receiving time of the car dispatch lists; or may be a process for a priority order, such as the order labeled 211; or the mixed processing of the prior vehicle dispatching list and the common vehicle dispatching list; where 211 is the case where orders are placed at 9:00 pm or later (or other time period), but are required to be received the next day.
Furthermore, the received car dispatching list may have the order to be processed preferentially, in order to avoid the situation of order postponing processing, the latest delivery date (i.e. the receiving date selected by the user when placing the order on the platform) of each order in each car dispatching list may be traversed, if there is a current date, the state of the car dispatching list is modified to 211, and the current date is transmitted to the set of the car dispatching lists to be processed preferentially, otherwise, the current date is not 211. And when the dispatch list is not downloaded for more than 30 minutes, showing the 'dispatch list download warning' and updating once in 10 minutes (for example only).
For step S102, for items required for a plurality of car orders, there may be "repeat items" and "non-repeat items":
1) determining the articles corresponding to a plurality of orders at the same time as 'repeated articles', and counting the demand of the articles in the corresponding orders to obtain the total demand of the 'repeated articles'; for example, the refrigerators in the above example exist in order 1 and order 2 at the same time, and the total demand is 10+30 to 40;
2) determining the items only existing in one order as non-repeatability items, and determining the demand quantity of the items in the corresponding order as the total demand quantity; for example, the wardrobe in the above example is only in order 1, and thus the required amount of the wardrobe in order 1 is 20, which is the total required amount.
For convenience of management, a plurality of bins (for example, 2 to 3 bins) are usually arranged in the warehouse, a plurality of storage positions are arranged in each bin, and each storage position stores articles, so that the warehouse-bin-storage position-article nesting relationship is formed integrally.
The storage quantity of a certain article in the warehouse is the aggregate value of the storage quantity of the article in each storage position in the warehouse; for example, if the number of the storerooms is 1 to the storage position 1 to the refrigerator-50 and the number of the storage positions 2 to the refrigerator-20, the stock amount of the refrigerator is 70.
In order to reduce the number of picking up goods back and forth, whether a certain warehouse can meet the total quantity of the goods is judged. Specifically, according to the identification of the article (including "repeat article" and "non-repeat article"), the compartment in which the article is stored is determined, and then whether the stock quantity of the article in the compartment is greater than or equal to the total quantity required is compared:
1) only if the inventory of one warehouse is more than or equal to the total quantity of the required goods, the warehouse is directly determined as a positioning warehouse; wherein, positioning is the process of finding a bay/platform/storage according to the ordered items. For example, the stock amount 70 of the refrigerator in the compartment 1 is more than 40 in the total demand amount, so the compartment 1 is a positioning compartment for the refrigerator.
2) If the quantity of the storage quantity is more than the quantity of the required goods, the selection mode can be as follows:
firstly, sequentially selecting according to the numbers of the bins, for example, 3 bins are arranged in a warehouse, the default bin sequence is 1-2-3, and the bins meeting the requirements are 2 and 3, so that the bin 2 is positioned;
randomly selecting one of the bins as a positioning bin;
and thirdly, selecting the bin with the minimum current workload as the positioning bin according to a load balancing principle.
3) If the warehouse space with the inventory amount larger than or equal to the total quantity of the required goods does not exist, the following steps are performed:
the method comprises the following steps: accumulating the stock according to the order of the stock from large to small;
step two: and if the accumulated amount is larger than or equal to the total amount of the required goods, taking the plurality of bins corresponding to the accumulated amount as the positioning bins of the goods.
For example, the stock amounts of the refrigerator in the compartment 1, the compartment 2, and the compartment 3 are 5, 30, and 10, respectively, and since 30+10 is 40, the compartment 2 and the compartment 3 are used as the positioning compartment of the refrigerator.
And after the completion of the compartment is determined, switching the dispatching list state into a platform to be positioned. After a worker (a human or a robot) picks up goods in the warehouse, the worker needs to transmit the goods to a platform for picking up the goods so as to distribute the goods to different orders; wherein, the platform is a goods delivering and storing area between warehouses.
The number of platforms in each bay is limited, and when the traffic volume is large, the platforms in some bays may be too heavy to provide service. Considering this, after determining the bin space, it is also necessary to judge whether the service can be provided:
1) only one positioning bin is arranged-the stock is more than or equal to the total demand
Firstly, determining a platform in an idle state in the warehouse as a positioning platform if the platform exists in the warehouse;
if the storage total amount of the articles among the rest bins meets the requirement total amount, the rest bins are used as positioning bins for the articles, and the platform is determined as the positioning platform.
Considering that the articles are delivered from the same compartment as much as possible to avoid the problem of picking the articles back and forth, the invention selects to execute the waiting operation under the condition that the number of the positioning compartments is only one and no idle-state platform exists. In actual operation, the selection is specifically carried out according to the working personnel.
2) The number of the positioning bins is multiple, the stock quantity is less than the total quantity of the demand, and the platform is determined according to the mode.
For the articles which are still positioned at the platform to be positioned after the positioning failure, the platform can be automatically positioned according to a certain period (every 10 minutes), and after all the articles are positioned successfully, the dispatching list state is switched to be the wave number to be created.
For step S103, adding a wavelength configuration to the system WMS configuration: when 0 is closed and 1 is opened, and a master switch is opened, a positioning strategy needs to be configured into master positioning; when closed, the positioning strategy is selected by the user. After the dispatch list is downloaded, before the wave number is constructed according to the wave number construction rule configured by the system, it is required to determine whether the wave number construction configuration is 1.
The wave order construction rule set by the system WMS can carry out wave order construction according to a plurality of dimensional indexes such as time intervals, order quantity, delivery platform number, order number, delivery volume, dispatching order quantity and the like. When a user clicks to enter a configuration page, the configured parameters of the system can be brought out, or the rule creation is carried out according to the requirement of the user.
The rule configuration page is provided with:
1) time period: if the current time is greater than the starting time and less than or equal to the ending time, calling the wave-number planning parameters of the group;
2) only 211 wave orders: after checking, only 211 dispatching orders participate in automatic construction of the order before the order is cut, and when the order cutting time is up, orders which are not 211 can participate in the automatic construction of the order. For example, the wave number planning parameter is provided with two order-cutting times, the order-cutting time is 11 points, only 211 groups of wave numbers are selected, and the order number is 100; at the time of 15 orders taking, only 211 groups of waves are not selected, and the order quantity is 100 orders.
Firstly, when the number of the orders is 10, the order quantity of the order 211 is 90, if the order is not 211, the order is 20, and the wave number is not established;
secondly, 10 points and 30 points are carried out, 211 the order quantity of the car dispatching orders is 100 orders, and the times of wave formation are established;
③ 11 point 211 is not enough for 100 orders, 211 and 211 together form a wave.
3) The order quantity is as follows: after the number of the orders of the wave times reaches the corresponding preset number, the wave times can be generated, and the number of the pickup orders in the wave times is not contained;
4) number of orders: after the number of the order forms (without virtual commodities) of the wave times reaches a corresponding preset number, the wave times can be generated, and the number of the pickup forms in the wave times is not contained;
5) number of car dispatching orders: after the number of the car dispatching orders of the wave-forming times reaches the corresponding preset number, the wave-forming times can be generated;
6) number of delivery months: when the number of the positioned platforms reaches the corresponding preset number, a wave number can be generated, and the wave number state is to be positioned; for example, the number of platforms located is 10 ≧ 8 (predetermined number).
7) Delivery volume: after the volume of the goods in the car dispatching order of the wave number reaches a corresponding preset number, the wave number can be generated;
8) full bin group wave/carrier group wave: alternatively, the whole bins are grouped together or according to the carrier dimension;
9) seeding maximum number of the platforms: for the task engine parameters, only maintenance entries are made here.
The wave-frequency building rules selected in different periods can be different, and the invention selects the 'delivery platform number' total condition (namely the wave-frequency building rule) to combine the received multiple vehicle dispatching units into one wave-frequency. The rule avoids the problem that the service cannot be provided between the positioning bins by analyzing the number of platforms which can provide the service between the positioning bins, so that the goods picking efficiency is improved.
For newly created wave numbers, a wave number management page can be set for the convenience of viewing by an operator, and positioning and printing of the wave numbers are supported. For example, the wave number WVTJ17017100000173 has the wave type 211, the volume 1243 and the creation time 2017.07.17-18: 12. After clicking the number of the bus, the user can check the detailed interface of the bus, including the type, volume, state, bus dispatching time and other information of the bus dispatching list, the license plate number, the type, the volume, the state and the bus dispatching time.
It should be noted that, most orders may be constructed through the wave order construction rule in a normal case, but a small number of orders may not satisfy the wave order construction rule, or abnormal situations such as wrong arrangement of the wave order rule occur, and for these situations, the wave order construction may be temporarily completed through manual wave order construction. For example, clicking a "create wave" button in a car dispatch management page to perform wave creation, the wave state being "to be positioned".
The method provided by the embodiment breaks through the mode that one conventional dispatch list corresponds to one wave number, and achieves the purpose of generating one wave number for mixed production by using a mode that a WMS establishes a production wave number; through the multiple-time monthly platform building rule, the warehouse/monthly platform capable of providing goods picking service can be determined, so that the goods picking efficiency is improved.
Referring to fig. 2, a schematic flow chart of an alternative car dispatch list processing method according to an embodiment of the present invention is shown, including the following steps:
s201: receiving a plurality of vehicle dispatching orders, and acquiring the identification and the demand quantity of the articles in the orders based on the orders in the vehicle dispatching orders;
s202: counting the total quantity of the demand of the articles, positioning the bays with the inventory quantity being more than or equal to the total quantity of the demand according to the inventory quantity of the articles in each bay, and acquiring the platform in the idle state currently in the positioning bays;
s203: acquiring the total number of platforms corresponding to all articles, and combining the plurality of vehicle dispatching lists into one wave number if the total number is greater than or equal to a preset platform number threshold;
s204: determining storage positions in the positioning cabin, wherein the storage positions store the articles, and obtaining the inventory satisfaction rate of each storage position to the articles according to the inventory and the positioned quantity of the articles in each storage position and the total quantity of the demand;
s205: if a first storage position with the first stock satisfaction rate exists, taking the first storage position as a positioning storage position of the article;
s206: if the first storage position does not exist but a storage position with the stock satisfaction rate smaller than one exists, extracting a second storage position with the maximum stock satisfaction rate from all storage positions with the stock satisfaction rate smaller than one, and taking the second storage position as a positioning storage position of the article;
s207: if the first storage position and the second storage position do not exist, accumulating the available stock of the articles in each storage position step by step according to the sequence of the stock satisfaction rate from small to large;
s208: and taking a plurality of storage positions with the accumulated amount larger than or equal to the total amount required as positioning storage positions of the articles.
In the above embodiment, for steps S201 to S203, reference may be made to the description of steps S101 to S103 shown in fig. 1, and details are not repeated here.
In the above embodiment, in steps S204 to S208, after the inter-bin/platform is positioned and the wave number is generated, the wave number state is switched to "to be positioned". The same commodities in the wave times are produced together to be 'total production', and the production of a single object is 'non-total production'.
The lifting is always for the wave order, leaving the wave order is meaningless. And when the total quantity of the SKU demands summarized by the middle platform or the seeding area in the wave times is larger than the total threshold value of the SKU, the total positioning can be performed, otherwise, the positioning is performed according to a normal positioning strategy.
Taking the example of extracting 6 refrigerators, the positioning logic is as follows:
1. the number of the positioning bins is one
And determining the storage position of the refrigerator stored in the positioning bin according to the refrigerator identification (the refrigerator also has the classification of the type and the size). Suppose that 4 storage locations store a refrigerator, and the stock amounts are respectively:
TABLE 1 stock of refrigerators in storage locations
Storage position A B C D
Stock quantity 8 10 8 20
In practice, there may be some pre-emption in the stock (i.e. the amount of the order that the system is pre-empting when it enters the system, and the amount of the item is only used by the order after pre-emption, and is subsequently used for picking), so the available stock that can be actually provided is stock-located amount:
TABLE 2 actual available stock of refrigerators in storage locations
Storage position A B C D
Stock quantity 8 10 8 20
Positioned quantity (seeding zone) 2 5 0 0
Available inventory 6 5 8 20
In addition to the positioned quantity, the freezing quantity, the quantity to be moved in, the quantity to be moved out and the like can be stored, and the quantities are all quantities generated by artificial stock actions of a warehouse, and the positioned quantity is mainly considered; wherein the content of the first and second substances,
freezing amount: when the warehouse is abnormal, such as the warehouse position is abnormal, the goods state is in a problem, and the like, the warehouse needs to be frozen, and the warehouse is not positioned for use, so that the warehouse-out order is prevented from being occupied, and the like;
the amount to be moved: increasing the number to be moved in for a new recommended storage position to prevent the situation that the storage cannot be moved when other storage moved in the storage position occurs;
the amount to be removed: when the warehouse storage position is subjected to inventory movement, the system records the inventory through the quantity to be moved out, and the quantity is prevented from being occupied by the order.
According to the stock and the positioned quantity of each storage position to the refrigerator, and combining the total quantity of the demand, obtaining the stock satisfaction rate of each storage position to the refrigerator, namely (the demand quantity + the positioned quantity)/the total stock quantity:
TABLE 3 stock satisfaction rates of various storage locations to refrigerator
Storage position A B C D
Stock quantity 8 10 8 20
Positioned quantity (seeding zone) 2 5 0 0
Demand volume 6 6 6 6
Stock satisfaction rate 1 1.1 0.75 0.3
1) If the storage position with the stock satisfaction rate of 1 exists, the storage position is used as a positioning storage position (namely a goods picking storage position) for the refrigerator; such as bin a in table 3;
2) if there is no storage location with an inventory satisfaction rate of 1 but there is a storage location with an inventory satisfaction rate less than 1 (i.e., the inventory is greater than the demand), the storage location with the largest inventory satisfaction rate may be directly used as the positioning storage location of the refrigerator, for example, the storage location a in table 4:
TABLE 4 extract bin with inventory satisfaction less than 1 and maximum value
Storage position A B C D
Stock quantity 10 10 8 20
Positioned quantity (seeding zone) 2 5 0 0
Demand volume 6 6 6 6
Stock satisfaction rate 0.8 1.1 0.75 0.3
Although the stock quantity of the storage positions with the stock satisfaction rate less than 1 can meet the demand of the refrigerator, the extracted refrigerator quantity is only a part of the quantity in the storage, and the refrigerator with the possible residual quantity can not meet the subsequent mass order production after extraction.
In consideration of the situation, in order to empty one storage position as much as possible, the storage positions with the inventory satisfaction rate lower than the corresponding inventory positioning threshold value can be removed according to the inventory positioning threshold value of each storage position, and only the storage position with the largest inventory satisfaction rate is extracted from the rest storage positions to be used as the positioning storage position of the refrigerator. For example, 10 refrigerators exist in the storage position A, the stock positioning threshold is set to be 0.7, and when the demand is 8, positioning can be carried out in the storage position; and when the demand is 6, no positioning is allowed in this bin.
The stock positioning storage position can be a total positioning threshold (between 0 and 1) of a storage area where the storage position is located, positioning can be carried out when the quantity of required articles reaches a certain proportion of the stock, and the whole tray picking is carried out after positioning. The total pick threshold for all bins is defaulted to 0 for the new incremental segment (i.e., bin total is off).
Further, when the total positioning threshold setting of the storage area is larger than 0, the attribute of the mixed-placement objects in the plurality of storage positions in the storage area is modified to be 'not allowed', and the field can not be modified when the storage positions are edited. When the threshold is 0, the property is synchronously modified to "allow" and can be edited.
Specifically, as shown in table 5, at this time, neither the storage location a nor the storage location D with the inventory satisfaction rate less than 1 is available:
TABLE 5 stock satisfaction rate less than 1 bin
Storage position A B C D
Stock quantity 20 10 3 20
Positioned quantity (seeding zone) 2 5 0 0
Demand volume 6 6 6 6
Inventory location threshold 0.7 0.7 0.7 0.7
Stock satisfaction rate 0.4 1.1 2 0.3
3) And indicating that the available stock of the refrigerator in the storage position does not meet the actual demand quantity for the storage position with the stock satisfaction rate larger than 1. Therefore, when there is no bin having an inventory satisfaction rate less than 1 and no bin having an inventory satisfaction rate less than 1 (or less than the corresponding inventory location threshold), a location process needs to be determined from a plurality of bins having an inventory satisfaction rate greater than 1.
In addition to determining the positioning reserve, it is also necessary to determine the supply of each positioning reserve to the refrigerator, in particular:
the method comprises the following steps: determining a first third storage position in the sequence, and according to the available inventory of the articles in the third storage position, obtaining the residual demand total after the available inventory is removed from the demand total;
step two: determining a fourth storage position of the second sorting, and if the available stock of the articles in the fourth storage position is greater than or equal to the total amount of the residual demands, taking the third storage position and the fourth storage position as positioning storage positions of the articles; or
Step three: if the available inventory amount of the articles in the fourth storage position is less than the residual demand total amount, repeating the operation of determining the residual demand total amount and comparing the residual demand total amount with the available inventory amount until the accumulated available inventory amount is greater than or equal to the demand total amount, and taking the accumulated storage position as the positioning storage position of the articles.
Taking table 5 as an example, the stock satisfaction rate of bin B to the refrigerator is smaller than that of bin C, so the supply amount of bin B to the refrigerator is determined first, 10-5 to 5 are obtained by calculation, and since 5< 6 demand amounts, the accumulation is required. The supply amount of the second storage position C to the refrigerators is 3-0 to 3>1, so 1 refrigerator needs to be extracted from the storage position C, and finally the storage position B and the storage position C are determined to be the positioning storage positions of the refrigerators, and the supply amount is 5 and 1 respectively.
2. The number of the positioning bins is multiple
If one warehouse cannot meet the one-time picking requirement of the articles, the inventory is accumulated according to the sequence of the inventory of the articles from large to small among the warehouses according to the principle of emptying one warehouse at first, the accumulated value is compared with the total quantity of the requirement, the supply quantity of the articles among the warehouses is determined, and the calculation mode is similar to the mode 3), which is not repeated.
The subsequent positioning of the bin in each compartment is the same as that described in the above 1, and is not repeated here.
All the operations are directed to all the storage positions in each compartment, and the storage positions in the actual operation are divided into a total lifting storage position and a non-total lifting storage position; wherein, the total reserve position is for the wave times of batch production, and the non-total reserve position is for the wave times/orders with smaller demand; for example, only 1 refrigerator is required, and then the refrigerator is extracted from the non-extracted total storage location, otherwise, if the refrigerator is extracted from the extracted total storage location, the subsequent supply speed of the storage location may be affected, for example, the storage location has 10 refrigerators, and after 1 refrigerator is extracted, when the refrigerator is subsequently supplied (for example, 10 refrigerators are required), the refrigerator may be required to be supplied in combination with other storage locations.
And (4) generating a positioning result after positioning the reserve position, and marking the result as 'total' if the total positioning is carried out. After the storage location positioning is finished, the states of the dispatching list, the collection list and the wave number can be updated. See in particular the document status table shown in table 6:
TABLE 6 document status table
Figure BDA0002378194690000161
The method provided by the embodiment can be used for carrying out one-time total picking on the same articles in the same pass so as to reduce the reciprocating picking of the same articles in the same storage position and shorten the picking distance; meanwhile, the storage position of the goods can be determined with the maximum efficiency through the storage position positioning strategy, so that the goods picking efficiency is improved.
Referring to fig. 3, a schematic flow chart of another alternative car dispatch list processing method according to an embodiment of the present invention is shown, which includes the following steps:
s301: if the located storage position is a total storage position, determining the picking tasks corresponding to the storage position in the times so as to combine all the determined picking tasks into a task group;
s302: if the located storage position is a non-total storage position, determining a platform corresponding to the storage position and a seeding area corresponding to the determined platform, and counting the total number of the determined platform and the seeding area;
s303: judging whether the counted total number is greater than or equal to a preset number threshold value, and if so, combining the picking tasks corresponding to the storage positions in the times into a task group;
s304: otherwise, accumulating the counted total number and the counted total number of the rest storage positions, and determining the storage positions with the accumulated amount larger than or equal to the preset number threshold;
s305: and merging the picking tasks corresponding to the accumulated storage positions in the wave times into a task group.
In the above embodiment, in steps S301 to S305, the wavelength building switch is turned on, and the work is automatically dispatched after the storage location is positioned, the successfully positioned storage location directly generates the picking task, and the goods replenishment task to be replenished is executed and then the picking task is generated.
The storage positions are divided into total lifting storage positions and non-total lifting storage positions, and the ways of creating task groups by different types of storage positions are different:
1) and (4) carrying out a total storage task group: and (3) generating a picking task group according to the storage positions, wherein 1 storage position generates 1 task group, and the task group comprises all picking tasks corresponding to the storage position in the current order.
TABLE 7 task groups for hoisting total reserve bits
Figure BDA0002378194690000171
For the total memory bit A and the memory bit B, corresponding task groups are respectively generated, namely DW 1 (total), DW2 (total), DW3 (total), namely task groups T1, DW4 (total), DW5 (total), namely task group T2.
In addition, in the picking process, if the total picking task group released exists in the total picking storage position where the picking task is located, the new task group is merged into the task group of the total picking storage position for updating. For example, if the general storage location a has a task group T1, 10 pieces in stock, and 7 picking tasks are assigned, and a new picking task 2 is located at the storage location, then the 2 picking tasks are added to the task group T1.
2) Non-lifting total storage task group: a task group is formed according to the maximum number of the platforms of the task engine and the seeding area corresponding to the platforms.
TABLE 8 task groups of non-lifting total reserve bits
Figure BDA0002378194690000181
For the storage position E, as the total number of the platforms and the seeding areas corresponding to the storage position E is 3, the picking task corresponding to the storage position E is generated into a task group, and DW8 (not total) is obtained, namely the task group T4; for the non-total storage positions C and D, since the total number of the platforms and the seeding areas corresponding to the non-total storage positions C and D is less than 3, task merging is required, namely DW6 (non-total), DW7 (non-total) -task group T3 is obtained.
The specific operation is as follows:
judging whether the counted total number is greater than or equal to a preset number threshold value, and if so, combining the picking tasks corresponding to the storage positions in the current time into a task group;
otherwise, the total number counted and the total number counted by the rest storage positions are accumulated, the storage positions with the accumulated amount larger than or equal to the preset number threshold value are determined, and the picking tasks corresponding to the accumulated storage positions in the current time are combined into one task group.
The method provided by the embodiment combines the goods picking tasks corresponding to the storage positions into different task groups according to different types of the storage positions, so that a subsequent worker can pick goods at the storage positions at one time, the repeated picking times of the same goods at the same storage position are reduced, the operation distance is shortened, and the goods picking efficiency is improved.
Referring to fig. 4, a schematic flow chart of another alternative car dispatch list processing method according to the embodiment of the present invention is shown, which includes the following steps:
s401: distributing task groups to corresponding storage positions to trigger the storage positions to perform order picking operation according to order picking tasks in the task groups, and combining picked items to obtain order picking sets;
s402: determining a number of platforms corresponding to the task group;
s403: if the number is one, transmitting the pick slip to the determined dock;
s404: if the quantity is more than one, transmitting the picking collection to a position to be sowed, and generating a sowing task for the picking collection;
s405: sequencing the determined platforms according to the platform numbers, determining first articles corresponding to a first platform which is sequenced first, extracting the first articles from the picking collection and sowing the first articles into the first platform; wherein, seeding is the process of picking up goods to the platform;
s406: acquiring the remaining order picking sets after the first items are removed from the order picking sets;
s407: extracting and seeding a second item from the remaining pickups into a second february station based on the second item corresponding to the second february station that is ranked second;
s408: and repeating the operation until the objects in the picking collection are sown.
The terms involved are to be interpreted as follows:
seeding area Area where multiple platform commodities are temporarily placed after being picked out simultaneously
Seeding Process for sowing commodity in sowing area to destination platform
Disc returning area After seeding is finished, if the commodities are left, the residual commodities are temporarily placed in the area
Return disc Process for goods from shelf to picking position and storage position on disk returning area
In the above embodiment, in step S401, after the task group for each bin is generated, the task group is distributed to each bin. Each storage position carries out the picking operation according to the identification and the demand of the goods in the picking task, for example, the storage position A picks 6 pieces of the refrigerator.
Since a plurality of articles may be picked from the same storage location, after the picking from the storage location is completed, the picked articles are combined into a picking set, i.e., storage location a-picking set 1. For a task group of non-lift bins, it may be that multiple non-lift bins correspond to a pick, such as bin C and bin D-pick 2.
In addition, for the task group of the total storage position lifting, when the picking task is received, the current picking task group is prompted to lift the total picking for the whole tray. After the task is picked up, all the stock in the storage position is unavailable and can not be positioned any more. Further, when the same item in the picking task group corresponds to a plurality of picking tasks, the picking tasks need to be combined.
The picking task can be operated to pick the goods out of stock, if the quantity of the goods out of stock is less than the quantity of the goods required to be picked out of stock, only the isolation moving sheet is generated, if the quantity of the goods out of stock is more than the quantity of the goods required to be picked out of stock, namely, the order is produced out of stock, the isolation moving sheet is generated, the goods out of stock in the order are sold, the relocation process is executed, and the relocated picking task is not added to the current picker. The order picking and shortage of the non-picking total order picking task is consistent with the existing process.
For steps S402-S404, when the number of the platforms of the picking task group is only 1, the picking collection obtained from the storage position is flowed to the platform; when a plurality of destination platforms exist, the destination platforms need to be converged to the positions to be sowed, and sowing tasks are generated after the confluence is finished.
The interface displays the platform information under each task group, and the operator selects the position to be seeded. If the position to be sowed has no vacancy, the operation line is processed, a quick jump button is added on the confluence interface of the position to be sowed, and the operation line can jump to the sowing interface of the task group directly for sowing.
For steps S405-S408, the platform picks up the seeding tasks through the seeding sites. For the execution of the seeding task, specifically, the destination platform is presented in the order of the platform numbers, all the items under the platform can be displayed after the platform numbers are scanned, and then the items are scanned piece by piece for seeding, for example, platform 1-item 1.
In addition, the positions to be sown can be clicked to preview all sowing tasks, a certain platform can be directly selected, and the corresponding platform sowing interface is jumped to for article sowing.
After the sowing is finished, the situation that the residual articles exist may be found, the residual articles need to be returned, the scanning of the position to be returned is prompted, and the returning of the position to be returned/the picking position/the storage position are supported.
Furthermore, the disk returning storage position does not support the library moving, the processing needs to be carried out through the disk returning and shelving function, a disk returning and shelving task is generated when the disk returning storage position to be scanned is scanned, and the storage position cannot be located any more after the shelving task is generated. And calling a volume shelving strategy of the same-item picking position.
In addition, in the seeding process, the conditions of shortage and loss of goods can occur, and the abnormal condition can be submitted through the shortage registration. After the exception is submitted:
1) automatically triggering the relocation of the corresponding platform with the lack of goods, locating the current platform of the platform position, and not seeding any more when the task priority is highest;
2) generating an isolation moving bill, wherein the isolation commodities are the detailed goods of the out-of-stock commodities;
3) and (5) performing rechecking on the failed relocation starting triggering exception list, and processing the exception list with the conventional flow.
And subsequently, rechecking according to the platform, and judging whether the associated collection list on the platform is in a state of waiting for replenishment or not, wherein if the collection list is not in the state of waiting for replenishment, the rechecking cannot be performed.
In the method provided by the embodiment, after the task group is generated according to the positioning storage position, the task group is distributed to the corresponding storage position to perform order picking processing, and seeding operation is added according to the order picking task containing a plurality of platform requirements, so that the corresponding commodities are placed on the corresponding platforms through seeding operation, and the order picking efficiency is improved.
Referring to fig. 5, a schematic block diagram of a dispatch list processing apparatus 500 according to an embodiment of the present invention is shown, including:
a vehicle dispatching order receiving module 501, configured to receive multiple vehicle dispatching orders, and obtain identifiers and demand amounts of items in the orders based on the orders in the vehicle dispatching orders;
the inter-warehouse positioning module 502 is configured to count the total quantity of the demand of the articles, position an inter-warehouse of which the stock quantity is greater than or equal to the total quantity of the demand according to the stock quantity of the articles in each inter-warehouse, and obtain a platform in an idle state currently in the positioning inter-warehouse;
and the wave order group modeling block 503 is configured to obtain the total number of platforms corresponding to all the articles, and combine the multiple car delivery orders into one wave order if the total number is greater than or equal to a predetermined platform number threshold.
In the device for implementing the present invention, the inter-bin positioning module 502 is further configured to:
if the storage quantity is not larger than or equal to the warehouse of the total demand quantity, accumulating the storage quantity according to the sequence from large to small;
and if the accumulated amount is larger than or equal to the total amount required, taking the plurality of bins corresponding to the accumulated amount as the positioning bins of the article.
The apparatus further includes a storage location module 504 (not shown) for:
determining storage positions in the positioning cabin, wherein the storage positions store the articles, and obtaining the inventory satisfaction rate of each storage position to the articles according to the inventory and the positioned quantity of the articles in each storage position and the total quantity of the demand;
if a first storage position with the first stock satisfaction rate exists, taking the first storage position as a positioning storage position of the article; or
If the first storage position does not exist but a storage position with the stock satisfaction rate smaller than one exists, extracting a second storage position with the maximum stock satisfaction rate from all storage positions with the stock satisfaction rate smaller than one, and taking the second storage position as a positioning storage position of the article; or
And if the first storage position and the second storage position do not exist, gradually accumulating the available stock of the articles in each storage position according to the sequence from small stock satisfaction rate to large stock satisfaction rate, and taking a plurality of storage positions with the accumulated amount larger than or equal to the required total amount as the positioning storage positions of the articles.
In the implementation apparatus of the present invention, the storage location positioning module 504 is further configured to:
if the quantity of the warehouse where the articles are positioned is multiple, determining a first warehouse which is ranked according to the sequence of the stock quantity of the articles in each warehouse from large to small, and taking the first warehouse as the supply quantity of the articles in the first warehouse;
obtaining the residual demand total amount of the demand total amount after the first stock amount is removed, judging whether the second stock amount is larger than or equal to the residual demand total amount according to a second sorted stock amount, and if so, taking the residual demand total amount as the supply amount of the goods between second bins;
otherwise, repeating the operation until the supply amount of the articles among the bins is determined.
In the implementation device of the invention, the storage positions comprise a total lifting storage position and a non-total lifting storage position; wherein, the total storage position is a storage position capable of supplying articles in batches;
the device for implementing the present invention further includes a task combination module 505 (not shown in the figure) for:
if the located storage position is a total storage position, determining the picking tasks corresponding to the storage position in the times so as to combine all the determined picking tasks into a task group; or
If the located storage position is a non-total storage position, determining a platform corresponding to the storage position and a seeding area corresponding to the determined platform, and counting the total number of the determined platform and the seeding area;
judging whether the counted total number is greater than or equal to a preset number threshold value, and if so, combining the picking tasks corresponding to the storage positions in the times into a task group;
otherwise, accumulating the total number counted and the total number counted by the rest storage positions, determining the storage positions with the accumulated amount larger than or equal to the preset number threshold value, and combining the picking tasks corresponding to the accumulated storage positions in the times into a task group.
The apparatus further comprises a pick generation module 506 (not shown) for:
distributing task groups to corresponding storage positions to trigger the storage positions to perform order picking operation according to order picking tasks in the task groups, and combining picked items to obtain order picking sets;
determining the number of platforms corresponding to the task group, and if the number is one, transmitting the picking set to the determined platform; or
And if the quantity is more than one, transmitting the picking collection to a position to be sowed, and generating a sowing task for the picking collection.
The apparatus further comprises an article sowing module 507 (not shown) for:
sequencing the determined platforms according to the platform numbers, determining first articles corresponding to a first platform which is sequenced first, extracting the first articles from the picking collection and sowing the first articles into the first platform; wherein, seeding is the process of picking up goods to the platform;
acquiring a remaining picking set of the picking set after the first item is removed, and extracting a second item from the remaining picking set and sowing the second item into a second platform based on the second item corresponding to the second platform which is sorted;
and repeating the operation until the objects in the picking collection are sown.
In addition, the detailed implementation of the device in the embodiment of the present invention has been described in detail in the above method, so that the repeated description is not repeated here.
FIG. 6 illustrates an exemplary system architecture 600 to which embodiments of the invention may be applied.
As shown in fig. 6, the system architecture 600 may include terminal devices 601, 602, 603, a network 604, and a server 605 (by way of example only). The network 604 serves to provide a medium for communication links between the terminal devices 601, 602, 603 and the server 605. Network 604 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 601, 602, 603 to interact with the server 605 via the network 604 to receive or send messages or the like. Various communication client applications can be installed on the terminal devices 601, 602, 603.
The terminal devices 601, 602, 603 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 605 may be a server providing various services, such as a background management server (for example only) providing support for shopping websites browsed by users using the terminal devices 601, 602, 603.
It should be noted that the method provided by the embodiment of the present invention is generally executed by the server 605, and accordingly, the apparatus is generally disposed in the server 605.
It should be understood that the number of terminal devices, networks, and servers in fig. 6 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 7, shown is a block diagram of a computer system 700 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 7 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 7, the computer system 700 includes a Central Processing Unit (CPU)701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data necessary for the operation of the system 700 are also stored. The CPU 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. A drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, 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 such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 701.
It should be noted that the computer readable medium shown in the present invention can 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 the present invention, 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 the present invention, 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: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
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 invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams 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 modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor comprises a dispatching order receiving module, a cabin positioning module and a wave time building module. Where the names of these modules do not in some way constitute a limitation on the modules themselves, for example, an inter-bay positioning module may also be described as a "module that positions bays and platforms".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise:
receiving a plurality of vehicle dispatching orders, and acquiring the identification and the demand quantity of the articles in the orders based on the orders in the vehicle dispatching orders;
counting the total quantity of the demand of the articles, positioning the bays with the inventory quantity being more than or equal to the total quantity of the demand according to the inventory quantity of the articles in each bay, and acquiring the platform in the idle state currently in the positioning bays; wherein, the platform is an area for storing articles in the compartment;
and acquiring the total number of the platforms corresponding to all the articles, and combining the plurality of vehicle dispatching lists into one wave number if the total number is greater than or equal to a preset platform number threshold.
Compared with the prior art, the technical scheme of the embodiment of the invention has the following beneficial effects:
1) the mode that an existing car dispatching order corresponds to one wave number is broken through, and the purpose that a plurality of car dispatching orders are generated into one wave number to be mixed and produced is achieved through the mode that the WMS establishes the production wave number;
2) through the multiple-wave-number building rule of the platforms, the warehouse/platform capable of providing goods picking service can be determined, so that the goods picking efficiency is improved;
3) the same articles in the same cycle are picked in one time, so that the back-and-forth picking of the same articles in the same storage position is reduced, and the picking distance is shortened;
4) the storage position of the goods with the maximum efficiency can be determined through a storage position positioning strategy, so that the storage position positioning efficiency is improved;
5) according to different storage position types, the picking tasks corresponding to the storage positions are combined into different task groups, so that a subsequent worker can pick the goods at the storage positions at one time, and the repeated picking times of the same article at the same storage position are reduced;
6) seeding operation is added for the picking task containing a plurality of platform demands, so that corresponding commodities are placed on corresponding platforms through seeding operation, and the picking efficiency is improved.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (10)

1. A method for processing a car dispatch list is characterized by comprising the following steps:
receiving a plurality of vehicle dispatching orders, and acquiring the identification and the demand quantity of the articles in the orders based on the orders in the vehicle dispatching orders;
counting the total quantity of the demand of the articles, positioning the bays with the inventory quantity being more than or equal to the total quantity of the demand according to the inventory quantity of the articles in each bay, and acquiring the platform in the idle state currently in the positioning bays;
and acquiring the total number of the platforms corresponding to all the articles, and combining the plurality of vehicle dispatching lists into one wave number if the total number is greater than or equal to a preset platform number threshold.
2. The method of claim 1, wherein the locating an inventory amount greater than or equal to the required total amount of bays, further comprises:
if the storage quantity is not larger than or equal to the warehouse of the total demand quantity, accumulating the storage quantity according to the sequence from large to small;
and if the accumulated amount is larger than or equal to the total amount required, taking the plurality of bins corresponding to the accumulated amount as the positioning bins of the article.
3. The method of claim 1, further comprising, after combining the plurality of car orders into one wave:
determining storage positions in the positioning cabin, wherein the storage positions store the articles, and obtaining the inventory satisfaction rate of each storage position to the articles according to the inventory and the positioned quantity of the articles in each storage position and the total quantity of the demand;
if a first storage position with the first stock satisfaction rate exists, taking the first storage position as a positioning storage position of the article; or
If the first storage position does not exist but a storage position with the stock satisfaction rate smaller than one exists, extracting a second storage position with the maximum stock satisfaction rate from all storage positions with the stock satisfaction rate smaller than one, and taking the second storage position as a positioning storage position of the article; or
And if the first storage position and the second storage position do not exist, gradually accumulating the available stock of the articles in each storage position according to the sequence from small stock satisfaction rate to large stock satisfaction rate, and taking a plurality of storage positions with the accumulated amount larger than or equal to the required total amount as the positioning storage positions of the articles.
4. The method according to claim 2 or 3, wherein prior to determining the bin in which the item is stored in the localized compartment, further comprising:
if the quantity of the warehouse where the articles are positioned is multiple, determining a first warehouse which is ranked according to the sequence of the stock quantity of the articles in each warehouse from large to small, and taking the first warehouse as the supply quantity of the articles in the first warehouse;
obtaining the residual demand total amount of the demand total amount after the first stock amount is removed, judging whether the second stock amount is larger than or equal to the residual demand total amount according to a second sorted stock amount, and if so, taking the residual demand total amount as the supply amount of the goods between second bins;
otherwise, repeating the operation until the supply amount of the articles among the bins is determined.
5. The method of claim 3, wherein the bins comprise a total bin and a non-total bin; wherein, the total storage position is a storage position capable of supplying articles in batches;
the method further comprises the following steps:
if the located storage position is a total storage position, determining the picking tasks corresponding to the storage position in the times so as to combine all the determined picking tasks into a task group; or
If the located storage position is a non-total storage position, determining a platform corresponding to the storage position and a seeding area corresponding to the determined platform, and counting the total number of the determined platform and the seeding area;
judging whether the counted total number is greater than or equal to a preset number threshold value, and if so, combining the picking tasks corresponding to the storage positions in the times into a task group;
otherwise, accumulating the total number counted and the total number counted by the rest storage positions, determining the storage positions with the accumulated amount larger than or equal to the preset number threshold value, and combining the picking tasks corresponding to the accumulated storage positions in the times into a task group.
6. The method of claim 5, further comprising:
distributing task groups to corresponding storage positions to trigger the storage positions to perform order picking operation according to order picking tasks in the task groups, and combining picked items to obtain order picking sets;
determining the number of platforms corresponding to the task group, and if the number is one, transmitting the picking set to the determined platform; or
And if the quantity is more than one, transmitting the picking collection to a position to be sowed, and generating a sowing task for the picking collection.
7. The method of claim 6, further comprising, after generating the seeding tasks for the pickets:
sequencing the determined platforms according to the platform numbers, determining first articles corresponding to a first platform which is sequenced first, extracting the first articles from the picking collection and sowing the first articles into the first platform; wherein, seeding is the process of picking up goods to the platform;
acquiring a remaining picking set of the picking set after the first item is removed, and extracting a second item from the remaining picking set and sowing the second item into a second platform based on the second item corresponding to the second platform which is sorted;
and repeating the operation until the objects in the picking collection are sown.
8. A car dispatch list processing apparatus, comprising:
the vehicle dispatching order receiving module is used for receiving a plurality of vehicle dispatching orders and acquiring the identification and the demand quantity of the items in the orders based on the orders in the vehicle dispatching orders;
the inter-bin positioning module is used for counting the total quantity of the required articles, positioning the inter-bin with the stock quantity greater than or equal to the total quantity of the required articles according to the stock quantity of the articles in each inter-bin, and acquiring the platform in an idle state currently in the positioning inter-bin;
and the wave number establishing module is used for acquiring the total number of the platforms corresponding to all the articles, and combining the plurality of vehicle dispatching lists into one wave number if the total number is greater than or equal to a preset platform number threshold.
9. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-7.
CN202010074727.XA 2020-01-22 2020-01-22 Method and device for processing dispatch list Active CN113159467B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010074727.XA CN113159467B (en) 2020-01-22 2020-01-22 Method and device for processing dispatch list

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010074727.XA CN113159467B (en) 2020-01-22 2020-01-22 Method and device for processing dispatch list

Publications (2)

Publication Number Publication Date
CN113159467A true CN113159467A (en) 2021-07-23
CN113159467B CN113159467B (en) 2023-12-08

Family

ID=76881647

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010074727.XA Active CN113159467B (en) 2020-01-22 2020-01-22 Method and device for processing dispatch list

Country Status (1)

Country Link
CN (1) CN113159467B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113592282A (en) * 2021-07-26 2021-11-02 北京沃东天骏信息技术有限公司 Article distribution method and device
CN114154894A (en) * 2021-12-09 2022-03-08 浙江凯乐士科技集团股份有限公司 Task processing method and device, electronic equipment and computer readable storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH07192068A (en) * 1993-12-27 1995-07-28 Nec Corp Ordering method deciding system in inventory management system
JP2005206281A (en) * 2004-01-20 2005-08-04 Hitachi Ltd Order integration control system, order integration control method, and order integration control program
CN104835022A (en) * 2015-03-24 2015-08-12 浙江中烟工业有限责任公司 Logistics center dump intelligent decision control system based on RFID and batch flow technologies and method
CN110197353A (en) * 2019-04-25 2019-09-03 德邦物流股份有限公司 A kind of processing method and system for order of delivering
CN110348770A (en) * 2018-04-02 2019-10-18 北京京东尚科信息技术有限公司 A kind of storage management method and device
CN110363396A (en) * 2019-06-24 2019-10-22 深圳市恒路物流股份有限公司 Logistic resources configuration method and device

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH07192068A (en) * 1993-12-27 1995-07-28 Nec Corp Ordering method deciding system in inventory management system
JP2005206281A (en) * 2004-01-20 2005-08-04 Hitachi Ltd Order integration control system, order integration control method, and order integration control program
CN104835022A (en) * 2015-03-24 2015-08-12 浙江中烟工业有限责任公司 Logistics center dump intelligent decision control system based on RFID and batch flow technologies and method
CN110348770A (en) * 2018-04-02 2019-10-18 北京京东尚科信息技术有限公司 A kind of storage management method and device
CN110197353A (en) * 2019-04-25 2019-09-03 德邦物流股份有限公司 A kind of processing method and system for order of delivering
CN110363396A (en) * 2019-06-24 2019-10-22 深圳市恒路物流股份有限公司 Logistic resources configuration method and device

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
EMIR ZUNIC ET AL.: "Design of optimization system for warehouse order picking in real environment", 《2017 XXVI INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATION AND AUTOMATION TECHNOLOGIES》 *
李建斌;孙哲;陈威帆;李文秀;: "面向最小化拆单率的基于订单分配顺序的库存优化研究", 工业工程与管理, no. 06 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113592282A (en) * 2021-07-26 2021-11-02 北京沃东天骏信息技术有限公司 Article distribution method and device
CN114154894A (en) * 2021-12-09 2022-03-08 浙江凯乐士科技集团股份有限公司 Task processing method and device, electronic equipment and computer readable storage medium
CN114154894B (en) * 2021-12-09 2023-06-30 浙江凯乐士科技集团股份有限公司 Task processing method, device, electronic equipment and computer readable storage medium

Also Published As

Publication number Publication date
CN113159467B (en) 2023-12-08

Similar Documents

Publication Publication Date Title
CN109772714B (en) Goods sorting method and device, storage medium and electronic equipment
CN106875148B (en) Method and device for determining a storage position for an item
CN111415122B (en) Goods picking method and goods picking system
CN111091328B (en) Warehouse entry management method and management device
CN106960301B (en) Medicine e-commerce mirror image sorting method and system
CN109961247B (en) Method and device for generating article storage information
CN108681845B (en) Intelligent logistics order dispatching management system based on big data
CN109840729B (en) Method and system for positioning bin, storage medium and electronic equipment
CN110182530B (en) Warehouse management method and device
CN111507651A (en) Order data processing method and device applied to man-machine mixed warehouse
CN110390498A (en) Order allocation method and device
CN111985862A (en) Method and apparatus for locating inventory items
CN109993470B (en) Inventory scheduling method and device
CN113159467A (en) Vehicle dispatching order processing method and device
CN110889656A (en) Warehouse rule configuration method and device
CN110766349A (en) Tallying method and device
CN111260240A (en) Task allocation method and device
CN110689293B (en) Article delivery processing method and device
CN111832980A (en) Method and device for allocating storage positions of multi-layer warehouse
CN113650997A (en) Method and device for positioning articles in warehouse-out process
CN112966992A (en) Order production method and device
CN112520284A (en) Shelf storage position adjusting method and system
CN112734316A (en) Inventory arrangement method and device
CN111768133A (en) Method and device for warehousing articles
CN115375243A (en) Order distribution method and 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
GR01 Patent grant
GR01 Patent grant