[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN115456512A - Automatic order dispatching method and related equipment - Google Patents

Automatic order dispatching method and related equipment Download PDF

Info

Publication number
CN115456512A
CN115456512A CN202211013304.2A CN202211013304A CN115456512A CN 115456512 A CN115456512 A CN 115456512A CN 202211013304 A CN202211013304 A CN 202211013304A CN 115456512 A CN115456512 A CN 115456512A
Authority
CN
China
Prior art keywords
dispatching
target
order
scheme
freight
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202211013304.2A
Other languages
Chinese (zh)
Inventor
何依
陶杨懿
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Shanshu Network Technology Co ltd
Shanshu Science And Technology Suzhou Co ltd
Shanshu Science And Technology Beijing Co ltd
Shenzhen Shanzhi Technology Co Ltd
Original Assignee
Shanghai Shanshu Network Technology Co ltd
Shanshu Science And Technology Suzhou Co ltd
Shanshu Science And Technology Beijing Co ltd
Shenzhen Shanzhi 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 Shanghai Shanshu Network Technology Co ltd, Shanshu Science And Technology Suzhou Co ltd, Shanshu Science And Technology Beijing Co ltd, Shenzhen Shanzhi Technology Co Ltd filed Critical Shanghai Shanshu Network Technology Co ltd
Priority to CN202211013304.2A priority Critical patent/CN115456512A/en
Publication of CN115456512A publication Critical patent/CN115456512A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/18Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression 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/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
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Data Mining & Analysis (AREA)
  • Operations Research (AREA)
  • Computational Mathematics (AREA)
  • Marketing (AREA)
  • Quality & Reliability (AREA)
  • General Business, Economics & Management (AREA)
  • Mathematical Physics (AREA)
  • Development Economics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Analysis (AREA)
  • Tourism & Hospitality (AREA)
  • Evolutionary Biology (AREA)
  • Game Theory and Decision Science (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Algebra (AREA)
  • Educational Administration (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses an automatic order dispatching method and related equipment. The method comprises the following steps: acquiring all pre-dispatching orders which can meet the production time based on the target order quantity of the target order and the capacity state of each factory; acquiring the freight cost corresponding to each pre-dispatching order scheme through the pre-dispatching order schemes; determining a pre-dispatching scheme with the lowest freight cost as a target dispatching scheme; and dispatching orders to the corresponding target factories based on the target dispatching scheme. The automatic order dispatching method comprises the steps of obtaining all order dispatching schemes capable of meeting the goods delivery time of customers based on the order quantity required by target orders of the customers and the capacity state of each factory, calculating the freight cost corresponding to each order dispatching scheme, selecting the order dispatching scheme with the lowest freight cost as the target, and calculating in two stages to obtain the target order dispatching scheme which can meet the requirements of the customers on the time of the customers and can also ensure that the freight cost is the lowest to save the cost of companies, so that the calculation force can be saved, and the target order dispatching scheme can be quickly obtained.

Description

Automatic order dispatching method and related equipment
Technical Field
The present disclosure relates to the field of order distribution, and more particularly, to an automatic order dispatching method and related devices.
Background
A large enterprise may set multiple factories in multiple areas to meet the order requirements of customers in different areas, but when a certain order quantity is large or a large number of orders are placed, one factory cannot complete a production task independently, and orders need to be sent to each factory according to the orders. The prior dispatching method is that a planner manually distributes the existing customer orders to the subordinate factories according to historical experience. However, the demands of capacity, customer demand, and freight cost of each plant cannot be considered in all aspects during the distribution process. The production cost of enterprises is increased, the production period is prolonged, and the experience of customers is influenced.
Disclosure of Invention
A series of concepts in a simplified form are introduced in the summary section, which is described in further detail in the detailed description section. This summary of the invention is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.
In order to provide a convenient and fast order allocation method, the invention provides an automatic order dispatching method in a first aspect, wherein the method comprises the following steps:
acquiring all pre-dispatching orders which can meet the production time based on the target order quantity of the target order and the capacity state of each factory;
acquiring the freight cost corresponding to each pre-dispatching single scheme through the pre-dispatching single schemes;
determining the pre-dispatching scheme with the lowest freight cost as a target dispatching scheme;
and dispatching orders to the corresponding target factories based on the target dispatching scheme.
Optionally, the obtaining of the freight cost corresponding to each pre-dispatching unit scheme through the pre-dispatching unit scheme includes:
acquiring a sectional freight price between a pre-dispatching single factory location and an order delivery location corresponding to a pre-dispatching single scheme;
and calculating the freight cost based on the sectional freight price and the target ordered amount when the target ordered amount is less than or equal to the preset ordered amount.
Optionally, the method further includes:
determining a weighted average unit price according to the section freight price when the target order quantity is larger than the preset order quantity, wherein the weighted average unit price is obtained based on the section weight and the section unit price in each section interval;
and calculating the freight cost based on the weighted average unit price and the target ordering amount.
Optionally, the determining the weighted average unit price according to the section freight price includes:
the above weight average unit price p is calculated by the following formula:
Figure BDA0003811459130000021
in the formula, p1 to p n Respectively the unit price m of the segment in the segment interval from the first segment to the nth segment 1 To m n The segment weights in the segment intervals from the first segment to the nth segment are respectively.
Optionally, the capacity status includes a production capacity status and a package capacity status,
the obtaining of all pre-dispatching orders meeting the production time based on the target order quantity and the capacity status of the plurality of factories comprises:
and acquiring all the pre-dispatching orders meeting the production time based on the target order quantity of the target order and the production capacity states and the packaging capacity states of the plurality of factories.
Optionally, the method further includes:
under the condition that the target order quantity exceeds the total residual capacity of all factories, acquiring the single-day rated capacity of each factory;
and distributing the exceeding order quantity to each factory based on the single-day rated capacity and the same overproduction coefficient.
Optionally, the method further includes:
under the condition that a plurality of pre-dispatching schemes with the lowest freight cost exist, obtaining customer self-service cost, wherein the customer self-service cost is determined based on customer self-service volume, and the customer self-service volume refers to a cargo volume which does not meet the requirement of corresponding finished vehicle shipment volume;
and determining the pre-dispatching scheme with lower self-proposal cost as the target dispatching scheme.
In a second aspect, the present invention further provides an automatic order dispatching device, including:
the system comprises a first acquisition unit, a second acquisition unit and a control unit, wherein the first acquisition unit is used for acquiring all pre-dispatching orders capable of meeting production time based on the target order quantity of a target order and the capacity state of each factory;
the second obtaining unit is used for obtaining the freight cost corresponding to each pre-dispatching single scheme through the pre-dispatching single scheme;
the determining unit is used for determining the pre-dispatching scheme with the lowest freight cost as a target dispatching scheme;
and the dispatching unit is used for dispatching the order to the corresponding target factory based on the target dispatching scheme.
In a third aspect, an electronic device comprises: a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor is configured to implement the steps of the automatic dispatch method according to any one of the first aspect when the computer program stored in the memory is executed.
In a fourth aspect, the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the automatic dispatch method of any one of the above aspects of the first aspect.
To sum up, the automatic order dispatching method of the embodiment of the application comprises the following steps: acquiring all pre-dispatching orders which can meet the production time based on the target order quantity of the target order and the capacity state of each factory; acquiring the freight cost corresponding to each pre-dispatching single scheme through the pre-dispatching single schemes; determining the pre-dispatching scheme with the lowest freight cost as a target dispatching scheme; and dispatching orders to the corresponding target factories based on the target dispatching scheme. In summary, the automatic order dispatching method provided by the embodiment of the application obtains all pre-dispatching orders capable of meeting the freight time of customers based on the order quantity required by the target orders of the customers and the capacity state of each factory, calculates the freight cost corresponding to each pre-dispatching order, selects the target dispatching order with the lowest freight cost, and dispatches the orders to the corresponding target factories according to the target dispatching order. According to the method, through two-stage calculation, the obtained target order sending scheme can meet the requirement of a client on user time, the lowest freight cost can be guaranteed, the company cost can be saved, the calculation power can be saved, and the target order sending scheme can be quickly obtained through the scheme of two-stage calculation.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the specification. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
fig. 1 is a schematic flow chart of an automatic dispatch method according to an embodiment of the present disclosure;
fig. 2 is a schematic structural view of an automatic order dispatching device according to an embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of an automatic dispatch list electronic device according to an embodiment of the present application.
Detailed Description
To sum up, the automatic order dispatching method provided in the embodiment of the present application obtains all pre-dispatching order cases that can satisfy the time of customers for goods based on the order quantity required by the target orders of the customers and the capacity status of each factory, calculates the freight cost corresponding to each pre-dispatching order case, selects the target order case with the lowest freight cost, and dispatches the orders to the corresponding target factory according to the target order case. According to the method, through two-stage calculation, the obtained target order sending scheme can meet the requirement of a client on user time, the lowest freight cost can be guaranteed, the company cost can be saved, the calculation power can be saved, and the target order sending scheme can be quickly obtained through the scheme of two-stage calculation.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims of the present application and in the drawings described above, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced otherwise than as specifically illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus. The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments.
Referring to fig. 1, a schematic flow chart of an automatic dispatch method provided in an embodiment of the present application may specifically include:
s110, acquiring all pre-dispatching orders meeting the production time based on the target order quantity of the target order and the capacity state of each factory; .
For example, the capacity status of each factory, that is, how many products can be produced by each factory within the order time at present, is obtained, and all possible pre-dispatch cases are automatically calculated according to the target order quantity and the capacity status of each factory. For example: the company has 3 plants distributed in different cities, a customer orders 100 tons, the remaining capacity of the plant A is 50 tons, the remaining capacity of the plant B is 40 tons, the remaining capacity of the plant C is 30 tons, the total remaining capacity of the company is 120 tons, the requirement of the customer ordering 100 tons can be met, and various dispatching schemes for meeting the production time are provided, for example: the factory a is 30 tons, the factory B is 40 tons, the factory C is 30 tons, or various pre-assigned cases such as the factory a is 40 tons, the factory B is 30 tons, and the factory C is 30 tons.
S120, acquiring the freight cost corresponding to each pre-assigned scheme through the pre-assigned schemes;
for example, different factories are distributed in different cities or areas, the distance between the factory and the ordering place is different, and the freight cost corresponding to various pre-allocation single schemes is calculated according to the freight price of the factory and the pre-allocation single schemes.
S130, determining the pre-dispatching scheme with the lowest freight cost as a target dispatching scheme;
for example, according to the freight costs corresponding to the various pre-dispatching schemes calculated in step S120, the dispatching scheme with the lowest freight cost total cost is screened out as the best dispatching scheme, i.e., the target dispatching scheme. The method comprises the steps of determining a delivery scheme according to a target order, screening the delivery scheme which does not meet the production time according to the target order quantity and the capacity state, ensuring the goods utilization time of a client, calculating the freight cost corresponding to various pre-delivery schemes after primary screening, selecting the pre-delivery scheme with the lowest freight cost as the target delivery scheme, wherein the obtained target delivery scheme can meet the requirement of the client on the user time and can also ensure that the freight cost is the lowest to save the company cost, and the scheme of calculation in two stages can save the calculation power and obtain the target delivery scheme quickly.
And S140, dispatching orders to the corresponding target factories based on the target dispatching scheme.
Illustratively, the order is dispatched to the corresponding target factory through the internal system of the company based on the target dispatching scheme, the production progress of each factory is known, the capacity state of each factory is coordinated, and the ordering requirement of the clients of the head office is met.
To sum up, the automatic order dispatching method provided in the embodiment of the present application obtains all pre-dispatching order cases that can satisfy the time of customers for goods based on the order quantity required by the target orders of the customers and the capacity status of each factory, calculates the freight cost corresponding to each pre-dispatching order case, selects the target order case with the lowest freight cost, and dispatches the orders to the corresponding target factory according to the target order case. According to the method, through two-stage calculation, the obtained target order sending scheme can meet the requirement of a client on user time, the lowest freight cost can be guaranteed, the company cost can be saved, the calculation power can be saved, and the target order sending scheme can be quickly obtained through the scheme of two-stage calculation.
In some examples, the obtaining of the freight cost corresponding to each pre-dispatcher scheme through the pre-dispatcher scheme includes:
acquiring a sectional freight price between a pre-dispatching single factory location and an order delivery location corresponding to a pre-dispatching single scheme;
and calculating the freight cost based on the sectional freight price and the target ordered amount when the target ordered amount is less than or equal to the preset ordered amount.
For example, in the case that the target order quantity is less than or equal to the preset order quantity, the freight cost of each plant corresponding to each pre-dispatch order can be accurately calculated, and the preset order quantity can be determined according to the actual capacity of the company, and can be 1000 tons for example. The freight cost for each plant is determined based on the distance of the plant from the order site and the weight of the goods in different regions, and each plant has a unique shipping address. Each order will specify a unique shipping address. The delivery costs for all orders are calculated individually for each shipping address and for each receiving address for the weight to be delivered. Each shipping address will have a corresponding piece-wise pricing rule for different shipping addresses, e.g., a factory to order site freight weight and freight rate correspondence is shown in table 1.
Tonnage of vehicle Freight charges
0≤X<5T 550X
5T≤X<15T 520X
15T≤X<20T 440X
20≤X≤35T 390X
TABLE 1
The relationship between the freight rate and the load of a 35 ton truck with a rated load from the a plant to the order place is shown in table 1, the cost of transporting 80 tons of goods from the a plant is 2 x 35 x 390+10 x 520 =32500yuan, and the freight rate for different pre-assigned single schemes of each plant can be accurately calculated according to the method.
In summary, the automatic order dispatching method provided by the embodiment of the application accurately calculates the freight cost under different pre-dispatching order cases according to the segmented freight price of the factory site under the condition that the target order quantity is less than or equal to the preset order quantity, thereby providing a basis for formulating a more reasonable target order scheme.
In some examples, the method further comprises:
determining a weighted average unit price according to the section freight price when the target order quantity is larger than the preset order quantity, wherein the weighted average unit price is obtained based on the section weight and the section unit price in each section interval;
and calculating the freight cost based on the weighted average unit price and the target ordering amount.
Illustratively, under the condition that the target order quantity is larger than the preset order quantity, a method for calculating the freight cost corresponding to each pre-dispatching order scheme by using the sectional freight price is adopted, the calculation period is longer, the dispatch order timeliness is influenced, at the moment, the weighted average unit price is determined according to the sectional freight price, the freight cost is determined by using a method for determining the weighted average unit price, and the weighted average unit price is calculated according to the sectional weight and the sectional unit price in different regions.
In summary, according to the automatic order dispatching method provided by the embodiment of the application, under the condition that the target order quantity is larger than the preset order quantity, the freight cost is determined by adopting a weighted average unit price method, so that the influence of the area position on the freight can be considered, the order can be quickly calculated, and the efficiency is improved.
In some examples, the determining the weighted average unit price according to the section freight price includes:
the above weight average unit price p is calculated by the following formula:
Figure BDA0003811459130000081
in the formula, p 1 To p n Respectively the unit price m of the segment in the segment interval from the first segment to the nth segment 1 To m n The segment weights in the segment intervals from the first segment to the nth segment are respectively.
Illustratively, the weighted average unit price may be determined by the above formula, and still calculate the average unit price using the segment prices given in Table 1 as an example, then m 1 Is 5T 1 Is 550 Yuan/t, m 2 Is (15-5) =10t 2 Is 520 yuan/t, m 3 Is (20-15) =5t 3 Is 440 yuan/t, m 4 Is (35-20) =15t 4 For 390 yuan/t, the weight average unit price P = (5 × 550+10 × 520+5 × 440+15 × 390)/(3 +10+5+ 15) =457.14 yuan/t.
In summary, according to the automatic order dispatching method provided by the embodiment of the application, when the target order quantity is greater than the preset order quantity, the weighted average unit price is calculated by using the formula given by the above formula, so that the influence of the area position on the freight charge can be considered, the order can be quickly calculated, and the efficiency is improved.
In some examples, the capacity status includes a production capacity status and a package capacity status,
the obtaining of all pre-dispatching orders that can satisfy production time based on the target order quantity and the capacity status of the plurality of plants includes:
and acquiring all the pre-dispatching orders meeting the production time based on the target order quantity of the target order and the production capacity states and the packaging capacity states of the plurality of factories.
Illustratively, the capacity status of the factory includes a production capacity status and a packaging capacity status, and both the production capacity status and the packaging capacity status are guaranteed to meet the demand of the produced product, and the produced product can be packaged and delivered in time, so that the timeliness of the order can be guaranteed.
In summary, the automatic order dispatching method provided by the application embodiment considers not only the production capacity but also the packaging capacity, so that the production and delivery of the product can be effectively guaranteed, and the timeliness of the order can be guaranteed.
In some examples, the method further comprises:
under the condition that the target order quantity exceeds the total residual capacity of all factories, acquiring the single-day rated capacity of each factory;
and distributing the exceeding order quantity to each factory based on the single-day rated capacity and the same overproduction coefficient.
Illustratively, in the case that the target order quantity exceeds all the remaining capacity, the target order quantity is not delivered in time according to the predetermined production scheduling plan, for example, 1000 tons of goods are delivered within 10 days requested by the customer, but only 800 tons of goods can be delivered within 10 days according to the current production efficiency of each factory currently, and if the efficiency is not improved or the shift cannot complete the task on schedule, the achievable rated capacity is different in consideration of the different sizes of different factories, and the excess order quantity is allocated to each factory according to the same overproduction coefficient by obtaining the rated capacity per day of each factory, for example, 200 tons of goods are the excess order quantity, 20 tons of rated capacity per day of a factory, 30 tons of rated capacity per day of B factory, 50 tons of rated capacity per day of C factory, the excess order quantity is allocated to 40 tons of a factory, 60 tons of B factory, 100 tons of C factory, and the overproduction coefficient is 200%.
In summary, the method for automatically dispatching orders provided by the embodiment of the application allocates the excess orders to each plant through the rated capacity per day and the same overproduction coefficient under the condition that the target orders exceed the total remaining capacity of all plants, so that the production pressure of each plant can be ensured to be the same, and the time for overdue of products can be effectively shortened.
In some examples, the method further comprises:
under the condition that a plurality of pre-dispatching schemes with the lowest freight cost exist, obtaining customer self-service cost, wherein the customer self-service cost is determined based on customer self-service volume, and the customer self-service volume refers to a cargo volume which does not meet the requirement of corresponding finished vehicle shipment volume;
and determining the pre-dispatching scheme with lower self-proposal cost as the target dispatching scheme.
For example, if there is more than one pre-dispatching party scheme with the lowest freight cost, the self-picking cost of the customer is obtained at this time, the self-picking cost is because the whole vehicle cannot be filled with a certain order amount during the order splitting, the truck cannot be delivered to the home for the customer at this time, the truck mixes the order acquisition with other goods and fills the whole vehicle to send to the destination, the order acquisition is placed in the logistics company corresponding to the destination, the seller goes to the local logistics company to pick up the goods, the cost required for self-picking the goods is the self-picking cost, and the self-picking cost is not borne by the producer, but the shopping experience of the orderer is affected. Still take 35 tons of trucks as an example, calculate the weight of each factory that can not get on the delivery of the entire shipment, and calculate its corresponding self-proposed unit price, determine the self-proposed cost according to the self-proposed unit price and the self-proposed weight, under the condition that the lowest freight cost is the same, choose the lowest pre-dispatching scheme of the self-hoisting cost as the target dispatching scheme, and promote the shopping experience of the customer.
In summary, the automatic order dispatching method provided by the embodiment of the application obtains the self-proposal cost of the customer when there are a plurality of pre-dispatching orders with the lowest freight cost, determines the pre-dispatching orders with the lower self-proposal cost as the target dispatching orders, ensures the lowest freight cost and the lowest self-proposal cost, and improves the shopping experience of the customer.
In some examples, the present application employs two ways of determining freight prices based on the target order volume of an order, namely, phase pricing and weight-averaging pricing, and thus two cost calculation models, namely, a segment pricing model and a weight pricing model, are generated:
the objective function of the segmented pricing model is that the minimum logistics cost is:
Figure BDA0003811459130000111
the constraints are:
distributing the whole vehicle number and the non-whole vehicle number
Figure BDA0003811459130000112
Cost of non-entire vehicle delivery
Figure BDA0003811459130000113
Figure BDA0003811459130000114
Figure BDA0003811459130000115
The weight pricing model is:
as the sectional pricing influences the solving efficiency of the model, the related targets (1-2) and the constraints (2-5) are modified to a certain extent, and the specific calculation mode of replacing the sectional pricing by the single pricing is as follows:
Figure BDA0003811459130000121
in the formula, p 1 To p n Respectively the unit price m of the segment in the segment interval from the first segment to the nth segment 1 To m n The segment weights in the segment intervals from the first segment to the nth segment are respectively.
The objective function is: minimizing logistics costs
Figure BDA0003811459130000122
The variables in the above formula are explained as follows:
d, a delivery address set;
DP d a factory set corresponding to the delivery address d;
r is a receiving address set;
N dr fractional sets of pricing between shipping address d and receiving address r, e.g. three prices, N dr ={1,2,3};
I, order row set;
GI g all order line sets corresponding to the customer g;
RI r all order rows related to the receiving address r are collected;
PI p all order rows that factory p can arrange are collected;
IP i all factory sets that order row i can arrange;
w i order line i assemblyWeight (cell weight + package weight), I ∈ I;
dp dr the whole unit price of goods delivered to a receiving address R by a delivery address D is calculated according to vw, D belongs to D, and R belongs to R;
Figure BDA0003811459130000131
pricing the upper limit of the weight of the segment n from the delivery address D to the receiving address R, wherein D belongs to D, R belongs to R, and n belongs to Ndr;
Figure BDA0003811459130000132
the lower weight limit of N is segmented from the freight address R through the freight address D, D belongs to D, R belongs to R, and N belongs to N dr
Figure BDA0003811459130000133
Pricing unit price of a pricing segment N between a delivery address D and a receiving address R, wherein D belongs to D, R belongs to R, and N belongs to N dr
vw is the load capacity of the delivery vehicle;
pd logistics cost of distribution
x ip A variable of 0-1, whether an order line I is allocated to a factory P, I belongs to I, and P belongs to P;
d dr the whole vehicle quantity of the battery cores is distributed from a delivery address D to a receiving address R by an integer variable, wherein D belongs to D, and R belongs to R;
r dr continuously changing, namely distributing the weight of the whole vehicle of the battery core to a receiving address R by a delivery address D, wherein D belongs to D, and R belongs to R;
Figure BDA0003811459130000134
continuously changing variables, wherein a delivery address D distributes the quantity of the whole vehicles on the pricing segment N of the battery core to a receiving address R, D belongs to D, R belongs to R, and N belongs to N dr
Figure BDA0003811459130000135
With a variable of 0-1, whether the delivery address d delivers the cells to the receiving address rOn pricing segment N, D belongs to D, R belongs to R, N belongs to N dr
From the scales of the expressions (1) to (5), the calculation amount of the stage pricing scheme is larger than that of the weight pricing scheme identified by the expressions (6) and (7), and under the condition that the target ordering amount is larger than the preset ordering amount, the formula given by the above expression is adopted to calculate the weight average unit price, so that the influence of the area position on the freight can be considered, the dispatching order can be quickly calculated, and the efficiency is improved.
Referring to fig. 2, an embodiment of an automatic order dispatching device in the embodiment of the present application may include:
a first obtaining unit 21, configured to obtain all pre-dispatching orders that can meet the production time based on the target order quantity of the target order and the capacity status of each plant;
a second obtaining unit 22, configured to obtain, through the pre-dispatching order scheme, a freight cost corresponding to each pre-dispatching order scheme;
a determining unit 23, configured to determine the pre-issuer scheme with the lowest freight cost as a target issuer scheme;
and the dispatching unit 24 is used for dispatching orders to the corresponding target factories based on the target dispatching schemes.
As shown in fig. 3, an electronic device 300 is further provided in the embodiment of the present application, which includes a memory 310, a processor 320, and a computer program 311 stored in the memory 320 and running on the processor, and when the computer program 311 is executed by the processor 320, the steps of any one of the above methods for automatically dispatching orders are implemented.
Since the electronic device described in this embodiment is a device used for implementing an automatic dispatch apparatus in this embodiment, based on the method described in this embodiment, a person skilled in the art can understand the specific implementation manner of the electronic device of this embodiment and various variations thereof, so that how to implement the method in this embodiment by the electronic device is not described in detail herein, and as long as the person skilled in the art implements the device used for implementing the method in this embodiment, the device is within the scope of the present application.
In a specific implementation, the computer program 311 may implement any of the embodiments corresponding to fig. 1 when executed by a processor.
It should be noted that, in the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to relevant descriptions of other embodiments for parts that are not described in detail in a certain embodiment.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Embodiments of the present application further provide a computer program product, where the computer program product includes computer software instructions, and when the computer software instructions are executed on a processing device, the processing device is caused to execute the flow of automatic dispatch as in the embodiment corresponding to fig. 1.
The computer program product includes one or more computer instructions. The procedures or functions according to the embodiments of the present application are all or partially generated when the computer program instructions are loaded and executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). Computer-readable storage media can be any available media that a computer can store or a data storage device, such as a server, data center, etc., that includes one or more available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid State Disk (SSD)), among others.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method of the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present application.

Claims (10)

1. An automatic order dispatching method is characterized by comprising the following steps:
acquiring all pre-dispatching orders which can meet the production time based on the target order quantity of the target order and the capacity state of each factory;
acquiring the freight cost corresponding to each pre-dispatching single scheme through the pre-dispatching single schemes;
determining the pre-dispatching scheme with the lowest freight cost as a target dispatching scheme;
and dispatching orders to the corresponding target factories based on the target dispatching scheme.
2. The method of claim 1, wherein obtaining the freight cost for each pre-assigned scheme via the pre-assigned scheme comprises:
acquiring a sectional freight price between a location of a pre-dispatching order factory and an order delivery location corresponding to the pre-dispatching order scheme;
calculating the freight cost based on the section freight price and the target ordered amount when the target ordered amount is less than or equal to a preset ordered amount.
3. The method of claim 2, further comprising:
determining a weighted average unit price according to the section freight price under the condition that the target order quantity is greater than the preset order quantity, wherein the weighted average unit price is obtained based on the section weight and the section unit price in each section interval;
calculating the freight cost based on the weighted average unit price and the target booking volume.
4. The method of claim 3, wherein determining a weighted average unit price based on the fractional freight prices comprises:
the weighted average unit price p is calculated by the following formula:
Figure FDA0003811459120000011
in the formula, p 1 To p n The section unit prices m in the section intervals from the first section to the nth section 1 To m n The segment weights in the segment intervals from the first segment to the nth segment are respectively.
5. The method of claim 1, wherein the capacity status comprises a production capacity status and a package capacity status,
the obtaining of all pre-dispatching orders meeting the production time based on the target order quantity of the target order and the capacity states of a plurality of factories comprises:
and acquiring all the pre-dispatching orders meeting the production time based on the target order quantity of the target order and the production capacity states and the packaging capacity states of the plurality of factories.
6. The method of claim 1, further comprising:
under the condition that the target order quantity exceeds the total residual capacity of all factories, acquiring the single-day rated capacity of each factory;
and allocating the exceeding order quantity to each factory based on the single-day rated capacity and the same overproduction coefficient.
7. The method of claim 1, further comprising:
under the condition that a plurality of pre-dispatching schemes with the lowest freight cost exist, obtaining a customer self-submission cost, wherein the customer self-submission cost is determined based on a customer self-submission amount, and the customer self-submission amount refers to a cargo volume which does not meet the requirement of corresponding finished vehicle cargo volume;
and determining the pre-dispatching scheme with lower self-submission cost as a target dispatching scheme.
8. An automatic order dispatching device, comprising:
the system comprises a first obtaining unit, a second obtaining unit and a control unit, wherein the first obtaining unit is used for obtaining all pre-dispatching orders capable of meeting production time based on the target order quantity of a target order and the capacity state of each factory;
the second obtaining unit is used for obtaining the freight cost corresponding to each pre-dispatching single scheme through the pre-dispatching single scheme;
the determining unit is used for determining the pre-dispatching scheme with the lowest freight cost as a target dispatching scheme;
and the dispatching unit is used for dispatching the order to the corresponding target factory based on the target dispatching scheme.
9. An electronic device, comprising: memory and processor, characterized in that the processor is adapted to carry out the steps of the method of automatic dispatch of any one of claims 1 to 7 when executing a computer program stored in the memory.
10. A computer-readable storage medium having stored thereon a computer program, characterized in that: the computer program, when executed by a processor, implements the automated dispatch method of any of claims 1-7.
CN202211013304.2A 2022-08-23 2022-08-23 Automatic order dispatching method and related equipment Pending CN115456512A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211013304.2A CN115456512A (en) 2022-08-23 2022-08-23 Automatic order dispatching method and related equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211013304.2A CN115456512A (en) 2022-08-23 2022-08-23 Automatic order dispatching method and related equipment

Publications (1)

Publication Number Publication Date
CN115456512A true CN115456512A (en) 2022-12-09

Family

ID=84299332

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211013304.2A Pending CN115456512A (en) 2022-08-23 2022-08-23 Automatic order dispatching method and related equipment

Country Status (1)

Country Link
CN (1) CN115456512A (en)

Similar Documents

Publication Publication Date Title
US11270240B2 (en) Method and system for transfer order management
Ramaa et al. Impact of warehouse management system in a supply chain
US8620707B1 (en) Systems and methods for allocating inventory in a fulfillment network
JP7320537B2 (en) System and method for automated scheduling of delivery workers
CN107292724A (en) A kind of automatic generation method of order, device and server
CN113256193B (en) Warehouse commodity layout method and device
JP7223779B2 (en) Computer-implemented system and method for product inventory optimization through intelligent distribution of inbound products
CN110147974A (en) Inventory's sharing method and device between distributed warehouse
CN110390498B (en) Order distribution method and device
CN106991544B (en) Allocation system and allocation method
JP7097463B2 (en) Systems and methods configured to balance workloads across multiple computerized systems
JP7219289B2 (en) Operating Stock and Safety Stock Determination System
CN107330626A (en) A kind of method, device and server for splitting order
CN113191713A (en) Warehouse out-of-stock transferring method, device, equipment and storage medium
CN110276568A (en) It is put in storage resource allocation methods, device and computer system
CN110705946A (en) Cargo assembling method and cargo assembling system
Le et al. Determining an optimal warehouse location, capacity, and product allocation in a multi-product, multi-period distribution network: a case study
WO2006082808A1 (en) Delivery date answering program, delivery date answering method, and system for implementing the method
US9864962B1 (en) Minimum suggested rate picking
CN109493178A (en) A kind of cloud retail order decomposition method and system
CN115456512A (en) Automatic order dispatching method and related equipment
CN113554386A (en) Logistics distribution method, device, equipment and storage medium suitable for e-commerce orders
CN116468521A (en) Method, device, equipment and storage medium for optimizing goods picking of goods picking personnel
US20160019493A1 (en) Overnight productivity dashboard
CN115713200A (en) Method and device for processing inventory allocation, order processing and scheduling data

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