Dynamic matching method and system for distribution transport capacity and program product

Abstract

The invention belongs to the technical field of transport capacity allocation, and particularly discloses a dynamic matching method and system for distribution transport capacity and a program product, and the method comprises the steps: obtaining a logistics distribution order and logistics distribution demand information of a shipping party, querying a transport capacity unit candidate set which meets the corresponding time and route according to the order, and obtaining the logistics distribution order and logistics distribution demand information of the shipping party; screening subsets based on the distribution statistical information and the logistics distribution demand information of each idle transport capacity unit, determining a transport capacity unit target set, carrying out sorting to obtain a transport capacity unit ranking set, and then selecting a matching transport capacity unit which is sorted in the top in the transport capacity unit ranking set according to the demand transport capacity information and the basic transport capacity information of each idle transport capacity unit, and distribution order distribution is carried out on the matched transport capacity unit, so that efficient dynamic matching of logistics distribution transport capacity can be realized. According to the invention, the distribution demands and conditions of the shipping party can be effectively considered, more diversified and refined transport capacity unit screening and matching are realized, the demand matching degree of logistics distribution transport capacity is improved, and the logistics experience of the shipping party is improved.

Description

Technical Field

[0001] The present invention belongs to the technical field of transport capacity allocation, and specifically relates to a dynamic matching method, system and program product for distribution transport capacity. Background Art

[0002] Logistics engineering is an indispensable and important field in modern society, which involves the transportation, warehousing, and distribution of goods. In logistics operations, capacity matching and scheduling play a vital role. Capacity matching is to reasonably allocate transportation tools and human resources according to the characteristics of goods and the conditions of the demand side to meet the logistics transportation needs. Reasonable capacity matching can improve transportation efficiency, reduce transportation costs, ensure the timely delivery of goods, and improve the satisfaction of the demand side.

[0003] Most of the existing online logistics capacity allocation methods only follow the principle of dispatching orders nearby or the delivery party grabbing orders, and cannot take into account the delivery needs or conditions of the shipper to achieve more diversified and refined capacity unit screening and management. As a result, the actual capacity unit allocation results are not in line with the needs of the shipper, affecting the shipper's logistics experience. Summary of the invention

[0004] The purpose of the present invention is to provide a method, system and program product for dynamically matching distribution capacity to solve the above-mentioned problems existing in the prior art.

[0005] In order to achieve the above object, the present invention adopts the following technical solutions:

[0006] In a first aspect, a dynamic matching method for distribution capacity is provided, comprising:

[0007] Obtaining the logistics distribution order and logistics distribution demand information of the shipper, wherein the logistics distribution demand information includes a number of distribution screening conditions and a priority ranking corresponding to each distribution screening condition;

[0008] Extracting logistics delivery order information from the logistics delivery order, wherein the logistics delivery order information includes shipping address information, delivery address information, delivery time information, cargo type information, cargo specification information, and cargo quantity information;

[0009] Determine a dynamic matching area based on the shipping address information, and determine the delivery route information based on the shipping address information and the delivery address information;

[0010] Real-time query of each idle transport unit that meets the delivery time information and delivery route information in the dynamic matching area, using each idle transport unit to form a transport unit candidate set, and retrieving the transport unit comprehensive information of each idle transport unit, the transport unit comprehensive information including the basic transport capacity information and delivery statistical information of the corresponding idle transport unit;

[0011] Based on the delivery statistics of each idle transport unit in the transport unit candidate set, a transport unit candidate subset that meets each delivery screening condition is selected from the transport unit candidate set;

[0012] Determine the intersection of each capacity unit candidate subset, and use the intersection of each capacity unit candidate subset as the capacity unit target set;

[0013] According to the priority ranking corresponding to each delivery screening condition and the delivery statistical information of each idle transport unit, each idle transport unit in the transport unit target set is prioritized to obtain a transport unit ranking set;

[0014] Determine the required capacity information according to the cargo type information, cargo specification information and cargo quantity information, and select a number of idle capacity units ranked top from the capacity unit ranking set as matching capacity units according to the required capacity information and the basic capacity information of each idle capacity unit in the capacity unit ranking set;

[0015] A delivery order corresponding to each matching capacity unit is generated according to the logistics delivery order information and the basic capacity information of each matching capacity unit, and the delivery order corresponding to each matching capacity unit is distributed to each matching capacity unit.

[0016] In one possible design, when the intersection of the candidate subsets of the capacity units does not exist, the method further includes: determining the union of the candidate subsets of the capacity units, and using the union of the candidate subsets of the capacity units as the target capacity unit set.

[0017] In a possible design, determining the dynamic matching area according to the shipping address information includes:

[0018] Mark the shipping point on the electronic map according to the shipping address information;

[0019] With the shipping point as the center and the matching distance as the radius, the dynamic matching area is delineated.

[0020] In one possible design, the delivery statistical information includes delivery goods type statistical information, delivery average quantitative cost statistical information, delivery punctuality statistical information, delivery goods damage rate statistical information and delivery satisfaction statistical information, and the delivery screening conditions include delivery goods type frequency conditions, delivery average quantitative cost conditions, delivery punctuality conditions, delivery goods damage rate conditions and delivery satisfaction conditions.

[0021] In a possible design, based on the delivery statistical information of each idle transport unit in the transport unit candidate set, a transport unit candidate subset that satisfies each delivery screening condition is screened out from the transport unit candidate set, including:

[0022] According to the statistical information of the delivery cargo type of each idle transport unit, all idle transport units that meet the delivery cargo type frequency condition are selected from the transport unit candidate set to form a first transport unit candidate subset;

[0023] According to the statistical information of the average quantitative cost of distribution of each idle transport unit, all idle transport units that meet the average quantitative cost condition of distribution are selected from the transport unit candidate set to form a second transport unit candidate subset;

[0024] According to the delivery on-time rate statistics of each idle transport unit, all idle transport units that meet the delivery on-time rate conditions are selected from the transport unit candidate set to form a third transport unit candidate subset;

[0025] According to the statistical information of the damage rate of delivered goods of each idle transport unit, all idle transport units that meet the condition of the damage rate of delivered goods are selected from the transport unit candidate set to form a fourth transport unit candidate subset;

[0026] According to the delivery satisfaction statistics of each idle transport unit, all idle transport units that meet the delivery satisfaction conditions are selected from the transport unit candidate set to form a fifth transport unit candidate subset.

[0027] In a possible design, the priority ranking of each idle transport unit in the transport unit target set is performed according to the priority ranking corresponding to each delivery screening condition and the delivery statistical information of each idle transport unit to obtain a transport unit ranking set, including:

[0028] Determine the proportion of the number of deliveries of the corresponding type of goods in the number of historical deliveries of the idle transport unit according to the delivery goods type statistics and the goods type information, and determine the frequency score S1 of the idle transport unit according to the proportion of the number of deliveries;

[0029] Determine the economic score S2 of the idle transport unit based on the statistical information of the average quantitative cost of distribution of the idle transport unit;

[0030] Determine the punctuality score S3 of the idle transport unit according to the delivery punctuality statistical information of the idle transport unit;

[0031] Determine the integrity score S4 of the idle transport unit according to the statistical information of the damage rate of the delivered goods of the idle transport unit;

[0032] Determine the satisfaction score S5 of the idle transport unit according to the distribution satisfaction statistics of the idle transport unit;

[0033] According to the priority ranking corresponding to each delivery screening condition, the frequency weight coefficient a1, the economy weight coefficient a2, the punctuality weight coefficient a3, the integrity weight coefficient a4 and the satisfaction weight coefficient a5 are determined;

[0034] Substitute the frequency score S1, economy score S2, punctuality score S3, integrity score S4, satisfaction score S5, frequency weight coefficient a1, economy weight coefficient a2, punctuality weight coefficient a3, integrity weight coefficient a4 and satisfaction weight coefficient a5 into the comprehensive score formula S=S1×a1+S2×a2+S3×a3+S4×a4+S5×a5 for calculation to obtain the comprehensive score S of the corresponding idle capacity unit;

[0035] The idle capacity units in the capacity unit target set are prioritized according to the order of the comprehensive score S to obtain a capacity unit ranking set.

[0036] In a possible design, the required capacity information includes the required total volume and the required total weight, the basic capacity information includes the carrying capacity and the carrying weight, and the method of selecting a plurality of top-ranked idle capacity units from the capacity unit ranking set as matching capacity units based on the required capacity information and the basic capacity information of each idle capacity unit in the capacity unit ranking set includes:

[0037] According to the total demand volume and total demand weight as well as the carrying capacity and carrying weight of each idle capacity unit in the capacity unit ranking set, several idle capacity units with the highest ranking are selected from the capacity unit ranking set as matching capacity units, so that the sum of the carrying capacity of all matching capacity units is greater than or equal to the total demand volume, and the sum of the carrying weight of all matching capacity units is greater than or equal to the total demand weight.

