CN111695732B - Order batching and path planning method for tobacco finished product logistics - Google Patents
Order batching and path planning method for tobacco finished product logistics Download PDFInfo
- Publication number
- CN111695732B CN111695732B CN202010519914.4A CN202010519914A CN111695732B CN 111695732 B CN111695732 B CN 111695732B CN 202010519914 A CN202010519914 A CN 202010519914A CN 111695732 B CN111695732 B CN 111695732B
- Authority
- CN
- China
- Prior art keywords
- order
- transportation
- batch
- vehicle
- batches
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0633—Workflow analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an order batch and path planning method for tobacco finished product logistics. Generating an order transportation batch according to an order transportation batch generation process; distributing vehicle types for the order transportation batches according to the vehicle type distribution flow and judging whether an order group larger than the maximum vehicle carrying capacity exists in the order transportation batches or not; if the order group with the maximum vehicle carrying capacity exists, splitting and adjusting the order transport batches according to the distribution scheme adjusting process and judging whether the order group with the maximum vehicle carrying capacity exists in the order transport batches again; and if the order group with the capacity larger than the maximum vehicle carrying capacity does not exist, outputting an order transportation batch and vehicle type distribution scheme. The method meets the actual use requirement, has high calculation efficiency, can effectively reduce the distribution cost through the route planning and vehicle type distribution scheme obtained by the method, and improves the space utilization rate of the vehicle.
Description
Technical Field
The invention relates to the technical field of safety production, in particular to an order batching and path planning method for tobacco finished product logistics.
Background
As the logistics industry of China enters the lean development stage, the logistics distribution center of the industry is undoubtedly required to be a powerful guarantee for production and operation and to bear the irrevocable responsibility for cost reduction and efficiency improvement, and from the aspect of the composition proportion of the logistics cost, the distribution and transportation cost accounts for the absolute proportion of the total logistics cost, so that the logistics distribution and transportation cost is optimized as a breakthrough, and the purpose of reducing the total logistics cost is achieved, and the sustainable development of tobacco logistics enterprises is realized.
Currently, the industry of tobacco, medicine and the like generally adopts a standard-division transportation mode. The head office demarcates a plurality of service bid packages according to the shipment warehouse and the sales area, one service bid package comprises one or more bid sections, the carriers perform bid inviting aiming at each bid section, and finally the transportation tasks of the sales area in the bid sections are distributed to the carriers winning the bid. And each carrier will correspondingly configure corresponding vehicles, and report the transport capacity under the corresponding mark section to the logistics center on time in daily transportation scheduling.
Under the requirement of a carrying service contract corresponding to each section, the transportation unit price of each carrier at the corresponding section is different according to the transportation region, and a single-point, two-point and three-point transportation mode exists in the transportation and distribution process, and when the order number does not reach the guaranteed amount in the corresponding transportation mode, an enterprise needs to carry out corresponding transportation subsidies on the carriers.
The current scheduling mainly takes manual experience scheduling as a main part, the logistics cost is high, and the vehicle space cannot be fully utilized. At present, intelligent heuristic methods such as genetic algorithm and the like and field search methods are used for solving, but when the problem scale is large, the solving time and the solving quality cannot meet the using requirements.
Disclosure of Invention
The invention aims to provide an order batching and path planning method for tobacco finished product logistics, which can reduce the overall logistics cost and improve the use efficiency of a vehicle.
According to a first aspect of the present invention, there is provided a method for order batching and path planning of tobacco product logistics, comprising:
generating an order transportation batch according to an order transportation batch generation process;
distributing vehicle types for the order transportation batches according to the vehicle type distribution process and judging whether order groups larger than the maximum vehicle carrying capacity exist in the order transportation batches or not;
if the order group with the capacity larger than the maximum vehicle carrying capacity exists, splitting and adjusting the order transportation batches according to the distribution scheme adjustment process and judging whether the order group with the capacity larger than the maximum vehicle carrying capacity exists in the order transportation batches again;
and if the order group with the capacity larger than the maximum vehicle carrying capacity does not exist, outputting an order transportation batch and vehicle type distribution scheme.
Further, "generating an order shipping batch according to the order shipping batch generation process" specifically includes:
generating an order group according to the destination and the starting point;
arranging the order groups in an ascending order according to the earliest cut-off time of the orders in the order groups to obtain an order group set to be distributed;
performing two-point combination on all order renters with the quality smaller than a first preset value in the order group to be distributed to obtain a temporary transportation batch;
combining three points of the order groups which still have the value smaller than the second preset value after the two points are combined to obtain a transportation batch;
after the two points are combined, no order group smaller than a second preset value exists, and the temporary transportation batch is used as a transportation batch;
deleting the order groups which form the transportation batch and updating the order group set to be distributed;
and repeating the order combining steps until no order can be combined.
Further, "two-point combination" specifically includes:
combining all the non-merged order groups pairwise and then reordering to form a plurality of sequences;
calculating cost savings for the set of orders in the feasible sequence;
and combining the orders with the largest cost saving as the combined order transportation batch.
Further, "distributing vehicle types for order transportation batches according to a vehicle type distribution process" specifically includes:
acquiring order transportation batches with the weight less than or equal to the maximum vehicle loading capacity in all order transportation batches;
after all order transport batches which do not exceed the maximum vehicle loading capacity are arranged in an ascending order according to batch transport volume, arranging the vehicles in an ascending order according to transport volume;
sequentially distributing vehicles with vehicle type capacity larger than the transport batch capacity and closest in value for each order transport batch according to the order transport batch sequence;
deleting the distributed vehicles and order transportation batches;
and repeating the distribution steps until all the transportation batches are distributed.
Further, "if there is an order group greater than the maximum vehicle carrying capacity, splitting and adjusting the order transportation batch according to the distribution scheme adjustment process and re-determining whether there is an order group greater than the maximum vehicle carrying capacity in the order transportation batch" specifically includes:
acquiring all order transportation batches with the transportation batch weight larger than the maximum vehicle loading capacity, and arranging the order transportation batches in a descending order according to the batch transportation capacity;
acquiring the information of the residual vehicle resources, and arranging the information of the residual vehicle resources in a descending order according to the vehicle loading capacity;
splitting the overweight batches according to the arranged sequence, wherein the minimum vehicle transportation quantity in the splitting process is a first preset value;
vehicle type distribution is carried out on the split order transportation batches again;
and repeating the steps until all overweight batch vehicle types are distributed.
The invention has the beneficial effects that: the method and the system meet the actual use requirements, are high in calculation efficiency, and can effectively reduce the distribution cost and improve the space utilization rate of the vehicle through the route planning and vehicle type distribution scheme obtained by the method and the system.
Drawings
Fig. 1 is a flowchart of an order batching and path planning method for a tobacco product stream according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
Fig. 1 shows a flow of an order batching and path planning method for a tobacco product logistics according to an embodiment of the present invention, including:
and S11, generating the order transportation batch according to the order transportation batch generation flow.
The execution subject of the method can be a cloud server.
In an embodiment of the present specification, the cloud server generates an order transportation batch for the sent order according to an order transportation batch process.
And S12, distributing the vehicle types for the order transportation batch according to the vehicle type distribution process and judging whether an order group with the maximum vehicle carrying capacity exists in the order transportation batch.
In the embodiment of the present description, the cloud server may allocate the vehicle types to the order transportation batch according to the vehicle type allocation flow, and since the situation that the order group in the order transportation batch is greater than the current actual maximum vehicle carrying capacity may occur in the order, after the vehicle type allocation is finished, the cloud server needs to determine whether the order group greater than the maximum vehicle carrying capacity exists.
And S13, if the order group with the maximum vehicle carrying capacity exists, splitting and adjusting the order transport batches according to the distribution scheme adjustment process and judging whether the order group with the maximum vehicle carrying capacity exists in the order transport batches again.
In the embodiment of the present specification, the cloud server splits and adjusts the order transportation batch according to the distribution scheme adjustment process, and determines the adjusted order transportation batch again.
And S14, if no order group larger than the maximum vehicle carrying capacity exists, outputting an order transportation batch and vehicle type distribution scheme.
In the embodiment of the present specification, when there is no order group greater than the maximum vehicle carrying capacity, the cloud server determines that all order groups are completely allocated and all meet the actual vehicle conditions, and then sends out an order transportation batch and a vehicle type allocation scheme, and starts to leave the factory.
As a preferred embodiment, the "generating an order shipping batch according to the order shipping batch generating process" specifically includes: generating an order group according to the destination and the departure point; arranging the order groups in an ascending order according to the earliest cut-off time of the orders in the order groups to obtain an order group set to be distributed; performing two-point combination on all order renters with the quality smaller than a first preset value in the order group to be distributed to obtain a temporary transportation batch; combining the two points, and then combining the three points of the order groups still smaller than a second preset value to obtain a transportation batch; after the two points are combined, a order group smaller than a second preset value does not exist, and the temporary transportation batch is used as a transportation batch; deleting the order groups which form the transportation batch and updating the order group set to be distributed; and repeating the order combining steps until no order can be combined.
In the embodiment of the present specification, the first preset value may be 12 tons, and the second preset value may be 10 tons. Orders with the same starting point and destination are combined together to form an order group, and all orders are subjected to the operation, so that all orders are contained in the order group. And arranging the order groups in an ascending order according to the earliest cut-off time of the orders in the order groups to obtain an order group set to be distributed. Three point consolidation specifically, two selected order sets are combined and sorted with other remaining order sets, respectively, to form a plurality of sequences, of which the cost savings are calculated for the feasible order sets. And finally, taking a combination result with the largest cost saving as an order transportation batch, and deleting the formed transportation batch. In the merging process at this stage, it is also necessary to check whether each order in the order transportation batch meets the order arrival time constraint in the merging process, and to check whether the total mass in the merged order group is less than the maximum vehicle load. And a plurality of sequencing schemes exist in the combined sequencing, so that the cost is saved, ascending sequencing is performed according to the latest arrival time sequence of each order group in the sequencing, and if the latest arrival time is also the same, ascending sequencing is performed according to the order placing time, so that the transport lots are obtained.
As a preferred embodiment, "two-point combination" specifically includes: combining all the uncombined order groups pairwise and then reordering to form a plurality of sequences; calculating cost savings for the set of orders in the feasible sequence; and combining the orders with the largest cost saving as the combined order transportation batch.
In the embodiment of the present specification, when two points are combined, two groups of all uncombined order sets need to be combined to adjust the order of each order set, so as to form a plurality of sequences, and for the feasible order sets therein, the cost is saved by calculation; and finally, taking the combined order group with the largest cost saving as a combined order transportation batch. In the merging process, whether each order in the order transport batch meets the order arrival time constraint or not needs to be checked, and whether the total mass in the combined order group is smaller than the maximum vehicle load or not needs to be checked. And comparing the order arrival time with the latest order arrival time by using the empirical arrival time for the order arrival time constraint inspection, and passing the inspection if the empirical arrival time is less than the latest order arrival time, or not passing the inspection. The empirical arrival time is equal to the departure time plus the transit time, which is equal to the transit distance divided by the vehicle's empirical speed, and the waiting-to-unload time.
As a preferred embodiment, "distributing vehicle types for order transportation batches according to a vehicle type distribution process" specifically includes: acquiring order transportation batches with the weight less than or equal to the maximum vehicle loading capacity in all order transportation batches; after all order transportation batches which do not exceed the maximum vehicle loading capacity are arranged according to the ascending order of batch transportation capacity, vehicles are arranged according to the ascending order of transportation capacity; sequentially distributing vehicles with the vehicle type capacity larger than the transport batch capacity and the closest value to the transport batch capacity for each order transport batch according to the order transport batch sequence; deleting the distributed vehicles and order transportation batches; and repeating the distribution steps until all the transportation batches are distributed.
In the embodiment of the specification, the cloud server acquires all transportation batches with the weight less than or equal to the maximum vehicle loading amount; arranging all order transportation batches which do not exceed the maximum vehicle loading capacity according to the ascending order of batch transportation capacity; the vehicles are arranged in an ascending order according to the transportation volume, specifically, the vehicles are arranged from small to large according to the transportation volume of the vehicles, and the vehicles with the same transportation volume are arranged in an ascending order according to the vehicle numbers. And sequentially selecting vehicles with the vehicle type capacity larger than the transport batch capacity and the closest numerical value for each transport batch according to the order transport batch sequence, taking out the transport batches sequentially, searching the vehicles in the transport vehicles in sequence, and directly allocating the transport batches to the vehicle type when finding the vehicle with the first transport capacity larger than the transport batch. Deleting the distributed vehicles and transport batches; and repeating the previous steps until all the transport batches are distributed.
As a preferred embodiment, "if there is an order group greater than the maximum vehicle carrying capacity, performing split adjustment on the order transportation batch according to the distribution scheme adjustment process, and re-determining whether there is an order group greater than the maximum vehicle carrying capacity in the order transportation batch" specifically includes: acquiring all order transportation batches with the transportation batch weight larger than the maximum vehicle loading capacity, and arranging the order transportation batches in a descending order according to the batch transportation capacity; acquiring the information of the residual vehicle resources, and arranging the information of the residual vehicle resources in a descending order according to the vehicle loading capacity; splitting the overweight batches according to the arranged sequence, wherein the minimum vehicle transportation quantity in the splitting process is a first preset value; vehicle type distribution is carried out on the split order transportation batch again; and repeating the steps until all overweight batch vehicle types are distributed.
In the embodiment of the specification, the cloud server takes all transportation batches with the weight larger than the maximum vehicle loading amount, and arranges the transportation batches in a descending order according to the batch transportation amount; and acquiring the information of the vehicle resources left after the vehicle type distribution is finished, and arranging the vehicle resources in a descending order according to the vehicle loading capacity, specifically, arranging the left vehicles from large to small according to the vehicle transportation capacity, and arranging the vehicles with the same transportation capacity in an ascending order according to the vehicle numbers. Splitting the overweight batches according to the sequence, ensuring that the transportation capacity of the smallest split vehicle is 12 tons in the splitting process, specifically, sequentially taking out the overweight batches, searching the vehicles in the transportation vehicles according to the sequence, distributing the vehicles to the batches when the searched transportation capacity of the vehicles is less than the weight of the batches, designing the actual loading capacity of the vehicles as the vehicle capacity, updating the unallocated transportation capacity in the transportation batches, and reducing the actual loading capacity of the previous distributed vehicle model if the residual transportation capacity is less than 1.2 tons so that the residual transportation capacity is equal to 1.2 tons. And if the residual transport capacity is larger than 1.2 tons, continuing to distribute according to the sequence. Optimizing vehicle type distribution, updating vehicle and batch information, specifically, for a vehicle type with good transportation batch distribution, updating a vehicle type with a low loading rate according to the actual loading capacity of the vehicle type according to the method (2.4), and updating the vehicle and batch information. And repeating the steps until all the overweight transport batch vehicle types are distributed.
Furthermore, those skilled in the art will appreciate that while some embodiments herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the claims, any of the claimed embodiments may be used in any combination.
Those of ordinary skill in the art will understand that: the above embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same, and although the present invention is described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: it is possible to modify the solutions described in the above embodiments or to substitute some or all of the technical features of the embodiments, without departing from the scope of the present invention as defined in the claims.
Claims (3)
1. A method for batch and path planning of orders of tobacco product logistics, comprising:
generating an order transportation batch according to an order transportation batch generation process;
distributing vehicle types for the order transportation batches according to a vehicle type distribution flow and judging whether order groups larger than the maximum vehicle carrying capacity exist in the order transportation batches or not;
if the order group with the maximum vehicle carrying capacity exists, splitting and adjusting the order transport batches according to a distribution scheme adjusting process and judging whether the order group with the maximum vehicle carrying capacity exists in the order transport batches again;
if the order group larger than the maximum vehicle carrying capacity does not exist, outputting the order carrying batch and vehicle type distribution scheme;
the "generating an order transportation batch according to the order transportation batch generation process" specifically includes:
generating an order group according to the destination and the starting point;
arranging the order groups in an ascending order according to the earliest cut-off time of the orders in the order groups to obtain an order group set to be distributed;
performing two-point combination on all order groups to be distributed, wherein the centralized quality of the order groups to be distributed is smaller than a first preset value, and acquiring temporary transportation batches;
combining the two points, and then combining the three points of the order groups still smaller than a second preset value to obtain a transportation batch;
after the two points are combined, a order group smaller than a second preset value does not exist, and the temporary transportation batch is used as a transportation batch;
deleting the order group which forms the transportation batch and updating the order group set to be distributed;
repeating the order combining steps until no order can be combined;
the "two-point combination" specifically includes:
combining all the non-merged order groups pairwise and then reordering to form a plurality of sequences;
calculating a cost savings for the available orders in the sequence;
and taking the order group with the largest cost saving as a combined order transportation batch.
2. The method as claimed in claim 1, wherein the step of allocating vehicle types for the order transportation batch according to vehicle type allocation flow specifically comprises:
acquiring an order transportation batch with the weight less than or equal to the maximum vehicle loading capacity in all the order transportation batches;
after all the order transport batches which do not exceed the maximum vehicle loading capacity are arranged according to the ascending order of batch transport volume, arranging the vehicles according to the ascending order of transport volume;
sequentially distributing vehicles with vehicle type capacity larger than the transport batch capacity and closest in value for each order transport batch according to the order transport batch sequence;
deleting the allocated vehicle and the order transportation batch;
and repeating the distribution step until all the order transportation batches are distributed.
3. The method as claimed in claim 1, wherein the step of splitting and adjusting the ordered transportation batch according to the distribution plan adjustment process and re-determining whether there is an order group with a maximum vehicle carrying capacity in the ordered transportation batch if there is an order group with a maximum vehicle carrying capacity includes:
acquiring the order transportation batches with the weight larger than the maximum vehicle loading capacity of all transportation batches, and arranging the order transportation batches in a descending order according to the batch transportation capacity;
acquiring the information of the residual vehicle resources, and arranging the information of the residual vehicle resources in a descending order according to the vehicle loading capacity;
splitting the overweight batches according to the arranged sequence, wherein the minimum vehicle transportation volume in splitting is a first preset value;
vehicle type distribution is carried out on the split order transportation batch again;
repeating the step of obtaining the order transportation batches with the weight of all the transportation batches larger than the maximum vehicle loading capacity, and arranging the order transportation batches in a descending order according to the batch transportation capacity; acquiring the information of the residual vehicle resources, and arranging the information of the residual vehicle resources in a descending order according to the vehicle loading capacity; splitting the overweight batches according to the arranged sequence, wherein the minimum vehicle transportation volume in splitting is a first preset value; and the step of vehicle type distribution is carried out again on the order transportation batch after the order transportation is split until all overweight batch vehicle types are distributed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010519914.4A CN111695732B (en) | 2020-06-09 | 2020-06-09 | Order batching and path planning method for tobacco finished product logistics |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010519914.4A CN111695732B (en) | 2020-06-09 | 2020-06-09 | Order batching and path planning method for tobacco finished product logistics |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111695732A CN111695732A (en) | 2020-09-22 |
| CN111695732B true CN111695732B (en) | 2022-07-26 |
Family
ID=72480005
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010519914.4A Active CN111695732B (en) | 2020-06-09 | 2020-06-09 | Order batching and path planning method for tobacco finished product logistics |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111695732B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112396375B (en) * | 2020-11-18 | 2022-06-21 | 江苏满运物流信息有限公司 | Delivery method and device, storage medium and electronic device |
| CN114219403A (en) * | 2021-12-17 | 2022-03-22 | 佛山市海天调味食品股份有限公司 | B2B order splitting method, device and storage medium |
| CN117522247A (en) * | 2024-01-05 | 2024-02-06 | 四川宽窄智慧物流有限责任公司 | Vehicle type distribution method and system for cross-regional orders |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103729753A (en) * | 2014-01-16 | 2014-04-16 | 浙江中烟工业有限责任公司 | Three-stage matching tobacco distribution method based on transportation scheduling |
| CN107491836A (en) * | 2017-08-10 | 2017-12-19 | 上海汽车集团股份有限公司 | A kind of distribution method of order, device and electronic equipment |
| CN108647810A (en) * | 2018-04-19 | 2018-10-12 | 安吉汽车物流股份有限公司 | The distribution method and device of order shipment, computer-readable medium |
| CN109299810A (en) * | 2018-08-08 | 2019-02-01 | 西南交通大学 | A kind of goods stock stowage method |
| CN110009272A (en) * | 2019-02-21 | 2019-07-12 | 深圳市北斗智能科技有限公司 | More strategies parallel logistic resources dispatching method and relevant apparatus |
| CN110070237A (en) * | 2019-05-07 | 2019-07-30 | 卓集送信息科技（武汉）有限公司 | Cargo distribution calculation method based on goods delivery point, measurement of cargo and vehicle |
| CN110189077A (en) * | 2019-05-20 | 2019-08-30 | 华南理工大学 | A kind of multistage vehicle and goods matching method considering Three-dimensional Packing constraint |
| CN110348679A (en) * | 2019-06-03 | 2019-10-18 | 菜鸟智能物流控股有限公司 | Logistics processing method and device, electronic equipment and storage medium |
| CN110390409A (en) * | 2018-04-17 | 2019-10-29 | 北京京东尚科信息技术有限公司 | The determination method, apparatus and computer readable storage medium of distribution project |
| CN110659839A (en) * | 2019-09-29 | 2020-01-07 | 杭州货天下物流科技有限公司 | Intelligent logistics stowage scheduling method |
| CN111062674A (en) * | 2020-01-07 | 2020-04-24 | 北京建筑大学 | Logistics order high-dimensional sparse clustering sorting method |
| CN111174803A (en) * | 2020-01-07 | 2020-05-19 | 众能联合数字技术有限公司 | Logistics single-splicing route planning method and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080306795A1 (en) * | 2007-06-05 | 2008-12-11 | Ho William P C | Transportation management processes and systems |
-
2020
- 2020-06-09 CN CN202010519914.4A patent/CN111695732B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103729753A (en) * | 2014-01-16 | 2014-04-16 | 浙江中烟工业有限责任公司 | Three-stage matching tobacco distribution method based on transportation scheduling |
| CN107491836A (en) * | 2017-08-10 | 2017-12-19 | 上海汽车集团股份有限公司 | A kind of distribution method of order, device and electronic equipment |
| CN110390409A (en) * | 2018-04-17 | 2019-10-29 | 北京京东尚科信息技术有限公司 | The determination method, apparatus and computer readable storage medium of distribution project |
| CN108647810A (en) * | 2018-04-19 | 2018-10-12 | 安吉汽车物流股份有限公司 | The distribution method and device of order shipment, computer-readable medium |
| CN109299810A (en) * | 2018-08-08 | 2019-02-01 | 西南交通大学 | A kind of goods stock stowage method |
| CN110009272A (en) * | 2019-02-21 | 2019-07-12 | 深圳市北斗智能科技有限公司 | More strategies parallel logistic resources dispatching method and relevant apparatus |
| CN110070237A (en) * | 2019-05-07 | 2019-07-30 | 卓集送信息科技（武汉）有限公司 | Cargo distribution calculation method based on goods delivery point, measurement of cargo and vehicle |
| CN110189077A (en) * | 2019-05-20 | 2019-08-30 | 华南理工大学 | A kind of multistage vehicle and goods matching method considering Three-dimensional Packing constraint |
| CN110348679A (en) * | 2019-06-03 | 2019-10-18 | 菜鸟智能物流控股有限公司 | Logistics processing method and device, electronic equipment and storage medium |
| CN110659839A (en) * | 2019-09-29 | 2020-01-07 | 杭州货天下物流科技有限公司 | Intelligent logistics stowage scheduling method |
| CN111062674A (en) * | 2020-01-07 | 2020-04-24 | 北京建筑大学 | Logistics order high-dimensional sparse clustering sorting method |
| CN111174803A (en) * | 2020-01-07 | 2020-05-19 | 众能联合数字技术有限公司 | Logistics single-splicing route planning method and system |
Non-Patent Citations (1)
| Title |
|---|
| 配送中心的配送策略探讨;张洋;《中国优秀硕士学位论文集》;20051231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111695732A (en) | 2020-09-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111695732B (en) | Order batching and path planning method for tobacco finished product logistics | |
| CN109345161B (en) | Value flow-oriented distribution order dispatching method | |
| Pundoor et al. | Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost | |
| JP2021106036A (en) | Method, device, and system for creating delivery plan for delivery vehicle | |
| CN110659839A (en) | Intelligent logistics stowage scheduling method | |
| CN106156961B (en) | Vehicle scheduling method and device | |
| Liu et al. | Novel multi-objective resource allocation and activity scheduling for fourth party logistics | |
| CN110245890A (en) | Kinds of goods method for sorting and kinds of goods sorting system | |
| US7991634B2 (en) | Vehicle transport load optimization | |
| CN106803136A (en) | A kind of fresh dispatching real-time optimization method based on genetic algorithm | |
| CN109902990A (en) | A kind of supply chain logistics distribution routing planning system | |
| Oesterle et al. | Exact method for the vehicle routing problem with mixed linehaul and backhaul customers, heterogeneous fleet, time window and manufacturing capacity | |
| JP6027666B1 (en) | Delivery route rearrangement system | |
| CN108549978A (en) | A kind of method and system of the safe goods stock of allotment | |
| CN112149925A (en) | Warehousing task automatic allocation method and device, and warehousing management method and system | |
| KR20160070699A (en) | Method of designing vehicle delivery routes by setting zones | |
| Naumov et al. | Model of the delivery routes forming process as a service provided by forwarding companies | |
| CN112801484B (en) | Material distribution scheduling method and system considering batching errors | |
| CN112801336B (en) | Freight regulation and control method for combined collage | |
| Setiani et al. | Optimizing delivery route by applying milkrun method | |
| CN113128924B (en) | Cargo scheduling method, apparatus and computer readable storage medium | |
| Rizkya et al. | Design of Distribution Routes Using Saving Matrix Method to Minimize Transportation Cost | |
| CN112070425B (en) | Dispatching method of stock system based on multi-layer shuttle and double-speed chain | |
| JP6621142B2 (en) | Delivery route rearrangement system | |
| CN112085477A (en) | Logistics supply chain management system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |