CN106997494A - Logistics distribution planing method, Logistics Distribution Method and its device - Google Patents
Logistics distribution planing method, Logistics Distribution Method and its device Download PDFInfo
- Publication number
- CN106997494A CN106997494A CN201710176222.2A CN201710176222A CN106997494A CN 106997494 A CN106997494 A CN 106997494A CN 201710176222 A CN201710176222 A CN 201710176222A CN 106997494 A CN106997494 A CN 106997494A
- Authority
- CN
- China
- Prior art keywords
- dispatching
- tree
- timeliness
- distribution
- vehicle
- 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/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
-
- 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
-
- 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)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (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 provides a kind of logistics distribution planing method, Logistics Distribution Method and its device.Logistics distribution planing method includes：State generation dispatching timeliness tree based on the road network being made up of each dispatching node, the dispatching node includes home-delivery center and one or more dispatching websites, the management of distribution center distribution vehicle；According to the goods amount and the data relevant with the vehicle at the home-delivery center at each dispatching website, dispatching circuit is planned using the dispatching timeliness tree；And distribution vehicle scheduling scheme is produced according to the dispatching circuit.Such scheme can efficiently realize that logistics distribution is planned.
Description
Technical field
The present invention relates to data processing field, and in particular to a kind of logistics distribution planing method, Logistics Distribution Method and its
Device.
Background technology
In logistics transportation field of today, substantial amounts of biography station business is there is, i.e., by vehicle by goods from home-delivery center
The dispatching website of its radiation is transported in defined timeliness.Passing station business needs the vehicle scheduling of reasonable arrangement home-delivery center,
The need for efficiently meeting transport.
For this reason, it may be necessary to a kind of logistics distribution planing method, Logistics Distribution Method and its device for solving the above problems.
The content of the invention
In order to solve the above problems, the embodiments of the invention provide a kind of logistics distribution planing method, Logistics Distribution Method
And its device, to realize efficient logistics distribution.
According to the scheme of the present invention there is provided a kind of method planned for logistics distribution, including：
State generation dispatching timeliness tree based on the road network being made up of each dispatching node, the dispatching node includes matching somebody with somebody
Send center and one or more dispatching websites, the management of distribution center distribution vehicle；
According to the goods amount and the data relevant with the vehicle at the home-delivery center at each dispatching website, matched somebody with somebody using described
Timeliness tree is sent to plan dispatching circuit；And
Distribution vehicle scheduling scheme is produced according to the dispatching circuit.
According to another aspect of the present invention there is provided a kind of method for logistics distribution, including：
Plan to perform logistics distribution using the logistics distribution generated according to the above method.
According to another aspect of the present invention there is provided a kind of device planned for logistics distribution, including：
Timeliness tree generation module, for the state generation dispatching timeliness based on the road network being made up of each dispatching node
Tree, the dispatching node includes home-delivery center and one or more dispatching websites, the management of distribution center distribution vehicle；
Distribution routing planning module：For according to each dispatching website at goods amount and with the vehicle at the home-delivery center
Relevant data, dispatching circuit is planned using the dispatching timeliness tree；
Scheduling scheme performing module, for producing distribution vehicle scheduling scheme according to the dispatching circuit；And
Performing module is dispensed, for carrying out logistics distribution according to the distribution vehicle scheduling scheme.
According to another aspect of the present invention there is provided a kind of device for logistics distribution, including：
Storage device, for storing the logistics distribution planning generated according to above-mentioned logistics distribution planing method；And
Performing module is dispensed, for carrying out logistics distribution according to the distribution vehicle scheduling scheme.
According to another aspect of the present invention there is provided a kind of device planned for logistics distribution, including：
Memory, for storing executable instruction；And
Processor, the executable instruction stored for performing in memory, to perform above-mentioned logistics distribution planing method.
According to another aspect of the present invention there is provided a kind of device for logistics distribution, including：
Memory, for storing executable instruction；And
Processor, the executable instruction stored for performing in memory, to perform above-mentioned Logistics Distribution Method.
According to another aspect of the present invention there is provided a kind of memory devices carried thereon by computer program, when by
Described in computing device during computer program, the computer program makes the above-mentioned logistics distribution planning side of the computing device
Method.
According to another aspect of the present invention there is provided a kind of memory devices carried thereon by computer program, when by
Described in computing device during computer program, the computer program makes the above-mentioned Logistics Distribution Method of the computing device.
Such scheme plans logistics distribution using timeliness tree, can be reduced by the increase and decrease and change of the node of timeliness tree
Possible website combination in logistics legal, and the distribution vehicle of home-delivery center is take into account, realize efficient logistics distribution rule
Draw and logistics distribution.
Brief description of the drawings
It is by the detailed description carried out below in conjunction with the accompanying drawings to invention, the features described above and advantage of making the present invention is brighter
It is aobvious, wherein：
Fig. 1 shows the outline flowchart of the method for being used for logistics distribution planning according to embodiments of the present invention；
Fig. 2 shows the outline flowchart of the method for logistics distribution according to embodiments of the present invention；
Fig. 3 shows the brief block diagram of the device for being used for logistics distribution planning according to embodiments of the present invention；
Fig. 4 shows the brief block diagram of the device for logistics distribution according to embodiments of the present invention；
Fig. 5 shows a kind of schematic diagram implemented of logistics distribution planning according to embodiments of the present invention；
Fig. 6 shows a kind of schematic diagram implemented of timeliness tree generation according to embodiments of the present invention；And
Fig. 7 shows the schematic block diagram of the exemplary hardware arrangement of device according to embodiments of the present invention.
Embodiment
Below, the preferred embodiment of the present invention is described in detail with reference to the accompanying drawings.In the accompanying drawings, although be shown in different accompanying drawings
In, but identical reference is for representing identical or similar component.For clarity and conciseness, comprising known to herein
The detailed description of function and structure will be omitted, to avoid making subject of the present invention unclear.
Embodiments in accordance with the present invention provide a kind of method planned for logistics distribution.As shown in figure 1, this method bag
Include：
Step S110, the state generation dispatching timeliness tree based on the road network being made up of each dispatching node, dispenses node
Including home-delivery center and one or more dispatching websites, management of distribution center distribution vehicle；
Step S120, according to the goods amount and the data relevant with the vehicle at home-delivery center at each dispatching website, is utilized
Timeliness tree is dispensed to plan dispatching circuit；And
Step S130, distribution vehicle scheduling scheme is produced according to dispatching circuit.
In some instances, the state of road network includes：Each dispatching node between route timeliness data and each match somebody with somebody
The unloading time seen off a little.In these examples, when the state based on the road network being made up of each dispatching node generates dispatching
Effect tree includes：
According to the route timeliness data and the unloading time of each dispatching website between each dispatching node, with dispatching
The heart is root node, using each dispatching website as intermediate node and leaf node generation dispatching timeliness tree, using as during the dispatching
Effect tree.
Those skilled in the art can generate any form using any method used in present in this area or future
Dispatching timeliness tree, as long as the circuit timeliness that the timeliness tree generated can reflect between each website.In some instances, match somebody with somebody
Timeliness tree is sent to meet following one or more：
Dispatching circuit is formed from the root node of dispatching timeliness tree to the path of leaf node,
In every dispatching circuit, the time from root node to other nodes in dispatching circuit meets other described nodes
Timeliness of arriving at a station,
The website corresponding to each node in every dispatching circuit is not repeated, and
For the dispatching circuit comprising multiple websites, from dispatching circuit any website at block, from root node to
The path of any website remains as effectively dispatching circuit.
In some instances, the state of road network may be from real-time road data, or can be according to history road conditions statistics
It is derived from.
In some instances, the data relevant with the vehicle at home-delivery center may include model data, according to each dispatching
Goods amount and the data relevant with the vehicle at home-delivery center at website, plan that dispatching circuit can be wrapped using timeliness tree is dispensed
Include：
For dispatching timeliness tree in have most numbers of plies each distribution route, preferentially distribute its total Cargo be no more than currently may be used
The dispatching circuit of maximum vehicle.
In the case, it can be wrapped for the preferential distribution that in dispatching timeliness tree there is each distribution route of most numbers of plies to carry out
Include step：
(b) the currently available maximum vehicle of home-delivery center is determined；
(c) distribution route in dispatching timeliness tree with most numbers of plies is found, and according to the goods amount of each dispatching website
Data calculate the total Cargo of found dispatching circuit；And
It is found dispatching circuit distribution if the total Cargo (d) calculated is no more than currently available maximum vehicle
Currently available maximum vehicle, removes in dispatching timeliness tree and is assigned with involved by the dispatching circuit of currently available maximum vehicle
Node and the children tree nodes that are connected with involved node, to generate new dispatching timeliness tree, and during with new dispatching
Effect tree performs step (c) as the dispatching timeliness tree.
In other examples, for example need preferential distribution to exist to need to use at home-delivery center it is currently available most
During the dispatching circuit of the dispatching website of large-scale vechicle, according to the goods amount and relevant with the vehicle at home-delivery center at each dispatching website
Data, planned using timeliness tree is dispensed dispatching circuit may include：
For having each distribution route of most numbers of plies in dispatching timeliness tree, preferential distribution, which exists, needs to use home-delivery center
The dispatching circuit of dispatching website and its total Cargo no more than currently available maximum vehicle of the currently available maximum vehicle at place.
In the case, it can be wrapped for the preferential distribution that in dispatching timeliness tree there is each distribution route of most numbers of plies to carry out
Include：
(a) the goods amount data based on model data and each dispatching website, determine the minimum needed for each dispatching website
Vehicle；
(b) the currently available maximum vehicle of home-delivery center is determined；
(c) find dispatching timeliness tree in have most numbers of plies distribution route in the presence of need to use it is currently available most
The distribution route of the dispatching website of large-scale vechicle, and according to the found dispatching circuit of the goods amount data calculating of each dispatching website
Total Cargo；And
It is found dispatching circuit distribution if the total Cargo (d) calculated is no more than currently available maximum vehicle
Currently available maximum vehicle, removes in dispatching timeliness tree and is assigned with involved by the dispatching circuit of currently available maximum vehicle
Node and the children tree nodes that are connected with involved node, to generate new dispatching timeliness tree, and during with new dispatching
Effect tree performs step (c) as the dispatching timeliness tree.
In the case, may be used also for the preferential distribution that in dispatching timeliness tree there is each distribution route of most numbers of plies to carry out
Including：
If (g) not needing the dispatching website of currently available maximum vehicle and the vehicle of currently available maximum vehicle
Quantity still has residue, and the currently available secondary large-scale vechicle at home-delivery center is performed into step as currently available maximum vehicle
(b)-(f), and remaining preceding maximum vehicle is considered as to the part that preferentially distributed in currently available maximum vehicle.
In the case, the method shown in Fig. 1 may also include：
Only when distributing currently available maximum vehicle every time for dispatching circuit, by from for global distribution routing planning
First dispatching timeliness tree in remove be assigned with currently available maximum vehicle dispense circuit involved by node and with institute
The children tree nodes that the node being related to is connected, generate updated first dispatching timeliness tree,
Wherein, before every time for new currently available maximum vehicle planning dispatching circuit, by the dispatching timeliness
Tree is defined as the copy of the first newest dispatching timeliness tree.
In addition, in some instances, under above two different situations, for there are most numbers of plies in dispatching timeliness tree
The preferential distribution that each distribution route is carried out may also include：
If the total Cargo (e) calculated exceedes currently available maximum vehicle, last is removed in dispatching timeliness tree
The leaf node of layer, to form new dispatching timeliness tree, and dispenses timeliness tree and performs using new dispatching timeliness tree as described
Step (c)-(d)；And
If (f) currently available maximum vehicle has been allocated, step (b)-(e) is performed.
In some instances, under above two different situations, can be preferably in step (d) the whole dispatching used time it is most short
Dispatching circuit distribution distribution vehicle.
Always according to The embodiment provides a kind of method for logistics distribution.As shown in Fig. 2 this method bag
Include：Step 210, the logistics distribution generated using the method according to Fig. 1 is planned to perform logistics distribution.
Fig. 3 shows the dress planned for logistics distribution corresponding with the method shown in Fig. 1 according to embodiments of the present invention
Put.The device includes：
Timeliness tree generation module 310, when generating dispatching for the state based on the road network being made up of each dispatching node
Effect tree, dispatching node includes home-delivery center and one or more dispatching websites, management of distribution center distribution vehicle；
Distribution routing planning module 320：For according to each dispatching website at goods amount and with the vehicle at home-delivery center
Relevant data, dispatching circuit is planned using timeliness tree is dispensed；And
Scheduling scheme performing module 330, for producing distribution vehicle scheduling scheme according to dispatching circuit.
In some instances, the state of road network may include：Each dispatching node between route timeliness data and each
Dispense the unloading time of website.
Now, timeliness tree generation module 310 can be additionally used in：According to each dispatching node between route timeliness data and
The unloading time of each dispatching website, using home-delivery center as root node, using each dispatching website as intermediate node and leaf node
Dendrogram is generated, to be used as the dispatching timeliness tree.
Those skilled in the art can generate any form using any method used in present in this area or future
Dispatching timeliness tree, as long as the circuit timeliness that the timeliness tree generated can reflect between each website.In some instances, match somebody with somebody
Timeliness tree is sent to meet following one or more：
Dispatching circuit is formed from the root node of dispatching timeliness tree to the path of leaf node,
In every dispatching circuit, the time from root node to other nodes in dispatching circuit meets other described nodes
Timeliness of arriving at a station,
The website corresponding to each node in every dispatching circuit is not repeated, and
For the dispatching circuit comprising multiple websites, from dispatching circuit any website at block, from root node to
The path of any website remains as effectively dispatching circuit.
Device shown in Fig. 3 may also include：Road network state determining module 340, for from real-time road data or history road
Condition statistics derives the state of road network.
In some instances, the data relevant with the vehicle at home-delivery center may include model data, distribution routing planning
Module 320 can be additionally used in：
For dispatching timeliness tree in have most numbers of plies each distribution route, preferentially distribute its total Cargo be no more than currently may be used
The dispatching circuit of maximum vehicle.
In the case, distribution routing planning module 320 can be additionally used in：
(b) the currently available maximum vehicle of home-delivery center is determined；
(c) distribution route in dispatching timeliness tree with most numbers of plies is found, and according to the goods amount of each dispatching website
Data calculate the total Cargo of found dispatching circuit；And
It is found dispatching circuit distribution if the total Cargo (d) calculated is no more than currently available maximum vehicle
Currently available maximum vehicle, removes in dispatching timeliness tree and is assigned with involved by the dispatching circuit of currently available maximum vehicle
Node and the children tree nodes that are connected with involved node, to generate new dispatching timeliness tree, and during with new dispatching
Effect tree performs operation (c) as the dispatching timeliness tree.
In other examples, for example need preferential distribution to exist to need to use at home-delivery center it is currently available most
During the dispatching circuit of the dispatching website of large-scale vechicle, distribution routing planning module 320 can be additionally used in：
For having each distribution route of most numbers of plies in dispatching timeliness tree, preferential distribution, which exists, needs to use home-delivery center
The dispatching circuit of dispatching website and its total Cargo no more than currently available maximum vehicle of the currently available maximum vehicle at place.
In the case, distribution routing planning module 320 can be additionally used in：
(a) the goods amount data based on model data and each dispatching website, determine the minimum needed for each dispatching website
Vehicle；
(b) the currently available maximum vehicle of home-delivery center is determined；
(c) find dispatching timeliness tree in have most numbers of plies distribution route in the presence of need to use it is currently available most
The distribution route of the dispatching website of large-scale vechicle, and according to the found dispatching circuit of the goods amount data calculating of each dispatching website
Total Cargo；And
It is found dispatching circuit distribution if the total Cargo (d) calculated is no more than currently available maximum vehicle
Currently available maximum vehicle, removes in dispatching timeliness tree and is assigned with involved by the dispatching circuit of currently available maximum vehicle
Node and the children tree nodes that are connected with involved node, to generate new dispatching timeliness tree, and during with new dispatching
Effect tree performs operation (c) as the dispatching timeliness tree.
In the case, distribution routing planning module 320 can be additionally used in：
If (g) not needing the dispatching website of currently available maximum vehicle and the vehicle of currently available maximum vehicle
Quantity still has residue, and the currently available secondary large-scale vechicle at home-delivery center is performed into operation as currently available maximum vehicle
(b)-(f), and remaining preceding maximum vehicle is considered as to the part that preferentially distributed in currently available maximum vehicle.
In the case, distribution routing planning module 320 can be additionally used in：
Only when distributing currently available maximum vehicle every time for dispatching circuit, by from for global distribution routing planning
First dispatching timeliness tree in remove be assigned with currently available maximum vehicle dispense circuit involved by node and with institute
The children tree nodes that the node being related to is connected, generate updated first dispatching timeliness tree,
Wherein, before every time for new currently available maximum vehicle planning dispatching circuit, by the dispatching timeliness
Tree is defined as the copy of the first newest dispatching timeliness tree.
In some instances, under above two different situations, distribution routing planning module 320 can be additionally used in：
If the total Cargo (e) calculated exceedes currently available maximum vehicle, last is removed in dispatching timeliness tree
The leaf node of layer, to form new dispatching timeliness tree, and dispenses timeliness tree and performs using new dispatching timeliness tree as described
Operate (c)-(d)；And
If (f) currently available maximum vehicle has been allocated, operation (b)-(e) is performed.
In some instances, under above two different situations, distribution routing planning module 320 can be additionally used in：In operation
(c) it is preferably most short dispatching circuit distribution distribution vehicle of whole dispatching used time in.
Fig. 4 shows the device for logistics distribution corresponding with the method shown in Fig. 2 according to embodiments of the present invention.Should
Device includes：
Storage device 410, the logistics distribution planning for storing the method generation according to Fig. 1；And
Performing module 420 is dispensed, for carrying out logistics distribution according to distribution vehicle scheduling scheme.
In above-mentioned Fig. 1 into the scheme shown in Fig. 4, as shown in figure 5, the embodiment of the present invention carries out logistics based on timeliness tree
Allocation plan, and in view of the measurement data and the goods amount data of each dispatching website at home-delivery center, it is thus efficient to realize
Logistics distribution is planned.
Describe that timeliness tree in the method shown in Fig. 1 to Fig. 4 generates below with reference to Fig. 6 implements.Need explanation
, Fig. 6 illustrate only to be implemented to one kind of method provided in an embodiment of the present invention, and is not considered as to the present invention
The limitation for the method that embodiment is provided.For example, implementing environment different, the situation shown in Fig. 6 may also be different.
First, can be based on the road network being made up of each dispatching node (for example, home-delivery center for some dispatching ripple
With the circuit between dispatching website, dispatching website and dispatching website) shape volume data generation home-delivery center dispense website to each
Timeliness tree.The state of the road network can for example including：Route timeliness data and each dispatching website between each dispatching node
Unloading time timeliness data.
The generation of timeliness tree need to meet following requirement：
1. from root node to the path of last layer of leaf node, as one circuit；
2. the timeliness of arriving at a station of the website will be met in every circuit to the time of each website from root node；
3. the website corresponding to each node in every circuit is not repeated；
If 4. including multiple websites in a circuit, being blocked from arbitrary node, then root node path is returned to still from the node
For active line.
Circuit timeliness data may come from real-time road data, can also be by calculating average timeliness based on historical data
And draw.Timeliness data include comprising it is two-way it is site-to-site between timeliness data and home-delivery center to website timeliness
Data.
Timeliness tree can be used to record all feasible biography station track roads, every passes station track road and comprising one or more can match somebody with somebody
See off a little.A kind of possible method of generation timeliness tree is provided below.
Assuming that the timeliness of arriving at a station from home-delivery center to each website is 2 hours (120 minutes), during the unloading of each website
Length is 20 minutes.It assume that following circuit timeliness table：
Circuit timeliness table
The circuit timeliness between two websites (the first website and the second website) is indicated in above-mentioned circuit timeliness table, its
In, T represents home-delivery center, and A, B, C and D represent each dispatching website.
Timeliness tree shown in Fig. 6 can be drawn according to above-mentioned circuit timeliness table.The generation of the timeliness tree is from top to bottom by root section
Point starts.
1. the 0th layer：It regard home-delivery center (T) as root node；
2. the 1st layer：The dispatching website that home-delivery center (T) is radiated is as the node of first layer, and arrival time is dispatching
Time of the center (T) to each dispatching website；
3. the 2nd layer：Exemplified by dispensing website A, the website not included in the circuit from T to A now be website B, C, D, such as
The website B that fruit slave site A does not include into current line can meet website B timeliness requirement (note：Website A unloading need to be added
Duration), then generate new one layer, and using website B as website A child node, by that analogy；
4. 3-N layers, repeat step 3, untill it can not generate new layer.
It should be noted that the generation method of above-mentioned timeliness tree is only illustrative, those skilled in the art can also use
In this area now or in the future used in any method generate the timeliness tree for example shown in Fig. 6 or the timeliness of other forms
Tree, as long as the circuit timeliness that the timeliness tree generated can reflect between each website.
The generation of dispatching timeliness tree can be as shown in Figure 3 timeliness tree generation module 310 generate.In the timeliness shown in Fig. 6
In tree, the data at each website are indicated in the case of shown dispatching circuit, the arrival time at each website.
Then, institute can be utilized according to the goods amount and the data relevant with the vehicle at home-delivery center at each dispatching website
The dispatching timeliness tree of generation plans dispatching circuit.
In actual example, home-delivery center may have various optional, and quantity differs.The embodiment of the present invention considers
Allocation plan is carried out to such case.It should be noted that the big I for the vehicle being described below is according to actual conditions
Both volume and weights for considering the volume of goods, the weight of goods or goods all consider.For example, for example by statistical number
According to analysis determine logistics in distribution vehicle carriage box volume capacity rather than vehicle load limit to logistics transportation cause limitation
In the case of, the size of vehicle refers to the size of the carriage box volume capacity of distribution vehicle.Or in the opposite case, indicate distribution vehicle
Load limit.The present invention will not be repeated here.
In some embodiments of the invention, circuit can be dispensed based on the planning of timeliness tree by way of iteration, for example
Following examples：
Embodiment one
1. determine maximum vehicle currently available at home-delivery center.
2. finding the circuit of the number of plies at most (i.e. most comprising dispatching website) in timeliness tree, and for example dispensed according to each
The total Cargo of each circuit of the goods amount data statistics of website.
If 3. the circuit of delivered payload capability of the total Cargo without departing from current maximum vehicle can be found, being distributed currently most for the circuit
Large-scale vechicle, while delete the node corresponding to each dispatching website that this circuit includes in timeliness tree, and with these nodes
Related children tree nodes, the timeliness tree after being updated.In this step, if there is a plurality of circuit for meeting condition, preferential choosing
The last leg arrival time most short circuit (that is, whole dispatching used time most short dispatching circuit) is taken to be allocated vehicle, delete
Except node etc. is operated.
If 4. delivered payload capability of the total Cargo of these circuits all beyond current maximum vehicle, is deleted most in timeliness tree
Whole leaf nodes (that is, the most circuit of the number of plies is subtracted one layer) in later layer, the timeliness tree after being updated.
5. still have a residue in the vehicle fleet size of current maximum vehicle, and timeliness tree the number of plies more than 1 when, repeat step 2-4.
6. still have a residue in the vehicle fleet size of current maximum vehicle, and timeliness tree the number of plies equal to 1 when, be current timeliness tree
In dispatching website respectively distribution one car individually dispense.
7., can directly repeat step 1-6 when the vehicle fleet size of current maximum vehicle is without residue.
8. when all dispatching websites have all planned circuit, stop iteration.
In further embodiments, the line with the dispatching website for needing to be transported with current maximum vehicle can preferentially be planned
Road, example embodiment described as follows：
Embodiment two
1. the goods amount data of model data and each dispatching website based on home-delivery center, determine that each dispatching website transport point is needed
Minimum vehicle.
2. replicating current timeliness tree obtains two timeliness trees：Timeliness tree T1 is used for the overall situation, and it is excellent that timeliness tree T2 is only used for needs
The dispatching website first planned.
3. currently available maximum vehicle is determined, and the minimum vehicle for example needed according to each dispatching website transport point determines need
The dispatching website transported with current maximum vehicle, preferential planning herein is with the dispensing station for needing to be transported with current maximum vehicle
The circuit of point.
4. in timeliness tree T2, find the circuit of the number of plies at most (i.e. most comprising dispatching website), it is desirable in these circuits,
The dispatching website with current maximum vehicle transport is needed including at least one, the total Cargo of each circuit is counted.
If 5. the circuit of delivered payload capability of the total Cargo without departing from current maximum vehicle can be found, being distributed currently most for the circuit
Large-scale vechicle, while in timeliness tree T1, T2, deletes the node corresponding to each dispatching website that this circuit is included, and and this
The related children tree nodes of a little nodes, timeliness tree T1, T2 after being updated.In this step, if there is a plurality of condition of meeting
Circuit, it is preferential to choose the last leg arrival time most short circuit (that is, whole dispatching used time most short dispatching circuit) to carry out
Distribute the operation such as vehicle, deletion of node.
If 6. delivered payload capability of the total Cargo of these circuits all beyond current maximum vehicle, in timeliness tree T2, is deleted
Except whole leaf nodes (that is, the most circuit of the number of plies is subtracted into one layer) in last layer, the timeliness tree after being updated
T2。
7. ought current cart vehicle still in need dispatching website, and the vehicle fleet size of current maximum vehicle still has residue
When, and timeliness tree T2 the number of plies be more than 1 when, repeat step 4-6.
8. ought current cart vehicle still in need dispatching website, and the vehicle fleet size of current maximum vehicle still has residue
When, and timeliness tree T2 the number of plies be equal to 1 when, be these dispatching websites respectively distribution one car individually dispense, while delete timeliness
Set the node corresponding to these websites in T1, and the children tree nodes related to these nodes, the timeliness tree T1 updated.
9. when the vehicle fleet size of the dispatching website without the current maximum vehicle of needs, and current maximum vehicle still has residue
When, repeat step 2-8.In step 2-8 repetition, can using current maximum vehicle as the part when previous large-scale vechicle and with
When previous large-scale vechicle enters row major planning as current maximum vehicle.If for example, current 2 tons of maximum vehicle load-carrying, secondary cart
The remaining vehicle of 2 tons of vehicles of load-carrying, then in step 2-8 repetition, can be incorporated to the car of the vehicle of 1 ton of load-carrying by 1 ton of type load-carrying
In, the preferential planning in step 2-8 is carried out using the vehicle of 1 ton of load-carrying as current maximum vehicle.In the preferential planning,
The vehicle of 2 tons of load-carrying can preferentially be distributed.
10. when the dispatching website without the current cart vehicle of needs, and the currently no residue of vehicle fleet size of maximum vehicle
When, can directly repeat step 2-9.
11. when all dispatching websites have all planned circuit, stop iteration.
By above-mentioned iteration, the vehicle that the circuit planned of each whole website can be obtained and distributed for the circuit.
It should be noted that above-mentioned steps are only illustrative, it is not to limit the invention to shown step example.At other
In some embodiments, above-mentioned example step can also be modified.For example, in certain embodiments, even if preferential planning tool
The circuit of the dispatching website in need transported with current maximum vehicle, the above-mentioned differentiation to timeliness tree T1 and T2 may not be must
Want.For another example in some other embodiment, step 7 and 8 can also merge and no longer be finely divided.
After the above step, arrange circuit plan, including dispense website by way of each order, arrival time,
The information such as goods amount and required vehicle, obtains final vehicle scheduling scheme, and can carry out logistics according to the vehicle scheduling scheme
Dispatching.
Logistics distribution programme described in the above embodiment of the present invention can meet the timeliness requirement arrived at a station, also can be one
Determine to reduce the use for passing station vehicle in degree, reach balanced between cost and efficiency.And the method for generation timeliness tree can change
Generation automatic realization, it is to avoid artificial exhaustion is difficult to the shortcoming for being extended to a large amount of websites.
Above-described embodiment is additionally contemplates that the diversity of vehicle and quantity are limited, and considers goods amount, timeliness, vehicle and vehicle
The factor such as vehicle fleet size, can plan as a whole to obtain global preferably vehicle scheduling scheme.
Additionally, it is appreciated that, above-mentioned steps illustrate only for the vehicles dispatching system method compared with simple scenario.Real ring
It there may be more complicated situation in border, and for making the succinct clearly purpose of description of the embodiment of the present invention without showing this
A little complex situations, but teaching and enlightenment based on the embodiment of the present invention, those skilled in the art can also be appointed to above-mentioned steps
What is changed, real using the present invention with according to the goods amount and the data relevant with the vehicle at home-delivery center at each dispatching website
The logistics distribution that the dispatching timeliness tree of example is applied to carry out various modes is planned.The logistics distribution planning of these various modes should include
Within protection scope of the present invention.Similarly, the teaching based on the embodiment of the present invention, those skilled in the art also it is conceivable that
Using other modifications for dispensing the progress logistics distribution planning of timeliness tree, these modifications are same within protection scope of the present invention.
For example, the goods amount for single website exceedes the situation of current maximum vehicle capacity, the website can be considered as to two
Or more website (arrival time between these websites is zero) planned, or using those skilled in the art can
Other any modifications fallen within the scope and spirit of the invention expected.The invention is not restricted to these specific modifications.
For example, although simple in order to describe, explained in the case that such scheme is for single dispatching and single home-delivery center
State, the program can also be applied to multi-logistics center, the scene of many dispatching ripples time, and required modification is only first to match somebody with somebody these
Send center and dispatching ripple to disassemble into multiple independent single home-delivery centers and single dispatching ripple, then be based respectively on such scheme progress
Solve.Certainly, other various forms of modifications also may be present, will not be repeated here.
Although it is also to be noted that having used numeral or letter to carry out step when describing embodiments of the invention
Numbering, but this merely to description on convenience, be not meant to the embodiment of the present invention method must according to numeral or letter
Order perform.For example the step 2 of above-described embodiment two can be performed after step 3, and step 5 and 6 can be performed etc. side by side, this
A little is all that the description of those skilled in the art according to embodiments of the present invention can be readily occurred in, and can fall the protection in the present invention
Within the scope of, it will not be repeated here.
Fig. 7 is to show the block diagram according to the exemplary hardware of Fig. 3 or Fig. 4 shown devices of embodiment of the present disclosure arrangement 500.
The hardware layout includes processor 506 (for example, microprocessor (μ P), digital signal processor (DSP) etc.).Processor 506 can
With the single treatment unit either multiple processing units for the different actions for being performed for flow described herein.Arrangement may be used also
With including for receiving the input block 502 of signal from other entities and for the output list to other entities offer signal
Member 504.Input block 502 and output unit 504 can be arranged to single entities or the entity separated.
In addition, arrangement can include having at least one non-volatile or form of volatile memory readable storage medium storing program for executing
508, e.g. Electrically Erasable Read Only Memory (EEPROM), flash memory, and/or hard disk drive.Readable storage medium storing program for executing
508 include computer program 510, and the computer program 510 includes code/computer-readable instruction, and it is in arrangement 500
Processor 506 allows when performing hardware layout 500 and/or to be performed above for example including the equipment including hardware layout 500
Flow described in conjunction with Figure 2 and its any deformation.
In the case where realizing Fig. 3 shown devices, computer program 510 can be configured with such as computer program mould
The computer program code of block 510A~510C frameworks.Therefore, example during hardware layout 500 is used to implement in such as equipment
In example, the code in the computer program of arrangement 500 includes：Module 510A, for based on being made up of each dispatching node
The state generation dispatching timeliness tree of road network, the dispatching node includes home-delivery center and one or more dispatching websites, described to match somebody with somebody
Send centre management distribution vehicle.Code in computer program also includes：Module 510B, at according to each dispatching website
Goods amount and the data relevant with the vehicle at the home-delivery center, dispatching circuit is planned using the dispatching timeliness tree.Calculate
Code in machine program also includes：Module 510C, for producing distribution vehicle scheduling scheme according to the dispatching circuit.
In the case where realizing Fig. 4 shown devices, computer program 510 can be configured as only having such as computer program
The computer program code of module 510A~510B frameworks.Therefore, use example during hardware layout 500 real in such as equipment
Apply in example, the code in the computer program of arrangement 500 includes：Module 510A, the logistics distribution planning generated for storing.
Code in computer program also includes：Module 510B, for carrying out logistics distribution according to the distribution vehicle scheduling scheme.
Computer program module can substantially perform each action in the flow shown in Fig. 1 or Fig. 2, to simulate
The device shown in Fig. 3 or Fig. 4.In other words, when performing different computer program modules in processor 506, they can be with
Corresponding to the above-mentioned different units in the device shown in Fig. 3 or Fig. 4.
Although being implemented as computer program module above in conjunction with the code means in Fig. 5 the disclosed embodiments, its
Cause hardware layout to perform above in conjunction with the action described by Fig. 1 or Fig. 2 when being performed in processor 506, but alternatively implementing
In example, at least one in the code means can at least be implemented partly as hardware circuit.
Processor can be single cpu (CPU), but it is also possible to including two or more processing units.Example
Such as, processor can include general purpose microprocessor, instruction set processor and/or related chip group and/or special microprocessor (example
Such as, application specific integrated circuit (ASIC)).Processor can also include the onboard storage device for being used to cache purposes.
Computer program can be carried by the computer program product for being connected to processor.Computer program product can be with
Computer-readable medium including being stored thereon with computer program.For example, computer program product can be flash memory, deposit at random
Access to memory (RAM), read-only storage (ROM), EEPROM, and above computer program module can use in an alternative embodiment
The form of memory in UE is distributed in different computer program products.
It should be noted that the technical scheme described in the embodiment of the present invention can any group in the case where not conflicting
Close.
, can be by it in several embodiments provided by the present invention, it should be understood that disclosed method and apparatus
Its mode is realized.Apparatus embodiments described above are only schematical, for example, the division of the unit, is only
A kind of division of logic function, can have other dividing mode, such as when actually realizing：Multiple units or component can be combined, or
Another system is desirably integrated into, or some features can be ignored, or do not perform.In addition, shown or discussed each composition portion
Coupling point each other or direct-coupling or communication connection can be the INDIRECT COUPLINGs of equipment or unit by some interfaces
Or communication connection, can be electrical, machinery or other forms.
The above-mentioned unit illustrated as separating component can be or may not be it is physically separate, it is aobvious as unit
The part shown can be or may not be physical location, you can so that positioned at a place, electricity can be distributed to multiple network lists
In member；Part or all of unit therein can be selected to realize the purpose of this embodiment scheme according to the actual needs.
In addition, each functional unit in various embodiments of the present invention can be fully integrated into a second processing unit,
Can also be each unit individually as a unit, can also two or more units it is integrated in a unit；
Above-mentioned integrated unit can both be realized in the form of hardware, it would however also be possible to employ hardware adds the form of SFU software functional unit real
It is existing.
Above description is only used for realizing embodiments of the present invention, and it should be appreciated by those skilled in the art do not taking off
From any modification or partial replacement of the scope of the present invention, the scope that should belong to the claim of the present invention to limit, because
This, protection scope of the present invention should be defined by the protection domain of claims.
Claims (30)
1. a kind of method planned for logistics distribution, including：
State generation dispatching timeliness tree based on the road network being made up of each dispatching node, the dispatching node is included in dispatching
The heart and one or more dispatching websites, the management of distribution center distribution vehicle；
According to the goods amount and the data relevant with the vehicle at the home-delivery center at each dispatching website, during using the dispatching
Effect is set to plan dispatching circuit；And
Distribution vehicle scheduling scheme is produced according to the dispatching circuit.
2. according to the method described in claim 1, wherein, the state of the road network includes：Route between each dispatching node
The unloading time of timeliness data and each dispatching website,
State generation dispatching timeliness tree based on the road network being made up of each dispatching node includes：According to each dispatching node it
Between route timeliness data and each dispatching website unloading time, using the home-delivery center as root node, with each dispense
Website is intermediate node and leaf node generation dendrogram, to be used as the dispatching timeliness tree.
3. method according to claim 2, wherein, the dispatching timeliness tree meets following one or more：
Formed from the root node of the dispatching timeliness tree to the path of leaf node and dispense circuit,
In every dispatching circuit, the time from root node to other nodes in the dispatching circuit meets other described nodes
Timeliness of arriving at a station,
The website corresponding to each node in every dispatching circuit is not repeated, and
For the dispatching circuit comprising multiple websites, from it is described dispatching circuit any website at block, from root node to
The path of any website remains as effectively dispatching circuit.
4. method according to claim 2, wherein, the state of the road network comes from real-time road data, or according to going through
History road conditions statistics is derived.
5. according to the method described in claim 1, wherein, data relevant with the vehicle at the home-delivery center include vehicle number
According to according to the goods amount and the data relevant with the vehicle at the home-delivery center at each dispatching website, during using the dispatching
Effect is set to plan that dispatching circuit includes：
For having each distribution route of most numbers of plies in the dispatching timeliness tree, preferentially distribute its total Cargo and work as no more than described
The dispatching circuit of preceding available maximum vehicle.
6. method according to claim 5, wherein, for having each dispatching road of most numbers of plies in the dispatching timeliness tree
The preferential distribution that line is carried out includes：
(b) the currently available maximum vehicle of the home-delivery center is determined；
(c) distribution route in the dispatching timeliness tree with most numbers of plies is found, and according to the goods amount of each dispatching website
Data calculate the total Cargo of found dispatching circuit；And
If the total Cargo (d) calculated is no more than the currently available maximum vehicle, by the dispatching circuit found
The currently available maximum vehicle is distributed, is removed in the dispatching timeliness tree and is assigned with the currently available maximum vehicle
Dispatching circuit involved by node and the children tree nodes that are connected with involved node, to generate new dispatching timeliness
Tree, and dispense timeliness tree using the new dispatching timeliness tree as described and perform step (c).
7. according to the method described in claim 1, wherein, data relevant with the vehicle at the home-delivery center include vehicle number
According to according to the goods amount and the data relevant with the vehicle at the home-delivery center at each dispatching website, during using the dispatching
Effect is set to plan that dispatching circuit includes：
For having each distribution route of most numbers of plies in the dispatching timeliness tree, preferential distribution, which exists, needs to use the dispatching
The dispatching website and its total Cargo of the currently available maximum vehicle of center are no more than the currently available maximum vehicle
Dispense circuit.
8. method according to claim 7, wherein, for having each dispatching road of most numbers of plies in the dispatching timeliness tree
The preferential distribution that line is carried out includes：
(a) the goods amount data based on the model data and each dispatching website, determine the minimum needed for each dispatching website
Vehicle；
(b) the currently available maximum vehicle of the home-delivery center is determined；
(c) find described currently available in the presence of needing to use in the distribution route in the dispatching timeliness tree with most numbers of plies
Maximum vehicle dispatching website distribution route, and according to each dispatching website goods amount data calculate found match somebody with somebody line sending
The total Cargo on road；And
If the total Cargo (d) calculated is no more than the currently available maximum vehicle, by the dispatching circuit found
The currently available maximum vehicle is distributed, is removed in the dispatching timeliness tree and is assigned with the currently available maximum vehicle
Dispatching circuit involved by node and the children tree nodes that are connected with involved node, to generate new dispatching timeliness
Tree, and dispense timeliness tree using the new dispatching timeliness tree as described and perform step (c).
9. the method according to claim 6 or 8, wherein, for there is respectively matching somebody with somebody for most numbers of plies in the dispatching timeliness tree
The preferential distribution for sending route to carry out also includes：
If the total Cargo (e) calculated exceedes the currently available maximum vehicle, removed most in the dispatching timeliness tree
The leaf node of later layer, to form new dispatching timeliness tree, and is used as the dispatching timeliness using the new dispatching timeliness tree
Set to perform step (c)-(d)；And
If (f) the currently available maximum vehicle has been allocated, step (b)-(e) is performed.
10. method according to claim 8, wherein, for having each dispatching of most numbers of plies in the dispatching timeliness tree
The preferential distribution that route is carried out also includes：
If (g) not needing the dispatching website and the currently available maximum vehicle of the currently available maximum vehicle
Vehicle fleet size still has residue, regard the currently available secondary large-scale vechicle at the home-delivery center as the currently available most cart
Remaining preceding maximum vehicle is considered as in the currently available maximum vehicle and preferentially divided to perform step (b)-(f) by type
The part matched somebody with somebody.
11. method according to claim 8, in addition to：
Only in currently available maximum vehicle described for dispatching circuit distribution every time, by from for global distribution routing planning
First dispatching timeliness tree in remove be assigned with the currently available maximum vehicle dispense circuit involved by node and
The children tree nodes being connected with involved node, generate updated first dispatching timeliness tree,
Wherein, before every time for new currently available maximum vehicle planning dispatching circuit, by the dispatching timeliness tree really
It is set to the copy of the first newest dispatching timeliness tree.
12. the method according to claim 6 or 8, wherein, it is preferably most short to match somebody with somebody the whole dispatching used time in step (d)
Distribution vehicle is distributed on line sending road.
13. a kind of method for logistics distribution, including：
Plan to perform logistics distribution using the logistics distribution generated according to method any one of claim 1 to 12.
14. a kind of device planned for logistics distribution, including：
Timeliness tree generation module, for the state generation dispatching timeliness tree based on the road network being made up of each dispatching node, institute
Stating dispatching node includes home-delivery center and one or more dispatching websites, the management of distribution center distribution vehicle；
Distribution routing planning module：For according to the goods amount and relevant with the vehicle at the home-delivery center at each dispatching website
Data, plan dispatching circuit using the dispatching timeliness tree；And
Scheduling scheme performing module, for producing distribution vehicle scheduling scheme according to the dispatching circuit.
15. device according to claim 14, wherein, the state of the road network includes：Road between each dispatching node
The unloading time of line timeliness data and each dispatching website,
The timeliness tree generation module is additionally operable to：According to the route timeliness data and each dispensing station between each dispatching node
The unloading time of point, using the home-delivery center as root node, using each dispatching website as intermediate node and leaf node spanning tree
Shape figure, to be used as the dispatching timeliness tree.
16. device according to claim 15, wherein, the dispatching timeliness tree meets following one or more：
Formed from the root node of the dispatching timeliness tree to the path of leaf node and dispense circuit,
In every dispatching circuit, the time from root node to other nodes in the dispatching circuit meets other described nodes
Timeliness of arriving at a station,
The website corresponding to each node in every dispatching circuit is not repeated, and
For the dispatching circuit comprising multiple websites, from it is described dispatching circuit any website at block, from root node to
The path of any website remains as effectively dispatching circuit.
17. device according to claim 15, in addition to：Road network state determining module, for from real-time road data or
History road conditions statistics derives the state of the road network.
18. device according to claim 14, wherein, the data relevant with the vehicle at the home-delivery center include vehicle
Data, the distribution routing planning module is additionally operable to：
For having each distribution route of most numbers of plies in the dispatching timeliness tree, preferentially distribute its total Cargo and work as no more than described
The dispatching circuit of preceding available maximum vehicle.
19. device according to claim 18, wherein, the distribution routing planning module is additionally operable to：
(b) the currently available maximum vehicle of the home-delivery center is determined；
(c) distribution route in the dispatching timeliness tree with most numbers of plies is found, and according to the goods amount of each dispatching website
Data calculate the total Cargo of found dispatching circuit；And
If the total Cargo (d) calculated is no more than the currently available maximum vehicle, by the dispatching circuit found
The currently available maximum vehicle is distributed, is removed in the dispatching timeliness tree and is assigned with the currently available maximum vehicle
Dispatching circuit involved by node and the children tree nodes that are connected with involved node, to generate new dispatching timeliness
Tree, and dispense timeliness tree using the new dispatching timeliness tree as described and perform operation (c).
20. device according to claim 14, wherein, the data relevant with the vehicle at the home-delivery center include vehicle
Data, the distribution routing planning module is additionally operable to：
For having each distribution route of most numbers of plies in the dispatching timeliness tree, preferential distribution, which exists, needs to use the dispatching
The dispatching website and its total Cargo of the currently available maximum vehicle of center are no more than the currently available maximum vehicle
Dispense circuit.
21. device according to claim 20, wherein, the distribution routing planning module is additionally operable to：
(a) the goods amount data based on the model data and each dispatching website, determine the minimum needed for each dispatching website
Vehicle；
(b) the currently available maximum vehicle of the home-delivery center is determined；
(c) find described currently available in the presence of needing to use in the distribution route in the dispatching timeliness tree with most numbers of plies
Maximum vehicle dispatching website distribution route, and according to each dispatching website goods amount data calculate found match somebody with somebody line sending
The total Cargo on road；And
If the total Cargo (d) calculated is no more than the currently available maximum vehicle, by the dispatching circuit found
The currently available maximum vehicle is distributed, is removed in the dispatching timeliness tree and is assigned with the currently available maximum vehicle
Dispatching circuit involved by node and the children tree nodes that are connected with involved node, to generate new dispatching timeliness
Tree, and dispense timeliness tree using the new dispatching timeliness tree as described and perform operation (c).
22. the device according to claim 19 or 21, wherein, the distribution routing planning module is additionally operable to：
If the total Cargo (e) calculated exceedes the currently available maximum vehicle, removed most in the dispatching timeliness tree
The leaf node of later layer, to form new dispatching timeliness tree, and is used as the dispatching timeliness using the new dispatching timeliness tree
Set to perform operation (c)-(d)；And
If (f) the currently available maximum vehicle has been allocated, operation (b)-(e) is performed.
23. device according to claim 21, wherein, the distribution routing planning module is additionally operable to：
If (g) not needing the dispatching website and the currently available maximum vehicle of the currently available maximum vehicle
Vehicle fleet size still has residue, regard the currently available secondary large-scale vechicle at the home-delivery center as the currently available most cart
Remaining preceding maximum vehicle is considered as in the currently available maximum vehicle and preferentially divided to perform operation (b)-(f) by type
The part matched somebody with somebody.
24. device according to claim 21, wherein, the distribution routing planning module is additionally operable to：
Only in currently available maximum vehicle described for dispatching circuit distribution every time, by from for global distribution routing planning
First dispatching timeliness tree in remove be assigned with the currently available maximum vehicle dispense circuit involved by node and
The children tree nodes being connected with involved node, generate updated first dispatching timeliness tree,
Wherein, before every time for new currently available maximum vehicle planning dispatching circuit, by the dispatching timeliness tree really
It is set to the copy of the first newest dispatching timeliness tree.
25. the device according to claim 19 or 21, wherein, the distribution routing planning module is additionally operable to：In operation (c)
In be preferably most short dispatching circuit distribution distribution vehicle of whole dispatching used time.
26. a kind of device for logistics distribution, including：
Storage device, the logistics distribution planning for storing the method generation according to any one of claim 1 to 12；With
And
Performing module is dispensed, for carrying out logistics distribution according to the distribution vehicle scheduling scheme.
27. a kind of device planned for logistics distribution, including：
Memory, for storing executable instruction；And
Processor, the executable instruction stored for performing in memory, to perform according to any one of claim 1 to 12 institute
The method stated.
28. a kind of device for logistics distribution, including：
Memory, for storing executable instruction；And
Processor, the executable instruction stored for performing in memory, to perform method according to claim 13.
29. a kind of memory devices carried thereon by computer program, when the computer program as described in computing device, institute
Stating computer program makes method of the computing device according to any one of claim 1 to 12.
30. a kind of memory devices carried thereon by computer program, when the computer program as described in computing device, institute
Stating computer program makes computing device method according to claim 13.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710176222.2A CN106997494A (en) | 2017-03-22 | 2017-03-22 | Logistics distribution planing method, Logistics Distribution Method and its device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710176222.2A CN106997494A (en) | 2017-03-22 | 2017-03-22 | Logistics distribution planing method, Logistics Distribution Method and its device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106997494A true CN106997494A (en) | 2017-08-01 |
Family
ID=59431882
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710176222.2A Pending CN106997494A (en) | 2017-03-22 | 2017-03-22 | Logistics distribution planing method, Logistics Distribution Method and its device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106997494A (en) |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107705043A (en) * | 2017-10-31 | 2018-02-16 | 顺丰科技有限公司 | A kind of Bus stop planning method, apparatus, equipment, storage medium |
| CN107944598A (en) * | 2017-10-31 | 2018-04-20 | 苏宁云商集团股份有限公司 | A kind of logistics route collocation method and system |
| CN108268038A (en) * | 2018-01-19 | 2018-07-10 | 广东美的智能机器人有限公司 | The dispatching method and system of multiple mobile robot |
| CN108573362A (en) * | 2018-04-10 | 2018-09-25 | 合肥美的智能科技有限公司 | The logistics and distribution management method and apparatus and system of self-service equipment |
| CN108921428A (en) * | 2018-06-28 | 2018-11-30 | 上海中通吉网络技术有限公司 | The dispatching method and device of logistics vehicles |
| CN109034690A (en) * | 2018-07-05 | 2018-12-18 | 北京智行者科技有限公司 | Method is sent in a kind of collaboration with charge free |
| CN109409585A (en) * | 2018-10-08 | 2019-03-01 | 北京海纳川汽车部件股份有限公司 | The dispatching method and device of logistics vehicles |
| CN109583802A (en) * | 2017-09-29 | 2019-04-05 | 北京京东尚科信息技术有限公司 | Unmanned distribution network system and dispatching method |
| CN109978213A (en) * | 2017-12-28 | 2019-07-05 | 北京京东尚科信息技术有限公司 | A kind of task path planning method and device |
| CN110135665A (en) * | 2018-02-02 | 2019-08-16 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus that dynamic divides dispatching region |
| CN110363607A (en) * | 2018-04-11 | 2019-10-22 | 郑光甫 | Voluntarily log in the multi-drop water delivery system of form |
| CN110414795A (en) * | 2019-07-02 | 2019-11-05 | 华侨大学 | Method is influenced based on the newly-increased high-speed rail hinge accessibility for improving two moved further search methods |
| WO2019242520A1 (en) * | 2018-06-20 | 2019-12-26 | 菜鸟智能物流控股有限公司 | Logistics distribution station planning method, and server |
| CN110689289A (en) * | 2018-07-05 | 2020-01-14 | 优信数享（北京）信息技术有限公司 | Travel cost calculation method, device and system |
| CN111553622A (en) * | 2019-02-12 | 2020-08-18 | 北京京东尚科信息技术有限公司 | Method and device for determining distribution route |
| CN111652438A (en) * | 2020-06-04 | 2020-09-11 | 上海燕汐软件信息科技有限公司 | Dynamic optimization method and device for logistics line |
| CN111860918A (en) * | 2019-04-24 | 2020-10-30 | 北京京东尚科信息技术有限公司 | Distribution method and device, electronic device and computer readable medium |
| CN111915240A (en) * | 2019-05-10 | 2020-11-10 | 北京京东尚科信息技术有限公司 | Method and apparatus for generating delivery route information |
| CN112418475A (en) * | 2019-08-23 | 2021-02-26 | 顺丰科技有限公司 | Logistics path planning method and device, electronic equipment and storage medium |
| CN112862135A (en) * | 2019-11-26 | 2021-05-28 | 顺丰科技有限公司 | Express delivery route planning method and device, server and storage medium |
| CN113177752A (en) * | 2021-04-20 | 2021-07-27 | 杉数科技(北京)有限公司 | Route planning method and device and server |
| CN113222515A (en) * | 2021-05-27 | 2021-08-06 | 咪咕文化科技有限公司 | Waybill distribution method and device, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101673382A (en) * | 2009-10-21 | 2010-03-17 | 北京交通大学 | Combined optimization method for agricultural chain-operation logistics delivering and loading-distribution |
| CN103383756A (en) * | 2013-07-22 | 2013-11-06 | 浙江省烟草公司绍兴市公司 | Planning method for tobacco logistics distribution routes |
| CN103679426A (en) * | 2013-12-18 | 2014-03-26 | 北京京东尚科信息技术有限公司 | Method and system for dispatching transfer station vehicles |
| CN104616070A (en) * | 2015-01-15 | 2015-05-13 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution route |
-
2017
- 2017-03-22 CN CN201710176222.2A patent/CN106997494A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101673382A (en) * | 2009-10-21 | 2010-03-17 | 北京交通大学 | Combined optimization method for agricultural chain-operation logistics delivering and loading-distribution |
| CN103383756A (en) * | 2013-07-22 | 2013-11-06 | 浙江省烟草公司绍兴市公司 | Planning method for tobacco logistics distribution routes |
| CN103679426A (en) * | 2013-12-18 | 2014-03-26 | 北京京东尚科信息技术有限公司 | Method and system for dispatching transfer station vehicles |
| CN104616070A (en) * | 2015-01-15 | 2015-05-13 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution route |
Cited By (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109583802A (en) * | 2017-09-29 | 2019-04-05 | 北京京东尚科信息技术有限公司 | Unmanned distribution network system and dispatching method |
| CN107944598A (en) * | 2017-10-31 | 2018-04-20 | 苏宁云商集团股份有限公司 | A kind of logistics route collocation method and system |
| CN107705043A (en) * | 2017-10-31 | 2018-02-16 | 顺丰科技有限公司 | A kind of Bus stop planning method, apparatus, equipment, storage medium |
| CN109978213A (en) * | 2017-12-28 | 2019-07-05 | 北京京东尚科信息技术有限公司 | A kind of task path planning method and device |
| CN109978213B (en) * | 2017-12-28 | 2021-11-12 | 北京京东振世信息技术有限公司 | Task path planning method and device |
| CN108268038A (en) * | 2018-01-19 | 2018-07-10 | 广东美的智能机器人有限公司 | The dispatching method and system of multiple mobile robot |
| CN108268038B (en) * | 2018-01-19 | 2021-04-20 | 广东美的智能机器人有限公司 | Dispatching method and system for multiple mobile robots |
| CN110135665A (en) * | 2018-02-02 | 2019-08-16 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus that dynamic divides dispatching region |
| CN108573362A (en) * | 2018-04-10 | 2018-09-25 | 合肥美的智能科技有限公司 | The logistics and distribution management method and apparatus and system of self-service equipment |
| CN110363607A (en) * | 2018-04-11 | 2019-10-22 | 郑光甫 | Voluntarily log in the multi-drop water delivery system of form |
| WO2019242520A1 (en) * | 2018-06-20 | 2019-12-26 | 菜鸟智能物流控股有限公司 | Logistics distribution station planning method, and server |
| CN108921428A (en) * | 2018-06-28 | 2018-11-30 | 上海中通吉网络技术有限公司 | The dispatching method and device of logistics vehicles |
| CN109034690A (en) * | 2018-07-05 | 2018-12-18 | 北京智行者科技有限公司 | Method is sent in a kind of collaboration with charge free |
| CN110689289A (en) * | 2018-07-05 | 2020-01-14 | 优信数享（北京）信息技术有限公司 | Travel cost calculation method, device and system |
| CN109409585A (en) * | 2018-10-08 | 2019-03-01 | 北京海纳川汽车部件股份有限公司 | The dispatching method and device of logistics vehicles |
| CN111553622A (en) * | 2019-02-12 | 2020-08-18 | 北京京东尚科信息技术有限公司 | Method and device for determining distribution route |
| CN111553622B (en) * | 2019-02-12 | 2023-11-07 | 北京京东振世信息技术有限公司 | Distribution route determining method and device |
| CN111860918A (en) * | 2019-04-24 | 2020-10-30 | 北京京东尚科信息技术有限公司 | Distribution method and device, electronic device and computer readable medium |
| CN111860918B (en) * | 2019-04-24 | 2024-01-16 | 北京京东振世信息技术有限公司 | Distribution method and device, electronic equipment and computer readable medium |
| CN111915240A (en) * | 2019-05-10 | 2020-11-10 | 北京京东尚科信息技术有限公司 | Method and apparatus for generating delivery route information |
| CN110414795A (en) * | 2019-07-02 | 2019-11-05 | 华侨大学 | Method is influenced based on the newly-increased high-speed rail hinge accessibility for improving two moved further search methods |
| CN110414795B (en) * | 2019-07-02 | 2022-07-29 | 华侨大学 | Newly-increased high-speed rail junction accessibility influence method based on improved two-step mobile search method |
| CN112418475A (en) * | 2019-08-23 | 2021-02-26 | 顺丰科技有限公司 | Logistics path planning method and device, electronic equipment and storage medium |
| CN112862135B (en) * | 2019-11-26 | 2023-06-13 | 顺丰科技有限公司 | Express delivery route planning method, device, server and storage medium |
| CN112862135A (en) * | 2019-11-26 | 2021-05-28 | 顺丰科技有限公司 | Express delivery route planning method and device, server and storage medium |
| CN111652438A (en) * | 2020-06-04 | 2020-09-11 | 上海燕汐软件信息科技有限公司 | Dynamic optimization method and device for logistics line |
| CN111652438B (en) * | 2020-06-04 | 2024-04-19 | 上海燕汐软件信息科技有限公司 | Dynamic optimization method and device for logistics line |
| CN113177752A (en) * | 2021-04-20 | 2021-07-27 | 杉数科技(北京)有限公司 | Route planning method and device and server |
| CN113222515A (en) * | 2021-05-27 | 2021-08-06 | 咪咕文化科技有限公司 | Waybill distribution method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106997494A (en) | Logistics distribution planing method, Logistics Distribution Method and its device | |
| CN109772714B (en) | Goods sorting method and device, storage medium and electronic equipment | |
| Farvolden et al. | Subgradient methods for the service network design problem | |
| JP7077162B2 (en) | Delivery planning device, delivery planning system and delivery planning method | |
| Bortfeldt et al. | Packing first, routing second—a heuristic for the vehicle routing and loading problem | |
| CN104504459B (en) | Logistics transportation optimization method and system | |
| Du et al. | A real-time vehicle-dispatching system for consolidating milk runs | |
| CN111598341B (en) | Power material distribution method and system based on material distribution and path optimization | |
| Rashidi et al. | A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals | |
| CN107235276A (en) | Goods method for carrying and device | |
| JP6650508B2 (en) | Warehouse management system and warehouse management method | |
| CN110322172A (en) | Inventory's dispatching method, device and computer readable storage medium | |
| CN108549978B (en) | Method and system for allocating safe freight vehicle | |
| Lee et al. | A hybrid hub-and-spoke postal logistics network with realistic restrictions: A case study of Korea Post | |
| Haridass et al. | Scheduling a log transport system using simulated annealing | |
| CN103927643A (en) | Optimization method for large-scale order processing and distributing route | |
| CN107392523A (en) | Intelligent cloud goods distribution method and system | |
| CN109902866B (en) | Cooperative optimization method for railway express train operation scheme and train bottom application | |
| CN108197873A (en) | Warehouse article goods sorting method, device, computer equipment and storage medium | |
| CN113240369B (en) | Goods sorting method, device, equipment and storage medium | |
| CN109948918B (en) | Comprehensive distribution method for local emergency mass storage materials | |
| CN110232551B (en) | Goods classification method and device, storage medium and electronic device | |
| JP2020173789A (en) | Delivery plan generating device, system and method, and computer readable storage medium | |
| CN108423351A (en) | Divide integrated method based on the storage of rectangular co-ordinate unstacking machine hand combination Multilayer shuttle car | |
| CN110175794A (en) | Logistics distribution information data acquisition methods, device and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1237503 Country of ref document: HK |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170801 |