[0038] In a second aspect, a dynamic matching system for distribution capacity is provided, including an information acquisition unit, an order extraction unit, a region determination unit, a unit candidate unit, a subset screening unit, a target determination unit, a unit sorting unit, a matching selection unit and an order distribution unit, wherein:

[0039] An information acquisition unit, used to acquire the logistics distribution order and logistics distribution demand information of the shipper, wherein the logistics distribution demand information includes a plurality of distribution screening conditions and a priority ranking corresponding to each distribution screening condition;

[0040] An order extraction unit is used to extract logistics distribution order information from the logistics distribution order, wherein the logistics distribution order information includes shipping address information, delivery address information, delivery time information, cargo type information, cargo specification information, and cargo quantity information;

[0041] An area determination unit, used to determine a dynamic matching area according to the shipping address information, and to determine the delivery route information according to the shipping address information and the delivery address information;

[0042] The unit candidate unit is used to query in real time each idle transport unit that meets the delivery time information and delivery route information in the dynamic matching area, use each idle transport unit to form a transport unit candidate set, and retrieve the transport unit comprehensive information of each idle transport unit, the transport unit comprehensive information includes the basic transport capacity information and delivery statistical information of the corresponding idle transport unit;

[0043] A subset screening unit, configured to screen out a subset of transport unit candidates that meet each delivery screening condition from the transport unit candidate set based on the delivery statistical information of each idle transport unit in the transport unit candidate set;

[0044] A target determination unit, used for determining the intersection of each capacity unit candidate subset, and taking the intersection of each capacity unit candidate subset as the capacity unit target set;

[0045] The unit sorting unit is used to sort the priorities of the idle transport units in the transport unit target set according to the priority sorting corresponding to each delivery screening condition and the delivery statistical information of each idle transport unit to obtain a transport unit ranking set;

[0046] A matching selection unit is used to determine the required capacity information according to the cargo type information, cargo specification information and cargo quantity information, and select a number of idle capacity units with the highest ranking from the capacity unit ranking set as matching capacity units according to the required capacity information and the basic capacity information of each idle capacity unit in the capacity unit ranking set;

[0047] The order distribution unit is used to generate the distribution orders corresponding to each matching capacity unit according to the logistics distribution order information and the basic capacity information of each matching capacity unit, and distribute the distribution orders corresponding to each matching capacity unit to each matching capacity unit.

[0048] In a third aspect, a dynamic matching system for distribution capacity is provided, including:

[0049] A memory for storing instructions;

[0050] A processor is used to read the instructions stored in the memory and execute any one of the methods described in the first aspect according to the instructions.

[0051] In a fourth aspect, a computer-readable storage medium is provided, wherein instructions are stored on the computer-readable storage medium, and when the instructions are executed on a computer, the computer executes any one of the methods described in the first aspect. In addition, a computer program product is provided, and when the computer program product is executed on a computer, the computer executes any one of the methods described in the first aspect.

[0052] Beneficial effects: The present invention obtains the logistics distribution order and logistics distribution demand information of the shipper to query the candidate set of capacity units that meet the corresponding time and route according to the order, and then screens the subset based on the distribution statistics and logistics distribution demand information of each idle capacity unit, determines the target set of capacity units, and sorts to obtain the capacity unit ranking set, and then selects the top-ranked matching capacity units in the capacity unit ranking set according to the demand capacity information and the basic capacity information of each idle capacity unit, distributes the distribution orders to the matching capacity units, and can achieve efficient dynamic matching of logistics distribution capacity. The present invention can effectively take into account the distribution needs and conditions of the shipper, realize more diversified and refined screening and matching of capacity units, improve the demand matching degree of logistics distribution capacity, and enhance the logistics experience of the shipper. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0054] Figure 1 This is a schematic diagram of the steps of the method in Example 1 of the present invention;

[0055] Figure 2 This is a schematic diagram of the structure of the system in Example 2 of the present invention;

[0056] Figure 3 Schematic diagram of the system structure in Example 3 of the present invention. DETAILED DESCRIPTION

[0057] It should be noted that the description of these embodiments is used to help understand the present invention, but does not constitute a limitation of the present invention. The specific structures and functional details disclosed herein are only used to describe the exemplary embodiments of the present invention. However, the present invention can be embodied in many alternative forms, and it should not be understood that the present invention is limited to the embodiments set forth herein.

