CN109299810A - A kind of goods stock stowage method - Google Patents
A kind of goods stock stowage method Download PDFInfo
- Publication number
- CN109299810A CN109299810A CN201810894034.8A CN201810894034A CN109299810A CN 109299810 A CN109299810 A CN 109299810A CN 201810894034 A CN201810894034 A CN 201810894034A CN 109299810 A CN109299810 A CN 109299810A
- Authority
- CN
- China
- Prior art keywords
- address
- cluster
- train number
- shipping
- addresses
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (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)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of goods stock stowage method, including obtaining a delivery operation batch, obtaining distribution vehicle useful load threshold value, determine and execute the train number quantity of delivery operation batch, determine the prestowage scheme of delivery operation batch and carry out prestowage.Wherein it is determined that prestowage scheme, all shipping addresses including needing to dispense delivery operation batch carry out sub-clustering, match a train number for each address cluster and determine the optimal distribution route of the matched train number of address cluster.The beneficial effects of the present invention are, the order for goods of dispatching needed for being goods stock Proper Match according to mathematical model, it is rationally loaded according to the distribution route that intelligent algorithm is planned and dispenses cargo, solves the problems such as unreasonable caused repetition handling of prestowage scheme, detour transport and distribution time is long, dispatching efficiency is improved, distribution cost is reduced.
Description
Technical field
The present invention relates to logistics technology, especially a kind of goods stock stowage method.
Background technique
With the development being newly sold, the demand of city distribution is quicklyd increase and increasingly complexity, multiple spot dispatching become normality.?
In actual delivery operation, the considerations of for scale and benefit, generally require disposably to concentrate a fairly large number of order for goods, then
Arrange multiple train numbers that cargo is delivered to corresponding destination respectively as required.Unreasonable stowage method, can be due to repeating to fill
Unload, detour transport the problems such as cause dispense efficiency reduce and increased costs.
Summary of the invention
The object of the present invention is to provide a kind of goods stock stowage methods to reduce distribution cost to promote dispatching efficiency.
Realize that the technical solution of the object of the invention is as follows:
A kind of goods stock stowage method, including
Step 1: obtaining a delivery operation batch；
Step 2: obtaining distribution vehicle useful load threshold value；
Step 3: determining that the train number quantity for executing delivery operation batch, the train number quantity are the whole of delivery operation batch
After the cargo total weight of order for goods is divided by distribution vehicle useful load threshold value, more than or equal to the smallest positive integral of its quotient；
Step 4: determine the prestowage scheme of delivery operation batch, including
Step 41, all shipping addresses for delivery operation batch being needed to dispense carry out sub-clustering, and the quantity of cluster is equal to train number
Quantity, including
Step 411, cluster center is determined, including
Function of setting objectives is
Constraint condition is
Zij,hj={ 0,1 }, i ∈ N, j ∈ M；
Wherein, N={ 1,2 ..., n } is the serial number set of all shipping addresses；M is the serial number set at alternative cluster center；dij
It indicates from shipping address i to the distance of cluster center j, wiIndicate that shipping address is the cargo total weight of i；ZijFor 0-1 variable, indicate
The corresponding relationship of shipping address and cluster center indicates that shipping address i belongs to the corresponding cluster of cluster center j when it is 1；hjFor 0-1
Variable, when it is 1, expression point j is cluster center；P is the quantity at cluster center；Q is distribution vehicle useful load threshold value；α is to load
Rate；
Above-mentioned mathematical model is solved, obtained optimal solution is p cluster center, i.e., all hj=1 corresponding point j；
Step 412, the address cluster where each shipping address, i.e., more each shipping address to each cluster center are determined
Distance dij, the cluster corresponding to the nearest cluster center is then the address cluster where the shipping address；
Step 42, a train number is matched for each address cluster, i.e., it is corresponding that specified a train number dispenses an address cluster
All order for goods；
Step 43, the optimal distribution route of the matched train number of address cluster is determined, including
Step 431, the matched address cluster of the train number is added in the address of setting out of train number；
Step 432, the mutual distance between the two-address address Cu Neiliang is obtained；
Step 433, it solves using address of setting out as the minimal path of all addresses in the traversal address cluster of starting point, is then address
The optimal distribution route of the matched train number of cluster；
Step 5: according to the optimal distribution route of train number, with the sequencing of shipping address, according to last in, first out, principle is filled
Carry the cargo of the corresponding order for goods of each shipping address in matched address cluster.
Further, in the step 411, the serial number set M at alternative cluster center is the serial number set N of all shipping addresses
Subset, i.e. M ∈ N.
Further, in the step 411, distance d of the shipping address i to cluster center jijIt is the ground determined by electronic map
The distance of shortest traffic route between location i and address j.
Further, in the step 411, distance d of the shipping address i to cluster center jijIt is the ground determined by electronic map
The distance of the shortest traffic route of running time between location i and address j.
Further, in the step 432, the mutual distance between the two-address Cu Neiliang of address is determined by electronic map
The distance of shortest traffic route between two two-addresses.
Further, in the step 432, the mutual distance between the two-address Cu Neiliang of address is determined by electronic map
The distance of the shortest traffic route of running time between two two-addresses.
Further, the step 431 replacement are as follows: by train number set out address and termination address that the train number is added is matched
Address cluster；Step 433 replacement are as follows: solve using address of setting out as starting point, using termination address as in the traversal address cluster of terminal
The minimal path of all addresses is then the optimal distribution route of the matched train number of address cluster.
The beneficial effects of the present invention are the cargo of dispatching needed for being goods stock Proper Match according to mathematical model is ordered
It is single, cargo is rationally loaded and dispensed according to the distribution route that intelligent algorithm is planned, solves the unreasonable caused weight of prestowage scheme
Reassemble unload, detour transport and distribution time it is long the problems such as, improve dispatching efficiency, reduce distribution cost.
Detailed description of the invention
Fig. 1 is the prestowage scheme schematic diagram of the embodiment of the present invention.
Specific embodiment
The present invention is further explained in the light of specific embodiments.
Step 1, order for goods is obtained.Order for goods includes O/No., Description of Goods, quantity of goods, order weight, hair
The information such as goods people, consignee and shipping address.
The corresponding unique O/No. of one order for goods, includes one or more cargos, an order for goods is only
There is a shipping address, once obtaining order for goods, just can determine that O/No., shipping address, order weight, consignor, receipts
Goods people.
Order weight is the total weight of all cargos in order for goods, takes the greater in physical weight and volume weight.
Step 2, multiple order for goods are constructed as a delivery operation batch by preset order aggregation rules.
For the scale and benefit for realizing delivery operation, multiple orders are constructed as an order by preset order aggregation rules
Set, forms a delivery operation batch.
If delivery operation batch sets weight threshold, order collection can be set up according only to the weight of order for goods
It closes.
If not considering the weight threshold of delivery operation batch, it would be possible that preset order aggregation rules further include:
By the interception time aggregate order of order；
By the regional ensemble order of the shipping address of order；
By consignor's aggregate order of order；
By consignee's aggregate order of order.
When setting up a delivery operation batch, can optionally an information therein or two information above combination,
To set up order set.
It is of course also possible to the weight threshold of delivery operation batch both considered, it is further contemplated that setting up order according to order information
Set.
Step 3, distribution vehicle useful load threshold value is obtained.
Carload threshold value be vehicle approval weight, or meet transportation regulations vehicle loading weight it is upper
Limit value.
Step 4, it is filled according to the cargo total weight of the included entire cargo order of current delivery operation batch and distribution vehicle
Carrying capacity threshold value determines train number quantity needed for executing this batch delivery operation.
The calculation of required train number quantity is that the cargo with the included entire cargo order of current delivery operation batch is total
Weight takes the smallest positive integral more than or equal to its quotient divided by distribution vehicle useful load threshold value.
Step 5, the prestowage scheme of present lot order for goods is determined.
Step 51, the whole shipping addresses for present lot delivery operation being needed to dispense carry out sub-clustering, and the quantity of cluster is equal to
Train number quantity, including；
Step 511, cluster center is determined.
Based on distance criterion, sub-clustering is carried out to whole shipping addresses of this batch delivery operation.The general mathematics of the problem
Model is as follows:
Objective function is
Constraint condition is
Zij,hj={ 0,1 }, i ∈ N, j ∈ M (5)
Wherein, N={ 1,2 ..., n } is the serial number set of all shipping addresses；M is the serial number set at alternative cluster center；dij
It indicates from shipping address i to the distance of cluster center j, wiIndicate the cargo total weight of shipping address i；ZijFor 0-1 variable, indicate to receive
The corresponding relationship of goods address and cluster center indicates that shipping address i belongs to the corresponding cluster of cluster center j when it is 1；hjFor 0-1 change
Amount indicates that point j is chosen as cluster center when it is 1；P is the quantity at cluster center；Q is the useful load threshold value of distribution vehicle；α is
Charging ratio.
Formula (2) guarantees that each shipping address only corresponds to a cluster center；Formula (3) ensures that the quantity at cluster center is p；Formula (4)
The cargo total amount for defining the corresponding order for goods of each address cluster is not more than distribution vehicle useful load threshold value, and each address cluster
The cargo total amount of corresponding order for goods is not less than the α of distribution vehicle useful load preset threshold, that is, guarantees the loading of each train number
Rate is more than or equal to α；Formula (5) ZijAnd hjFor 0-1 variable.
Train number quantity needed for the quantity at cluster center is equal to execution this batch delivery operation.
Wherein, the address at alternative cluster center is randomly assigned.
As an improvement reducing the calculating time of algorithm in order to reduce the search range at cluster center, limiting in alternative cluster
Heart serial number set M belongs to shipping address serial number set M, i.e. M ∈ N, this shows that cluster center can only be from the receipts of this batch delivery operation
Goods selects in address.
dijValue be by electronic map obtain address i and address j between most short traffic route distance.
As an improvement considering for dispatching timeliness, dijValue be then by electronic map obtain address i and address j
Between the required shortest traffic route of running time distance.
Here immune optimization algorithm is used, the optimal solution of above-mentioned mathematical model is solved, obtains p cluster center, i.e., all hj
=1 corresponding point j is cluster center.
It can also be asked using genetic algorithm, particle swarm algorithm, neural network algorithm, simulated annealing or k- mean algorithm
The optimal solution of above-mentioned mathematical model is solved, cluster center is found.
Step 512, the cluster where each shipping address is determined.
Compare each shipping address to the distance at each cluster center, cluster representated by the cluster center nearest apart from shipping address is
For the cluster of this shipping address ownership.
Step 52, a train number is matched for each address cluster.
A train number is matched for each address cluster, that is, it is corresponding all to respectively specify that a train number dispenses an address cluster
Order for goods.
Step 53, optimal distribution route is planned for each train number.
Step 531, the corresponding address cluster of the train number is added in the address of setting out of each train number.
Step 532, obtain electronic map, obtained according to electronic map between the two-address each address Cu Neiliang it is mutual away from
From the mutual distance between two two-addresses is the distance of most short traffic route between two addresses.
As an improvement considering that the mutual distance between two two-addresses is that required running time is most short for dispatching timeliness
Traffic route distance.
Step 533, to each address cluster, intelligent algorithm is used to solve using address of setting out as in the traversal current cluster of starting point
The minimal path of all addresses and the distance for calculating minimal path.
It is equal to solution one as the minimal path that starting point solves all addresses in traversal current cluster to set out address to go out
Send out the traveling salesman problem that address is starting point.
It,, will in step 531 if each train number is required to return to specified place after completing delivery operation in step 53
Each train number set out address and the corresponding address cluster of the train number is added in termination address, each address cluster is adopted in step 533
It is solved with intelligent algorithm using address of setting out as starting point, using termination address as the shortest path of all addresses in the traversal current cluster of terminal
Line and the distance for calculating minimal path.
Above-mentioned intelligent algorithm successively obtains the optimal dispatching of each train number using the ant colony optimization for solving traveling salesman problem
Route.The optimal distribution route of each train number can also be solved using Hybrid Particle Swarm or simulation degeneration algorithm.
Step 6, according to the optimal distribution route of train number, with the sequencing of shipping address, according to last in, first out, principle is filled
Carry the cargo of the corresponding order for goods of each shipping address in matched address cluster.
After completing step 5, a prestowage scheme can be listed, as shown in Figure 1.Prestowage scheme includes required train number quantity,
The order for goods that each train number needs dispense, the distribution route of each train number, the loading sequence of each dispensed cargo of train number, it
Cargo is completed according to prestowage scheme afterwards to load and dispense.
Claims (7)
1. a kind of goods stock stowage method, which is characterized in that including
Step 1: obtaining a delivery operation batch；
Step 2: obtaining distribution vehicle useful load threshold value；
Step 3: determining that the train number quantity for executing delivery operation batch, the train number quantity are the entire cargo of delivery operation batch
After the cargo total weight of order is divided by distribution vehicle useful load threshold value, more than or equal to the smallest positive integral of its quotient；
Step 4: determine the prestowage scheme of delivery operation batch, including
Step 41, all shipping addresses for delivery operation batch being needed to dispense carry out sub-clustering, and the quantity of cluster is equal to train number quantity,
Including
Step 411, cluster center is determined, including
Function of setting objectives is
Constraint condition is
Zij,hj={ 0,1 }, i ∈ N, j ∈ M；
Wherein, N={ 1,2 ..., n } is the serial number set of all shipping addresses；M is the serial number set at alternative cluster center；dijIt indicates
From shipping address i to the distance of cluster center j, wiIndicate that shipping address is the cargo total weight of i；ZijFor 0-1 variable, indicate to receive
The corresponding relationship of address and cluster center indicates that shipping address i belongs to the corresponding cluster of cluster center j when it is 1；hjFor 0-1 change
Amount, when it is 1, expression point j is cluster center；P is the quantity at cluster center；Q is distribution vehicle useful load threshold value；α is charging ratio；
Above-mentioned mathematical model is solved, obtained optimal solution is p cluster center, i.e., all hj=1 corresponding point j；
Step 412, the address cluster where each shipping address, i.e., distance of more each shipping address to each cluster center are determined
dij, the cluster corresponding to the nearest cluster center is then the address cluster where the shipping address；
Step 42, a train number is matched for each address cluster, i.e., it is corresponding all that specified a train number dispenses an address cluster
Order for goods；
Step 43, the optimal distribution route of the matched train number of address cluster is determined, including
Step 431, the matched address cluster of the train number is added in the address of setting out of train number；
Step 432, the mutual distance between the two-address address Cu Neiliang is obtained；
Step 433, it solves using address of setting out as the minimal path of all addresses in the traversal address cluster of starting point, is then address cluster
The optimal distribution route for the train number matched；
Step 5: according to the optimal distribution route of train number, with the sequencing of shipping address, according to last in, first out, principle loaded
The cargo of the corresponding order for goods of each shipping address in the address cluster matched.
2. a kind of goods stock stowage method as described in claim 1, which is characterized in that in the step 411, in alternative cluster
The serial number set M of the heart is the subset of the serial number set N of all shipping addresses, i.e. M ∈ N.
3. a kind of goods stock stowage method as described in claim 1, which is characterized in that in the step 411, shipping address
Distance d of the i to cluster center jijIt is the distance of the shortest traffic route between the address i determined by electronic map and address j.
4. a kind of goods stock stowage method as described in claim 1, which is characterized in that in the step 411, shipping address
Distance d of the i to cluster center jijIt is the shortest traffic route of running time between the address i determined by electronic map and address j
Distance.
5. a kind of goods stock stowage method as described in claim 1, which is characterized in that in the step 432, in the cluster of address
Mutual distance between two two-addresses is the distance of the shortest traffic route between two two-addresses determined by electronic map.
6. a kind of goods stock stowage method as described in claim 1, which is characterized in that in the step 432, in the cluster of address
Mutual distance between two two-addresses be the shortest traffic route of running time between two two-addresses determined by electronic map away from
From.
7. a kind of goods stock stowage method as described in claim 1, which is characterized in that step 431 replacement are as follows: by vehicle
It is secondary to set out address and the matched address cluster of the train number is added in termination address；Step 433 replacement are as follows: solve with address of setting out
For starting point, using termination address as terminal traversal address cluster in all addresses minimal path, then be the matched train number of address cluster
Optimal distribution route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810894034.8A CN109299810A (en) | 2018-08-08 | 2018-08-08 | A kind of goods stock stowage method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810894034.8A CN109299810A (en) | 2018-08-08 | 2018-08-08 | A kind of goods stock stowage method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109299810A true CN109299810A (en) | 2019-02-01 |
Family
ID=65168050
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810894034.8A Pending CN109299810A (en) | 2018-08-08 | 2018-08-08 | A kind of goods stock stowage method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109299810A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110009272A (en) * | 2019-02-21 | 2019-07-12 | 深圳市北斗智能科技有限公司 | More strategies parallel logistic resources dispatching method and relevant apparatus |
| CN110322044A (en) * | 2019-04-12 | 2019-10-11 | 成都服务生科技有限公司 | A kind of luggage dispatched between multiple means of transports fetches and delivers method |
| CN110348678A (en) * | 2019-05-31 | 2019-10-18 | 口碑(上海)信息技术有限公司 | Dispense the scheduling of resource and resource regulating method and device for vegetable dispatching |
| CN110619424A (en) * | 2019-08-06 | 2019-12-27 | 暨南大学 | Transportation and distribution optimizing system |
| CN111160690A (en) * | 2019-11-15 | 2020-05-15 | 杭州拼便宜网络科技有限公司 | Vehicle loading planning method and device and storage medium |
| CN111695732A (en) * | 2020-06-09 | 2020-09-22 | 武汉问道信息技术有限公司 | Order batching and path planning method for tobacco finished product logistics |
| CN112241809A (en) * | 2020-09-29 | 2021-01-19 | 湖北省烟草公司十堰市公司 | Cigarette logistics distribution line optimization method |
| CN112288376A (en) * | 2020-11-20 | 2021-01-29 | 杭州拼便宜网络科技有限公司 | Cargo loading scheme generation method, device and equipment and readable storage medium |
| CN112465280A (en) * | 2019-09-09 | 2021-03-09 | 顺丰科技有限公司 | Task adjusting method and device, server and computer readable storage medium |
| CN112906949A (en) * | 2021-02-02 | 2021-06-04 | 满帮信息咨询有限公司 | Route planning method and device, electronic equipment and readable storage medium |
| CN112990813A (en) * | 2021-02-09 | 2021-06-18 | 北京橙心无限科技发展有限公司 | Method and device for determining navigation time |
| CN113762829A (en) * | 2020-08-05 | 2021-12-07 | 北京京东振世信息技术有限公司 | Distribution method and device of ordered goods and computer readable medium |
| CN113808426A (en) * | 2020-06-11 | 2021-12-17 | 丰田自动车株式会社 | Auxiliary device and method for conveying materials |
| CN116109026A (en) * | 2023-04-11 | 2023-05-12 | 北京新发地农产品网络配送中心有限责任公司 | Fresh distribution route planning method, system, equipment and readable storage medium |
| CN116523430A (en) * | 2022-09-06 | 2023-08-01 | 西安电子科技大学广州研究院 | Routing method for pick-up and delivery vehicle meeting last-in first-out constraint |
| CN116596282A (en) * | 2023-07-17 | 2023-08-15 | 山东聚航物流发展有限公司 | Logistics vehicle traffic scheduling method and system based on Internet of things system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120209787A1 (en) * | 2011-02-14 | 2012-08-16 | Transit Solutions, Llc | Computerized system and method for matching freight vehicles and loads |
| CN104616070A (en) * | 2015-01-15 | 2015-05-13 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution route |
| CN104809549A (en) * | 2015-04-02 | 2015-07-29 | 常州奥迈信息技术有限公司 | Scheduling method of goods vehicle planned driving lines |
| CN204731828U (en) * | 2015-05-14 | 2015-10-28 | 北京速派得物流信息技术有限公司 | A kind of goods for the network shipping of same city-vehicle match system |
| CN105868843A (en) * | 2016-03-22 | 2016-08-17 | 南京邮电大学 | Route planning method oriented to goods delivery |
| CN107093037A (en) * | 2016-02-18 | 2017-08-25 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus that order distribution information is provided |
| CN107341638A (en) * | 2017-07-04 | 2017-11-10 | 醴陵市绿源商贸有限公司 | A kind of loose unpacked material allocator based on internet |
-
2018
- 2018-08-08 CN CN201810894034.8A patent/CN109299810A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120209787A1 (en) * | 2011-02-14 | 2012-08-16 | Transit Solutions, Llc | Computerized system and method for matching freight vehicles and loads |
| CN104616070A (en) * | 2015-01-15 | 2015-05-13 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution route |
| CN104809549A (en) * | 2015-04-02 | 2015-07-29 | 常州奥迈信息技术有限公司 | Scheduling method of goods vehicle planned driving lines |
| CN204731828U (en) * | 2015-05-14 | 2015-10-28 | 北京速派得物流信息技术有限公司 | A kind of goods for the network shipping of same city-vehicle match system |
| CN107093037A (en) * | 2016-02-18 | 2017-08-25 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus that order distribution information is provided |
| CN105868843A (en) * | 2016-03-22 | 2016-08-17 | 南京邮电大学 | Route planning method oriented to goods delivery |
| CN107341638A (en) * | 2017-07-04 | 2017-11-10 | 醴陵市绿源商贸有限公司 | A kind of loose unpacked material allocator based on internet |
Non-Patent Citations (1)
| Title |
|---|
| 张文华: "基于节约里程法的物流配送路线优化", 《物流工程与管理》 * |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110009272A (en) * | 2019-02-21 | 2019-07-12 | 深圳市北斗智能科技有限公司 | More strategies parallel logistic resources dispatching method and relevant apparatus |
| CN110322044A (en) * | 2019-04-12 | 2019-10-11 | 成都服务生科技有限公司 | A kind of luggage dispatched between multiple means of transports fetches and delivers method |
| CN110322044B (en) * | 2019-04-12 | 2023-08-29 | 赵志为 | Luggage taking and delivering method for dispatching among multiple transport means |
| CN110348678A (en) * | 2019-05-31 | 2019-10-18 | 口碑(上海)信息技术有限公司 | Dispense the scheduling of resource and resource regulating method and device for vegetable dispatching |
| CN110619424A (en) * | 2019-08-06 | 2019-12-27 | 暨南大学 | Transportation and distribution optimizing system |
| CN110619424B (en) * | 2019-08-06 | 2022-10-25 | 暨南大学 | Transportation and distribution optimizing system |
| CN112465280A (en) * | 2019-09-09 | 2021-03-09 | 顺丰科技有限公司 | Task adjusting method and device, server and computer readable storage medium |
| CN111160690A (en) * | 2019-11-15 | 2020-05-15 | 杭州拼便宜网络科技有限公司 | Vehicle loading planning method and device and storage medium |
| CN111695732B (en) * | 2020-06-09 | 2022-07-26 | 武汉问道信息技术有限公司 | Order batching and path planning method for tobacco finished product logistics |
| CN111695732A (en) * | 2020-06-09 | 2020-09-22 | 武汉问道信息技术有限公司 | Order batching and path planning method for tobacco finished product logistics |
| CN113808426A (en) * | 2020-06-11 | 2021-12-17 | 丰田自动车株式会社 | Auxiliary device and method for conveying materials |
| CN113762829A (en) * | 2020-08-05 | 2021-12-07 | 北京京东振世信息技术有限公司 | Distribution method and device of ordered goods and computer readable medium |
| CN113762829B (en) * | 2020-08-05 | 2024-09-20 | 北京京东振世信息技术有限公司 | Distribution method and device of order goods and computer readable medium |
| CN112241809A (en) * | 2020-09-29 | 2021-01-19 | 湖北省烟草公司十堰市公司 | Cigarette logistics distribution line optimization method |
| CN112288376A (en) * | 2020-11-20 | 2021-01-29 | 杭州拼便宜网络科技有限公司 | Cargo loading scheme generation method, device and equipment and readable storage medium |
| CN112906949A (en) * | 2021-02-02 | 2021-06-04 | 满帮信息咨询有限公司 | Route planning method and device, electronic equipment and readable storage medium |
| CN112990813A (en) * | 2021-02-09 | 2021-06-18 | 北京橙心无限科技发展有限公司 | Method and device for determining navigation time |
| CN116523430A (en) * | 2022-09-06 | 2023-08-01 | 西安电子科技大学广州研究院 | Routing method for pick-up and delivery vehicle meeting last-in first-out constraint |
| CN116109026A (en) * | 2023-04-11 | 2023-05-12 | 北京新发地农产品网络配送中心有限责任公司 | Fresh distribution route planning method, system, equipment and readable storage medium |
| CN116596282A (en) * | 2023-07-17 | 2023-08-15 | 山东聚航物流发展有限公司 | Logistics vehicle traffic scheduling method and system based on Internet of things system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109299810A (en) | A kind of goods stock stowage method | |
| CN112270135B (en) | Intelligent distribution method, device and equipment for logistics dispatching and storage medium | |
| CN113139678B (en) | Unmanned plane-vehicle combined distribution path optimization method and model construction method thereof | |
| CN109002902B (en) | Regional multi-stage fresh agricultural product dynamic vehicle path optimization method | |
| CN102542395B (en) | A kind of emergency materials dispatching system and computing method | |
| CN107918849B (en) | Intelligent dispatching device and method for electric logistics trucks | |
| CN109726863A (en) | A kind of material-flow method and system of multiple-objection optimization | |
| CN107194513A (en) | A kind of optimization method for solving full channel logistics distribution | |
| US20210254988A1 (en) | Delivery optimization | |
| CN103699982A (en) | Logistics distribution control method with soft time windows | |
| CN105404941A (en) | Intelligent optimization method and system for logistics transportation mode and path | |
| CN107358326A (en) | A kind of bicycle multiple spot dispenses circuitry processing method | |
| CN113919772B (en) | Time-varying vehicle path planning method and system with time window | |
| CN105069523A (en) | Delivery vehicle scheduling method with time limitation | |
| CN111428931A (en) | Logistics distribution line planning method, device, equipment and storage medium | |
| Liu et al. | A scheduling decision support model for minimizing the number of drones with dynamic package arrivals and personalized deadlines | |
| Wang et al. | Optimal delivery route planning for a fleet of heterogeneous drones: A rescheduling-based genetic algorithm approach | |
| CN114399246A (en) | Intelligent delivery scheduling system | |
| CN108764780A (en) | A kind of food delivery scheduling system and its food delivery dispatching method | |
| CN115358658A (en) | Inventory path optimal scheduling method for LPG drop-and-drop transportation | |
| CN113610453B (en) | Container transportation path selection method combining multiple transportation modes | |
| CN114580750A (en) | Improved analysis method of regional vehicle path planning dynamic analysis model | |
| CN116843259A (en) | Delivery optimization method for continuous repeated replenishment of gas station in push delivery mode | |
| Tekil-Ergün et al. | Solving a hybrid mixed fleet heterogeneous dial-a-ride problem in delay-sensitive container transportation | |
| CN108197879B (en) | Multi-mode passenger and cargo co-transportation method and 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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190201 |