[0058] It should be understood that, unless otherwise clearly specified and limited, the term "connection" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the embodiments can be understood according to specific circumstances.

[0059] In the following description, certain details are provided to facilitate a complete understanding of the example embodiments. However, it will be appreciated by those of ordinary skill in the art that the example embodiments may be implemented without these certain details. For example, devices may be shown in block diagrams to avoid obscuring the examples with unnecessary details. In other embodiments, well-known processes, structures, and techniques may not be shown in unnecessary detail to avoid obscuring the embodiments.

[0060] Embodiment 1:

[0061] This embodiment provides a dynamic matching method for distribution capacity, which can be applied to corresponding capacity allocation servers, such as Figure 1 As shown, the method comprises the following steps:

[0062] S1. Obtain the logistics distribution order and logistics distribution demand information of the shipper, wherein the logistics distribution demand information includes a number of distribution screening conditions and a priority ranking corresponding to each distribution screening condition.

[0063] During specific implementation, the server obtains the logistics distribution order and logistics distribution demand information of the shipper through online channels. The logistics distribution demand information includes several distribution screening conditions and the priority ranking corresponding to each distribution screening condition. The distribution screening conditions include the distribution type frequency condition (such as the number of times a certain type of goods is distributed reaches the set proportion threshold), the average quantitative distribution cost condition (such as the average quantitative distribution cost is lower than the set cost threshold), the delivery punctuality rate condition (such as the delivery punctuality rate reaches the set punctuality rate threshold), the delivery goods damage rate condition (such as the delivery goods damage rate is lower than the set damage rate threshold) and the delivery satisfaction condition (such as the delivery satisfaction is higher than the set satisfaction threshold). The priority ranking corresponding to each distribution screening condition can be set by the shipper according to its own needs, such as setting it in the order of average quantitative distribution cost condition-delivery punctuality rate condition-delivery goods damage rate condition-delivery satisfaction condition-delivery goods type frequency condition.

[0064] S2. Extracting logistics distribution order information from the logistics distribution order, the logistics distribution order information includes shipping address information, delivery address information, delivery time information, cargo type information, cargo specification information and cargo quantity information.

[0065] In specific implementation, the server can extract logistics delivery order information from the logistics delivery order through a character extraction method, and the logistics delivery order information includes shipping address information, delivery address information, delivery time information, cargo type information, cargo specification information and cargo quantity information.

[0066] S3. Determine a dynamic matching area based on the shipping address information, and determine the delivery route information based on the shipping address information and the delivery address information.

[0067] In specific implementation, the server can mark the shipping point in the electronic map according to the shipping address information, and then define the dynamic matching area with the shipping point as the center and the matching distance as the radius. At the same time, the server determines the delivery route information according to the shipping address information and the delivery address information, such as all routes from shipping address A to delivery address B.

[0068] S4. Query in real time all idle transport units in the dynamic matching area that meet the delivery time information and delivery route information, use all idle transport units to form a transport unit candidate set, and retrieve the transport unit comprehensive information of each idle transport unit, wherein the transport unit comprehensive information includes the basic transport capacity information and delivery statistical information of the corresponding idle transport unit.

[0069] In specific implementation, the server queries in real time all idle transport units in the dynamic matching area that meet the delivery time information and delivery route information, that is, queries nearby idle transport units that are idle before the delivery time and can accept the corresponding delivery route. Idle transport units include transport personnel and transport vehicles. Then, each idle transport unit is used to form a candidate set of transport units. At the same time, the comprehensive transport unit information of each idle transport unit is retrieved. The comprehensive transport unit information includes the basic transport capacity information of the corresponding idle transport unit and delivery statistical information. The delivery statistical information includes delivery goods type statistical information, delivery average quantitative cost statistical information, delivery punctuality statistical information, delivery goods damage rate statistical information and delivery satisfaction statistical information.

[0070] S5. Based on the delivery statistical information of each idle transport unit in the transport unit candidate set, a transport unit candidate subset that meets each delivery screening condition is selected from the transport unit candidate set.

[0071] During specific implementation, the server selects all idle capacity units that meet the frequency condition of the delivery type from the capacity unit candidate set according to the statistical information of the delivery goods type of each idle capacity unit, and forms a first capacity unit candidate subset; according to the statistical information of the average quantified delivery cost of each idle capacity unit, selects all idle capacity units that meet the average quantified delivery cost condition from the capacity unit candidate set to form a second capacity unit candidate subset; according to the statistical information of the delivery punctuality rate of each idle capacity unit, selects all idle capacity units that meet the delivery punctuality rate condition from the capacity unit candidate set to form a third capacity unit candidate subset; according to the statistical information of the damage rate of the delivery goods of each idle capacity unit, selects all idle capacity units that meet the damage rate condition from the capacity unit candidate set to form a fourth capacity unit candidate subset; according to the statistical information of the delivery satisfaction of each idle capacity unit, selects all idle capacity units that meet the delivery satisfaction condition from the capacity unit candidate set to form a fifth capacity unit candidate subset.

[0072] S6. Determine the intersection of each capacity unit candidate subset, and use the intersection of each capacity unit candidate subset as the capacity unit target set.

[0073] In specific implementation, the server uses the intersection of each capacity unit candidate subset (i.e., the first capacity unit candidate subset, the second capacity unit candidate subset, the third capacity unit candidate subset, the fourth capacity unit candidate subset, and the fifth capacity unit candidate subset) as the capacity unit target set. When the intersection of each capacity unit candidate subset does not exist, the server uses the union of each capacity unit candidate subset (i.e., the first capacity unit candidate subset, the second capacity unit candidate subset, the third capacity unit candidate subset, the fourth capacity unit candidate subset, and the fifth capacity unit candidate subset) as the capacity unit target set.

[0074] S7. Prioritize each idle transport unit in the transport unit target set according to the priority ranking corresponding to each delivery screening condition and the delivery statistical information of each idle transport unit to obtain a transport unit ranking set.

[0075] In specific implementation, the server determines the proportion of the corresponding cargo type in the historical delivery times of the idle transport unit based on the delivery cargo type statistical information and cargo type information, and determines the frequency score S1 of the idle transport unit based on the delivery frequency proportion; determines the economic score S2 of the idle transport unit based on the statistical information of the average quantitative delivery cost of the idle transport unit; determines the punctuality score S3 of the idle transport unit based on the statistical information of the delivery punctuality rate of the idle transport unit; determines the integrity score S4 of the idle transport unit based on the statistical information of the damage rate of the delivered cargo of the idle transport unit; determines the satisfaction score of the idle transport unit based on the statistical information of the delivery satisfaction of the idle transport unit Score S5; determine the frequency weight coefficient a1, economic weight coefficient a2, punctuality weight coefficient a3, integrity weight coefficient a4 and satisfaction weight coefficient a5 according to the priority ranking corresponding to each distribution screening condition; substitute the frequency score S1, economic score S2, punctuality score S3, integrity score S4, satisfaction score S5, frequency weight coefficient a1, economic weight coefficient a2, punctuality weight coefficient a3, integrity weight coefficient a4 and satisfaction weight coefficient a5 into the comprehensive score formula S = S1 × a1 + S2 × a2 + S3 × a3 + S4 × a4 + S5 × a5 for calculation, and obtain the comprehensive score S of the corresponding idle capacity unit. Finally, prioritize the idle capacity units in the capacity unit target set according to the order of the comprehensive score S to obtain the capacity unit ranking set.

[0076] S8. Determine the required capacity information based on the cargo type information, cargo specification information and cargo quantity information, and select several idle capacity units with the highest ranking from the capacity unit ranking set as matching capacity units based on the required capacity information and the basic capacity information of each idle capacity unit in the capacity unit ranking set.

[0077] In specific implementation, the server may calculate and determine the required capacity information based on the cargo type information, cargo specification information, and cargo quantity information, and the required capacity information includes the required total volume and the required total weight. The basic capacity information includes the carrying capacity and the carrying weight. Based on the required total volume and the required total weight and the carrying capacity and carrying weight of each idle capacity unit in the capacity unit ranking set, the server selects several idle capacity units with the highest ranking from the capacity unit ranking set as matching capacity units, so that the sum of the carrying volumes of all matching capacity units is greater than or equal to the required total volume, and the sum of the carrying weights of all matching capacity units is greater than or equal to the required total weight.

[0078] S9. Generate the delivery orders corresponding to each matching transport unit according to the logistics delivery order information and the basic transport capacity information of each matching transport unit, and distribute the delivery orders corresponding to each matching transport unit to each matching transport unit.

[0079] During specific implementation, after selecting each matching capacity unit, the server can generate a delivery order corresponding to each matching capacity unit based on the logistics delivery order information and the basic capacity information of each matching capacity unit. The delivery order contains the corresponding logistics delivery order information and the quantity of goods allocated to the corresponding matching capacity unit. The delivery order corresponding to each matching capacity unit is then distributed to each matching capacity unit to complete the capacity matching and order splitting of the shipper's goods.

[0080] The method of this embodiment can effectively take into account the delivery needs and conditions of the shipper, realize more diversified and refined screening and matching of capacity units, improve the demand matching degree of logistics distribution capacity, and enhance the logistics experience of the shipper.

[0081] Embodiment 2:

[0082] This embodiment provides a dynamic matching system for distribution capacity, such as Figure 2 As shown, it includes an information acquisition unit, an order extraction unit, an area determination unit, a unit candidate unit, a subset screening unit, a target determination unit, a unit sorting unit, a matching selection unit and an order distribution unit, wherein:

[0083] An information acquisition unit, used to acquire the logistics distribution order and logistics distribution demand information of the shipper, wherein the logistics distribution demand information includes a plurality of distribution screening conditions and a priority ranking corresponding to each distribution screening condition;

[0084] An order extraction unit is used to extract logistics distribution order information from the logistics distribution order, wherein the logistics distribution order information includes shipping address information, delivery address information, delivery time information, cargo type information, cargo specification information, and cargo quantity information;

[0085] An area determination unit, used to determine a dynamic matching area according to the shipping address information, and to determine the delivery route information according to the shipping address information and the delivery address information;

[0086] The unit candidate unit is used to query in real time each idle transport unit that meets the delivery time information and delivery route information in the dynamic matching area, use each idle transport unit to form a transport unit candidate set, and retrieve the transport unit comprehensive information of each idle transport unit, the transport unit comprehensive information includes the basic transport capacity information and delivery statistical information of the corresponding idle transport unit;

[0087] A subset screening unit, configured to screen out a subset of transport unit candidates that meet each delivery screening condition from the transport unit candidate set based on the delivery statistical information of each idle transport unit in the transport unit candidate set;

[0088] A target determination unit, used for determining the intersection of each capacity unit candidate subset, and taking the intersection of each capacity unit candidate subset as the capacity unit target set;

[0089] The unit sorting unit is used to sort the priorities of the idle transport units in the transport unit target set according to the priority sorting corresponding to each delivery screening condition and the delivery statistical information of each idle transport unit to obtain a transport unit ranking set;

[0090] A matching selection unit is used to determine the required capacity information according to the cargo type information, cargo specification information and cargo quantity information, and select a number of idle capacity units with the highest ranking from the capacity unit ranking set as matching capacity units according to the required capacity information and the basic capacity information of each idle capacity unit in the capacity unit ranking set;

[0091] The order distribution unit is used to generate the distribution orders corresponding to each matching capacity unit according to the logistics distribution order information and the basic capacity information of each matching capacity unit, and distribute the distribution orders corresponding to each matching capacity unit to each matching capacity unit.

[0092] Embodiment 3:

[0093] This embodiment provides a dynamic matching system for distribution capacity, such as Figure 3 As shown, at the hardware level, it includes:

[0094] Data interface, used to establish data connection between the processor and the external data terminal;

[0095] A memory for storing instructions;

[0096] The processor is used to read the instructions stored in the memory and execute the dynamic matching method of distribution capacity in Example 1 according to the instructions.

[0097] Optionally, the system further includes an internal bus, through which the processor, the memory and the data interface can be interconnected, and the internal bus can be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc.

[0098] The memory may include, but is not limited to, random access memory (RAM), read only memory (ROM), flash memory, first input first output (FIFO) and / or first in last out (FILO) memory, etc. The processor may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

[0099] Embodiment 4:

[0100] This embodiment provides a computer-readable storage medium, which stores instructions. When the instructions are executed on a computer, the computer executes the dynamic matching method of the distribution capacity in Embodiment 1. The computer-readable storage medium refers to a carrier for storing data, which may include but is not limited to a floppy disk, an optical disk, a hard disk, a flash memory, a USB flash drive, and / or a memory stick, etc. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.

[0101] This embodiment also provides a computer program product, which, when executed on a computer, executes the dynamic matching method of the distribution capacity in Embodiment 1. The computer may be a general-purpose computer, a special-purpose computer, a computer network or other programmable device.

[0102] Finally, it should be noted that the above description is only a preferred embodiment of the present invention and is not intended to limit the protection scope of the present invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A dynamic matching method for distribution capacity, characterized in that: include: Obtaining the logistics distribution order and logistics distribution demand information of the shipper, wherein the logistics distribution demand information includes a number of distribution screening conditions and a priority ranking corresponding to each distribution screening condition; Extracting logistics delivery order information from the logistics delivery order, wherein the logistics delivery order information includes shipping address information, delivery address information, delivery time information, cargo type information, cargo specification information, and cargo quantity information; Determine a dynamic matching area based on the shipping address information, and determine the delivery route information based on the shipping address information and the delivery address information; Real-time query of each idle transport unit that meets the delivery time information and delivery route information in the dynamic matching area, using each idle transport unit to form a transport unit candidate set, and retrieving the transport unit comprehensive information of each idle transport unit, the transport unit comprehensive information including the basic transport capacity information and delivery statistical information of the corresponding idle transport unit; Based on the delivery statistics of each idle transport unit in the transport unit candidate set, a transport unit candidate subset that meets each delivery screening condition is selected from the transport unit candidate set; Determine the intersection of each capacity unit candidate subset, and use the intersection of each capacity unit candidate subset as the capacity unit target set; According to the priority ranking corresponding to each delivery screening condition and the delivery statistical information of each idle transport unit, each idle transport unit in the transport unit target set is prioritized to obtain a transport unit ranking set; Determine the required capacity information according to the cargo type information, cargo specification information and cargo quantity information, and select a number of idle capacity units ranked top from the capacity unit ranking set as matching capacity units according to the required capacity information and the basic capacity information of each idle capacity unit in the capacity unit ranking set; A delivery order corresponding to each matching capacity unit is generated according to the logistics delivery order information and the basic capacity information of each matching capacity unit, and the delivery order corresponding to each matching capacity unit is distributed to each matching capacity unit.

2. A dynamic matching method for distribution capacity according to claim 1, characterized in that: When the intersection of the candidate subsets of the capacity units does not exist, the method further includes: determining the union of the candidate subsets of the capacity units, and using the union of the candidate subsets of the capacity units as the target capacity unit set.

3. A dynamic matching method for distribution capacity according to claim 1, characterized in that: Determining the dynamic matching area according to the shipping address information includes: Mark the shipping point on the electronic map according to the shipping address information; With the shipping point as the center and the matching distance as the radius, the dynamic matching area is delineated.

4. A dynamic matching method for distribution capacity according to claim 1, characterized in that: The delivery statistical information includes delivery goods type statistical information, delivery average quantitative cost statistical information, delivery punctuality statistical information, delivery goods damage rate statistical information and delivery satisfaction statistical information, and the delivery screening conditions include delivery goods type frequency conditions, delivery average quantitative cost conditions, delivery punctuality conditions, delivery goods damage rate conditions and delivery satisfaction conditions.

5. A dynamic matching method for distribution capacity according to claim 4, characterized in that: The method of selecting a subset of candidate transport units that meet various delivery screening conditions from the candidate transport unit set based on the delivery statistical information of each idle transport unit in the candidate transport unit set includes: According to the statistical information of the delivery cargo type of each idle transport unit, all idle transport units that meet the delivery cargo type frequency condition are selected from the transport unit candidate set to form a first transport unit candidate subset; According to the statistical information of the average quantitative cost of distribution of each idle transport unit, all idle transport units that meet the average quantitative cost condition of distribution are selected from the transport unit candidate set to form a second transport unit candidate subset; According to the delivery on-time rate statistics of each idle transport unit, all idle transport units that meet the delivery on-time rate conditions are selected from the transport unit candidate set to form a third transport unit candidate subset; According to the statistical information of the damage rate of delivered goods of each idle transport unit, all idle transport units that meet the condition of the damage rate of delivered goods are selected from the transport unit candidate set to form a fourth transport unit candidate subset; According to the delivery satisfaction statistics of each idle transport unit, all idle transport units that meet the delivery satisfaction conditions are selected from the transport unit candidate set to form a fifth transport unit candidate subset.

6. A dynamic matching method for distribution capacity according to claim 4, characterized in that: The priority ranking of each idle transport unit in the transport unit target set is performed according to the priority ranking corresponding to each delivery screening condition and the delivery statistical information of each idle transport unit to obtain a transport unit ranking set, including: Determine the proportion of the number of deliveries of the corresponding type of goods in the number of historical deliveries of the idle transport unit according to the delivery goods type statistics and the goods type information, and determine the frequency score S1 of the idle transport unit according to the proportion of the number of deliveries; Determine the economic score S2 of the idle transport unit based on the statistical information of the average quantitative cost of distribution of the idle transport unit; Determine the punctuality score S3 of the idle transport unit according to the delivery punctuality statistical information of the idle transport unit; Determine the integrity score S4 of the idle transport unit according to the statistical information of the damage rate of the delivered goods of the idle transport unit; Determine the satisfaction score S5 of the idle transport unit according to the distribution satisfaction statistics of the idle transport unit; According to the priority ranking corresponding to each delivery screening condition, the frequency weight coefficient a1, the economy weight coefficient a2, the punctuality weight coefficient a3, the integrity weight coefficient a4 and the satisfaction weight coefficient a5 are determined; Substitute the frequency score S1, economy score S2, punctuality score S3, integrity score S4, satisfaction score S5, frequency weight coefficient a1, economy weight coefficient a2, punctuality weight coefficient a3, integrity weight coefficient a4 and satisfaction weight coefficient a5 into the comprehensive score formula S=S1×a1+S2×a2+S3×a3+S4×a4+S5×a5 for calculation to obtain the comprehensive score S of the corresponding idle capacity unit; The idle capacity units in the capacity unit target set are prioritized according to the order of the comprehensive score S to obtain a capacity unit ranking set.

7. A dynamic matching method for distribution capacity according to claim 1, characterized in that: The required capacity information includes the required total volume and the required total weight, the basic capacity information includes the carrying capacity and the carrying weight, and the selecting, based on the required capacity information and the basic capacity information of each idle capacity unit in the capacity unit ranking set, a plurality of idle capacity units ranked top from the capacity unit ranking set as matching capacity units includes: According to the total demand volume and total demand weight as well as the carrying capacity and carrying weight of each idle capacity unit in the capacity unit ranking set, several idle capacity units with the highest ranking are selected from the capacity unit ranking set as matching capacity units, so that the sum of the carrying capacity of all matching capacity units is greater than or equal to the total demand volume, and the sum of the carrying weight of all matching capacity units is greater than or equal to the total demand weight.

8. A dynamic matching system for distribution capacity, characterized in that: It includes an information acquisition unit, an order extraction unit, an area determination unit, a unit candidate unit, a subset screening unit, a target determination unit, a unit sorting unit, a matching selection unit and an order distribution unit, wherein: An information acquisition unit, used to acquire the logistics distribution order and logistics distribution demand information of the shipper, wherein the logistics distribution demand information includes a plurality of distribution screening conditions and a priority ranking corresponding to each distribution screening condition; An order extraction unit is used to extract logistics distribution order information from the logistics distribution order, wherein the logistics distribution order information includes shipping address information, delivery address information, delivery time information, cargo type information, cargo specification information, and cargo quantity information; An area determination unit, used to determine a dynamic matching area according to the shipping address information, and to determine the delivery route information according to the shipping address information and the delivery address information; The unit candidate unit is used to query in real time each idle transport unit that meets the delivery time information and delivery route information in the dynamic matching area, use each idle transport unit to form a transport unit candidate set, and retrieve the transport unit comprehensive information of each idle transport unit, the transport unit comprehensive information includes the basic transport capacity information and delivery statistical information of the corresponding idle transport unit; A subset screening unit, configured to screen out a subset of transport unit candidates that meet each delivery screening condition from the transport unit candidate set based on the delivery statistical information of each idle transport unit in the transport unit candidate set; A target determination unit, used for determining the intersection of each capacity unit candidate subset, and taking the intersection of each capacity unit candidate subset as the capacity unit target set; The unit sorting unit is used to sort the priorities of the idle transport units in the transport unit target set according to the priority sorting corresponding to each delivery screening condition and the delivery statistical information of each idle transport unit to obtain a transport unit ranking set; A matching selection unit is used to determine the required capacity information according to the cargo type information, cargo specification information and cargo quantity information, and select a number of idle capacity units with the highest ranking from the capacity unit ranking set as matching capacity units according to the required capacity information and the basic capacity information of each idle capacity unit in the capacity unit ranking set; The order distribution unit is used to generate the distribution orders corresponding to each matching capacity unit according to the logistics distribution order information and the basic capacity information of each matching capacity unit, and distribute the distribution orders corresponding to each matching capacity unit to each matching capacity unit.

9. A dynamic matching system for distribution capacity, characterized in that: include: A memory for storing instructions; A processor is used to read the instructions stored in the memory and execute the dynamic matching method of distribution capacity described in any one of claims 1-7 according to the instructions.

10. A computer program product, characterized in that When the computer program product runs on a computer, the dynamic matching method for distribution capacity described in any one of claims 1 to 7 is executed.

Images