CN106355282A - Logistics loading optimizing method and device - Google Patents
Logistics loading optimizing method and device Download PDFInfo
- Publication number
- CN106355282A CN106355282A CN201610793811.0A CN201610793811A CN106355282A CN 106355282 A CN106355282 A CN 106355282A CN 201610793811 A CN201610793811 A CN 201610793811A CN 106355282 A CN106355282 A CN 106355282A
- Authority
- CN
- China
- Prior art keywords
- point
- loading
- load
- successively
- principle
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000005457 optimization Methods 0.000 claims abstract description 29
- 238000002372 labelling Methods 0.000 claims description 30
- 238000009826 distribution Methods 0.000 claims description 21
- 230000007717 exclusion Effects 0.000 claims description 16
- 230000008901 benefit Effects 0.000 abstract description 10
- 230000000694 effects Effects 0.000 description 7
- 238000003860 storage Methods 0.000 description 2
- 239000004566 building material Substances 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 235000013305 food Nutrition 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000005304 joining Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 229910052751 metal Inorganic materials 0.000 description 1
- 239000002184 metal Substances 0.000 description 1
- 150000002739 metals Chemical class 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
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
-
- 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
Abstract
The invention discloses a logistics loading optimizing method and device. The problem of stowage optimization of multi-goods in one truck is solved through multi-point loading and unloading, and the overall operation efficiency and economic benefit of the truck are improved. The logistics loading optimizing method comprises steps as follows: arranging a plurality of virtual posts in a service providing region; obtaining each loading point, each unloading point and the current position of the truck; counting the virtual posts included in a predetermined moving range with each loading point and the current position of the truck as the center, and determining the virtual post occurring most frequently as a key point; determining the loading point closest to the key point as a starting point; determining a target point comprising the unloading point according to predetermined principles; connecting road segments reaching the target point every time to obtain a delivery path; controlling the truck to perform delivery based on the delivery path.
Description
Technical field
The present invention relates to logistlcs technology field, more particularly, to a kind of logistics Loading optimization method and device.
Background technology
Logistics be article from supply to the physical flow process receiving ground, according to actual needs, will transport, store,
The functions such as buying, handling, packaging, circulation and process, dispensing, information processing combine and realize the mistake of user's requirement
Journey.It is also different that the difference in wherein handling place leads to choose the time that different paths are adopted, and therefore how to select rational
Path becomes technical problem urgently to be resolved hurrily.
Content of the invention
A kind of logistics Loading optimization method and device of the present invention, is loaded and unloaded by multiple spot, and the optimization solving the many goods of a car is joined
Load problem, improves operational efficiency and the economic benefits of overall vehicle.
A kind of logistics Loading optimization method of the present invention, comprising:
Set multiple virtual post houses in the region carrying out service；
Obtain each loading point, break bulk point and load-carrying vehicle current location；
The virtual post house that statistics comprises in the range of the scheduled event centered on each loading point and load-carrying vehicle current location,
And will appear from the most virtual post house of number of times and be defined as key point；
The loading point nearest apart from key point is defined as starting point；
Successively impact point is determined according to predetermined principle, this impact point includes break bulk point；
Each section reaching impact point is connected and obtains Distribution path；
Load-carrying vehicle is controlled to be provided and delivered according to this Distribution path.
Optionally,
The determination step of the scheduled event scope centered on each loading point and load-carrying vehicle current location includes:
Draw regular polygon centered on load-carrying vehicle current location and each loading point respectively, polygonal side number is n, wherein
N is not less than 3.
Optionally,
It is virtual that step statistics comprises in the range of the scheduled event centered on each loading point and load-carrying vehicle current location
Post house, and will appear from the most virtual post house of number of times and be defined as key point including:
Each virtual post house is numbered；
Determine the numbering comprising in each regular polygon；
The occurrence number that each is numbered is counted, obtains statistical result；
Descending is carried out to virtual post house according to statistical result, obtains seniority among brothers and sisters table；
First post house in seniority among brothers and sisters table is defined as key point.
Optionally,
Step obtains each loading point, after break bulk point and load-carrying vehicle current location, step controls load-carrying vehicle according to being joined
Send to state before being provided and delivered in path and also include:
Obtain each loading point goods information；
Compatible mutual exclusion rule is set up according to goods information；
Cargo list is determined according to compatible mutual exclusion rule；
Load-carrying vehicle is controlled to be freighted according to cargo list.
Optionally,
According to predetermined principle, step determines that impact point includes successively:
Successively impact point is determined according to nearby principle.
Optionally,
According to predetermined principle, step determines that impact point includes successively:
Determine impact point according to keeping away stifled principle successively；
Keeping away stifled principle is, when the section reaching first object point has traffic jam, selects there is not traffic jam
Second impact point in section.
Optionally,
According to predetermined principle, step determines that impact point includes successively:
Successively according to keep away limit principle determine impact point.
Optionally,
Step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has limit for height labelling, select the second mesh that there is not the section of limit for height labelling
Punctuate.
Optionally,
Step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has freight weight limit labelling, select the second mesh that there is not the section of freight weight limit labelling
Punctuate.
Optionally,
Step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has limit for height labelling, select the second mesh that there is not the section of limit for height labelling
Punctuate.
As can be seen from the above technical solutions, the embodiment of the present invention has the advantage that
A kind of logistics Loading optimization method of the present invention, is loaded and unloaded by multiple spot, solves the problems, such as the optimized configuring of the many goods of a car,
Improve operational efficiency and the economic benefits of overall vehicle.
A kind of logistics Loading optimization method of the present invention, comprising: first, sets multiple virtual posts in the region carrying out service
Stand；Then, each loading point, break bulk point and load-carrying vehicle current location are obtained；Then, statistics is worked as with each loading point and load-carrying vehicle
The virtual post house comprising in the range of scheduled event centered on front position, and will appear from the most virtual post house of number of times be defined as close
Key point；Again the loading point nearest apart from key point is defined as starting point；Then, successively impact point is determined according to predetermined principle,
This impact point includes break bulk point；Then, each section reaching impact point is connected and obtain Distribution path；Finally, control loading
Car is provided and delivered according to this Distribution path.System first sets multiple virtual post houses, further according to loading point and load-carrying vehicle current location
Relation, by the most key points in virtual post house most for number of repetition in range of activity, and then chosen distance key point is nearest
Loading point is starting point, then determines next impact point successively.The path that such scheme determines improves dispensing operational efficiency and warp
Ji effect.
Brief description
Fig. 1 is a kind of flow chart of present invention logistics Loading optimization method first embodiment；
Fig. 2 is a kind of flow chart of present invention logistics Loading optimization method second embodiment；
Fig. 3 is a kind of flow chart of present invention logistics Loading optimization method 3rd embodiment.
Specific embodiment
A kind of logistics Loading optimization method of the present invention, is loaded and unloaded by multiple spot, solves the problems, such as the optimized configuring of the many goods of a car,
Improve operational efficiency and the economic benefits of overall vehicle.
Refer to Fig. 1, a kind of logistics Loading optimization method first embodiment of the present invention, specifically include:
101st, multiple virtual post houses are set in the region carrying out service；
In the present embodiment, system sets multiple virtual post houses in the region carrying out service.
Need explanation when, the virtual post house that system determines not is really to exist it is believed that on electronic chart
Can reality go out virtual post house position, set virtual post house purpose be in order to demarcate loading point between position relationship.I.e.
Make the title in certain technical scheme not be virtual post house, but effect identical it should also be considered the identical concept, belong to this patent work as
Protection domain.
102nd, each loading point, break bulk point and load-carrying vehicle current location are obtained；
In the present embodiment, system obtains each loading point, break bulk point and load-carrying vehicle current location.
It should be noted that system obtains each loading point, break bulk point and load-carrying vehicle current location joining as follow-up determination
Send the precondition in path.
103rd, comprise in the range of scheduled event centered on each loading point and load-carrying vehicle current location for the statistics is virtual
Post house, and will appear from the most virtual post house of number of times and be defined as key point；
In the present embodiment, scheduled event scope centered on each loading point and load-carrying vehicle current location for the system statisticses
The virtual post house inside comprising, and will appear from the most virtual post house of number of times and be defined as key point.
It should be noted that comprising in the range of scheduled event centered on each loading point and load-carrying vehicle current location
The determination step of virtual post house particularly as follows:
Draw regular polygon centered on load-carrying vehicle current location and each loading point respectively, polygonal side number is n, wherein
N is not less than 3.Here regular polygon can include justifying, that is, respectively centered on load-carrying vehicle current location and each loading point, arbitrarily
Length draws circle for radius.For example justifying when radius can be 20km.
104th, the loading point nearest apart from key point is defined as starting point；
In the present embodiment, the loading point nearest apart from key point is defined as starting point by system.
It should be noted that determining that the starting point in path is the emphasis of Distribution path, the starting point that said method determines is
Guarantee operational efficiency and the point of economic benefits optimum.
105th, successively impact point is determined according to predetermined principle, this impact point includes break bulk point；
In the present embodiment, system determines impact point according to predetermined principle successively, and this impact point includes break bulk point.
It should be noted that predetermined principle specifically includes:
Successively impact point is determined according to nearby principle.
Or,
Determine impact point according to keeping away stifled principle successively；
Keeping away stifled principle is, when the section reaching first object point has traffic jam, selects there is not traffic jam
Second impact point in section.
Or,
According to predetermined principle, step determines that impact point includes successively:
Successively according to keep away limit principle determine impact point.
Successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has limit for height labelling, select the second mesh that there is not the section of limit for height labelling
Punctuate.
Or,
Step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has freight weight limit labelling, select the second mesh that there is not the section of freight weight limit labelling
Punctuate.
Or,
Step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has limit for height labelling, select the second mesh that there is not the section of limit for height labelling
Punctuate.
Above-mentioned predetermined principle all can be realized by electronic chart existing capability.
106th, each section reaching impact point is connected and obtain Distribution path；
In the present embodiment, each section reaching impact point is connected and obtains Distribution path by system.
107th, load-carrying vehicle is controlled to be provided and delivered according to this Distribution path.
In the present embodiment, system first, sets multiple virtual post houses in the region carrying out service；Then, obtain each dress
Goods point, break bulk point and load-carrying vehicle current location；Then, statistics is predetermined centered on each loading point and load-carrying vehicle current location
The virtual post house comprising in range of activity, and will appear from the most virtual post house of number of times and be defined as key point；Again will be apart from key
The nearest loading point of point is defined as starting point；Then, successively impact point is determined according to predetermined principle, this impact point includes unloading
Point；Then, each section reaching impact point is connected and obtain Distribution path；Finally, control load-carrying vehicle according to this Distribution path
Provided and delivered.System first sets multiple virtual post houses, further according to the relation of loading point and load-carrying vehicle current location, by range of activity
The most key point in the most virtual post house of interior number of repetition, and then the nearest loading of chosen distance key point is put as starting point, then
Determine next impact point successively.The path that such scheme determines improves dispensing operational efficiency and economic benefits.
Above the logistics Loading optimization method first embodiment in the present invention is illustrated, refers to Fig. 2 below, this
Logistics Loading optimization method second embodiment in invention includes:
201st, multiple virtual post houses are set in the region carrying out service；
202nd, each loading point, break bulk point and load-carrying vehicle current location are obtained；
Step 201 is identical with step 101 and step 102 with step 202, does not repeat.
203rd, each virtual post house is numbered；
In the present embodiment, system is numbered to each virtual post house.
It should be noted that the purpose that system is numbered to each virtual post house is to distinguish different post houses, thus
Post house is ranked up provide precondition for follow-up.
204th, draw regular polygon centered on load-carrying vehicle current location and each loading point respectively, polygonal side number is n,
Wherein n is not less than 3；
In the present embodiment, system draws regular polygon respectively centered on load-carrying vehicle current location and each loading point, many
While shape while number be n, wherein n be not less than 3.Here regular polygon can include justifying, that is, respectively with load-carrying vehicle current location and every
Centered on individual loading point, random length draws circle for radius.For example justifying when radius can be 20km.
205th, determine the numbering comprising in each regular polygon；
In the present embodiment, system determines the numbering comprising in each regular polygon.
It should be noted that in electronic chart, system can show that position and numbering are worked as in virtual post house, thus convenient count
The numbering of the post house in each regular polygon.System can also pass through coordinate and the regular polygon boundary straight line Equation for Calculating of post house
The coordinate position falling in the range of regular polygon, thus determine numbering by coordinate position.
206th, the occurrence number that each is numbered is counted, obtain statistical result；
In the present embodiment, system counts to the occurrence number that each is numbered, and obtains statistical result.
It should be noted that system counts to the occurrence number that each is numbered, for example virtual post house respectively p1,
P2, p3, p4 ... pn, wherein p1 occurrence number are 2, p2 occurrence number is 1 for 5, p3 occurrence number.List can also be passed through
Mode is by statistical result showed out.
207th, descending is carried out to virtual post house according to statistical result, obtain seniority among brothers and sisters table；
In the present embodiment, system carries out descending according to statistical result to virtual post house, obtains seniority among brothers and sisters table.
208th, first post house in seniority among brothers and sisters table is defined as key point；
In the present embodiment, scheduled event scope centered on each loading point and load-carrying vehicle current location for the system statisticses
The virtual post house inside comprising, and will appear from the most virtual post house of number of times and be defined as key point.
It should be noted that comprising in the range of scheduled event centered on each loading point and load-carrying vehicle current location
The determination step of virtual post house particularly as follows:
Draw regular polygon centered on load-carrying vehicle current location and each loading point respectively, polygonal side number is n, wherein
N is not less than 3.Here regular polygon can include justifying, that is, respectively centered on load-carrying vehicle current location and each loading point, arbitrarily
Length draws circle for radius.For example justifying when radius can be 20km.
209th, the loading point nearest apart from key point is defined as starting point；
In the present embodiment, the loading point nearest apart from key point is defined as starting point by system.
It should be noted that determining that the starting point in path is the emphasis of Distribution path, the starting point that said method determines is
Guarantee operational efficiency and the point of economic benefits optimum.
210th, successively impact point is determined according to predetermined principle, this impact point includes break bulk point；
In the present embodiment, system determines impact point according to predetermined principle successively, and this impact point includes break bulk point.
It should be noted that predetermined principle specifically includes:
Successively impact point is determined according to nearby principle.
Or,
Determine impact point according to keeping away stifled principle successively；
Keeping away stifled principle is, when the section reaching first object point has traffic jam, selects there is not traffic jam
Second impact point in section.
Or,
According to predetermined principle, step determines that impact point includes successively:
Successively according to keep away limit principle determine impact point.
Successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has limit for height labelling, select the second mesh that there is not the section of limit for height labelling
Punctuate.
Or,
Step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has freight weight limit labelling, select the second mesh that there is not the section of freight weight limit labelling
Punctuate.
Or,
Step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has limit for height labelling, select the second mesh that there is not the section of limit for height labelling
Punctuate.
Above-mentioned predetermined principle all can be realized by electronic chart existing capability.
211st, each section reaching impact point is connected and obtain Distribution path；
In the present embodiment, each section reaching impact point is connected and obtains Distribution path by system.
212nd, load-carrying vehicle is controlled to be provided and delivered according to this Distribution path.
In the present embodiment, system first, sets multiple virtual post houses in the region carrying out service；Then, obtain each dress
Goods point, break bulk point and load-carrying vehicle current location；Then, each virtual post house is numbered；Again respectively with load-carrying vehicle present bit
Put with each loading point centered on draw regular polygon, polygonal side number be n, wherein n be not less than 3；It is then determined each is just many
The numbering comprising in the shape of side, and the occurrence number that each is numbered is counted, obtain statistical result；Then, according to statistics knot
Fruit carries out descending to virtual post house, obtains seniority among brothers and sisters table, first post house in seniority among brothers and sisters table is defined as key point；Again by distance
The nearest loading point of key point is defined as starting point；Then, successively impact point is determined according to predetermined principle, this impact point includes unloading
Goods point；Then, each section reaching impact point is connected and obtain Distribution path；Finally, control load-carrying vehicle according to this dispensing road
Provided and delivered in footpath.System first sets multiple virtual post houses, further according to the relation of loading point and load-carrying vehicle current location, by movable model
Enclose the most key point in the most virtual post house of interior number of repetition, and then the nearest loading of chosen distance key point put as starting point,
Determine next impact point more successively.The path that such scheme determines improves dispensing operational efficiency and economic benefits.In addition,
The present invention is by numbering to virtual post house, and the key point that obtains of occurrence number arrangement is physically easier to perform by number.Enhance
Intuitive and visualization.
Above the logistics Loading optimization method second embodiment in the present invention is illustrated, below in the present invention
Logistics Loading optimization method 3rd embodiment is described:
Logistics Loading optimization method 3rd embodiment in the present invention is in place of being different from previous embodiment:
Step obtains each loading point, after break bulk point and load-carrying vehicle current location, step controls load-carrying vehicle according to being joined
Send to state before being provided and delivered in path and also include:
Obtain each loading point goods information；
Compatible mutual exclusion rule is set up according to goods information；
Cargo list is determined according to compatible mutual exclusion rule；
Load-carrying vehicle is controlled to be freighted according to cargo list.
With the example in a practical application, the logistics Loading optimization method 3rd embodiment in the present invention is carried out below
Illustrate:
301st, multiple virtual post houses are set in the region carrying out service；
302nd, each loading point, break bulk point and load-carrying vehicle current location are obtained；
303rd, comprise in the range of scheduled event centered on each loading point and load-carrying vehicle current location for the statistics is virtual
Post house, and will appear from the most virtual post house of number of times and be defined as key point；
304th, the loading point nearest apart from key point is defined as starting point；
Above-mentioned steps 301 to 304 are identical to 104 with step 101, will not be described here.
305th, obtain each loading point goods information；
In the present embodiment, system obtains each loading point goods information.
It should be noted that system obtains the goods information of each loading point, goods information includes assortment of article, unloading ground
Point, goods weight etc..
306th, compatible mutual exclusion rule is set up according to goods information；
In the present embodiment, system sets up compatible mutual exclusion rule according to goods information.
It should be noted that system sets up compatible mutual exclusion rule according to assortment of article, wherein, food and dangerous materials mutual exclusion,
Five metals is compatible with building materials.
307th, cargo list is determined according to compatible mutual exclusion rule；
System, with the maximum goods of load-carrying as benchmark, does compatible process according to compatible, mutual exclusion rule in the present embodiment,
For mutual exclusion manifest play one by one a certain amount of except getting, such as: when reaching vehicle-mounted or load side's maximum or 90%, determine this batch
Cargo list.
308th, load-carrying vehicle is controlled to be freighted according to cargo list；
309th, successively impact point is determined according to predetermined principle, this impact point includes break bulk point；
In the present embodiment, system determines impact point according to predetermined principle successively, and this impact point includes break bulk point.
It should be noted that predetermined principle specifically includes:
Successively impact point is determined according to nearby principle.
Or,
Determine impact point according to keeping away stifled principle successively；
Keeping away stifled principle is, when the section reaching first object point has traffic jam, selects there is not traffic jam
Second impact point in section.
Or,
According to predetermined principle, step determines that impact point includes successively:
Successively according to keep away limit principle determine impact point.
Successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has limit for height labelling, select the second mesh that there is not the section of limit for height labelling
Punctuate.
Or,
Step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has freight weight limit labelling, select the second mesh that there is not the section of freight weight limit labelling
Punctuate.
Or,
Step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has limit for height labelling, select the second mesh that there is not the section of limit for height labelling
Punctuate.
Above-mentioned predetermined principle all can be realized by electronic chart existing capability.
310th, each section reaching impact point is connected and obtain Distribution path；
311st, load-carrying vehicle is controlled to be provided and delivered according to this Distribution path.
In the present embodiment, system first, sets multiple virtual post houses in the region carrying out service；Then, obtain each dress
Goods point, break bulk point and load-carrying vehicle current location；Then, statistics is predetermined centered on each loading point and load-carrying vehicle current location
The virtual post house comprising in range of activity, and will appear from the most virtual post house of number of times and be defined as key point；Again will be apart from key
The nearest loading point of point is defined as starting point；Then, obtain each loading point goods information；Then, set up according to goods information
Compatible mutual exclusion rule；Determine cargo list further according to compatible mutual exclusion rule；Then, load-carrying vehicle is controlled to enter luggage according to cargo list
Goods；Then, successively impact point is determined according to predetermined principle, this impact point includes break bulk point；Then, by each arrival impact point
Section connects and obtains Distribution path；Finally, load-carrying vehicle is controlled to be provided and delivered according to this Distribution path.System first sets multiple virtual
Post house, puts the relation with load-carrying vehicle current location further according to loading, by virtual post houses most for number of repetition in range of activity
For key point, and then the nearest loading of chosen distance key point is put as starting point, then determines next impact point successively.Such scheme
The path determining improves dispensing operational efficiency and economic benefits.In addition, the present invention determines dress according to compatible mutual exclusion principle
Goods inventory, thus reduce the problem that article damage and affect one another in transportation.Further increase the safety of dispensing
Property.
Can be integrated in a processing unit or each in each functional unit in each embodiment of the present invention
Unit is individually physically present it is also possible to two or more units are integrated in a unit.Above-mentioned integrated unit both may be used
To be realized in the form of hardware, it would however also be possible to employ the form of SFU software functional unit is realized.
If described integrated unit is realized and as independent production marketing or use using in the form of SFU software functional unit
When, can be stored in a computer read/write memory medium.Based on such understanding, technical scheme is substantially
The part in other words prior art being contributed or all or part of this technical scheme can be in the form of software products
Embody, this computer software product is stored in a storage medium, including some instructions with so that a computer
Equipment (can be personal computer, server, or network equipment etc.) executes the complete of each embodiment methods described of the present invention
Portion or part steps.And aforesaid storage medium includes: u disk, portable hard drive, read only memory (rom, read only
Memory), random access memory (ram, random access memory), magnetic disc or CD etc. are various can store journey
The medium of sequence code.
The above, above example only in order to technical scheme to be described, is not intended to limit；Although with reference to front
State embodiment the present invention has been described in detail, it will be understood by those within the art that: it still can be to front
State the technical scheme described in each embodiment to modify, or equivalent is carried out to wherein some technical characteristics；And these
Modification or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (10)
1. a kind of logistics Loading optimization method is it is characterised in that include:
Set multiple virtual post houses in the region carrying out service；
Obtain each loading point, break bulk point and load-carrying vehicle current location；
The virtual post house that statistics comprises in the range of the scheduled event centered on each loading point and load-carrying vehicle current location, and will
The most virtual post house of occurrence number is defined as key point；
The loading point nearest apart from described key point is defined as starting point；
Successively impact point is determined according to predetermined principle, described impact point includes described break bulk point；
Each section reaching impact point is connected and obtains Distribution path；
Described load-carrying vehicle is controlled to be provided and delivered according to described Distribution path.
2. logistics Loading optimization method according to claim 1 it is characterised in that
The determination step of the scheduled event scope centered on each loading point and load-carrying vehicle current location includes:
Draw regular polygon centered on load-carrying vehicle current location and each loading point respectively, described polygonal side number is n, wherein
N is not less than 3.
3. logistics Loading optimization method according to claim 2 it is characterised in that
Counting described in step by each loading point and load-carrying vehicle current location centered on scheduled event in the range of comprise virtual
Post house, and will appear from the most virtual post house of number of times and be defined as key point including:
Each virtual post house is numbered；
Determine the numbering comprising in each regular polygon；
The occurrence number that each is numbered is counted, obtains statistical result；
Descending is carried out to virtual post house according to described statistical result, obtains seniority among brothers and sisters table；
First post house in described seniority among brothers and sisters table is defined as key point.
4. logistics Loading optimization method according to claim 1 it is characterised in that
After obtaining each loading point, break bulk point and load-carrying vehicle current location described in step, described in step, control described load-carrying vehicle
Stated before being provided and delivered in path according to providing and delivering and also include:
Obtain each loading point goods information；
Compatible mutual exclusion rule is set up according to described goods information；
Cargo list is determined according to described compatible mutual exclusion rule；
Described load-carrying vehicle is controlled to be freighted according to described cargo list.
5. logistics Loading optimization method according to any one of claim 1 to 4 it is characterised in that
Determine that impact point includes according to predetermined principle successively described in step:
Successively impact point is determined according to nearby principle.
6. logistics Loading optimization method according to any one of claim 1 to 4 it is characterised in that
Determine that impact point includes according to predetermined principle successively described in step:
Determine impact point according to keeping away stifled principle successively；
Described keep away stifled principle and be, when the section reaching first object point has traffic jam, select there is not traffic jam
Second impact point in section.
7. logistics Loading optimization method according to any one of claim 1 to 4 it is characterised in that
Determine that impact point includes according to predetermined principle successively described in step:
Successively according to keep away limit principle determine impact point.
8. logistics Loading optimization method according to claim 7 it is characterised in that
Described in step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has limit for height labelling, select the second target that there is not the section of limit for height labelling
Point.
9. logistics Loading optimization method according to claim 7 it is characterised in that
Described in step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has freight weight limit labelling, select the second target that there is not the section of freight weight limit labelling
Point.
10. logistics Loading optimization method according to claim 7 it is characterised in that
Described in step successively according to keep away limit principle determine that impact point includes:
When the section reaching first object point has limit for height labelling, select the second target that there is not the section of limit for height labelling
Point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610793811.0A CN106355282B (en) | 2016-08-31 | 2016-08-31 | A kind of logistics Loading optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610793811.0A CN106355282B (en) | 2016-08-31 | 2016-08-31 | A kind of logistics Loading optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106355282A true CN106355282A (en) | 2017-01-25 |
| CN106355282B CN106355282B (en) | 2019-09-13 |
Family
ID=57857598
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610793811.0A Expired - Fee Related CN106355282B (en) | 2016-08-31 | 2016-08-31 | A kind of logistics Loading optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106355282B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107274128A (en) * | 2017-06-15 | 2017-10-20 | 上海汽车集团股份有限公司 | A kind of vehicle load method and device |
| CN109784808A (en) * | 2018-12-29 | 2019-05-21 | 山东省产品质量检验研究院 | A kind of instant handling technigue of the vehicles based on prestowage balance |
| CN110400113A (en) * | 2019-08-06 | 2019-11-01 | 三江学院 | Part real-time scheduling method and system are pulled in a kind of logistics |
| CN111652439A (en) * | 2020-06-04 | 2020-09-11 | 上海燕汐软件信息科技有限公司 | Method and device for generating delivery quantity of delivery points and computer system |
| CN113919159A (en) * | 2021-10-14 | 2022-01-11 | 云南特可科技有限公司 | Logistics space optimization method |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008137083A3 (en) * | 2007-05-02 | 2008-12-24 | Toshiba Kk | Optimum route planning for service vehicles |
| CN102830702A (en) * | 2012-09-07 | 2012-12-19 | 无锡普智联科高新技术有限公司 | Mobile robot path planning method used in intensive storage zone |
| CN102859323A (en) * | 2009-11-24 | 2013-01-02 | 特洛吉斯有限公司 | Vehicle route selection based on energy usage |
| CN103413209A (en) * | 2013-07-17 | 2013-11-27 | 西南交通大学 | Method for selecting multi-user and multi-warehouse logistics distribution path |
| CN104102953A (en) * | 2014-06-24 | 2014-10-15 | 四川省烟草公司广安市公司 | Logistics delivery route optimizing generation method and system |
| CN105046365A (en) * | 2015-07-29 | 2015-11-11 | 余意 | Method and device for route optimization of logistics delivery vehicle |
| CN105184412A (en) * | 2015-09-21 | 2015-12-23 | 北京农业信息技术研究中心 | Logistics delivery route planning method and system based on geographic positions |
-
2016
- 2016-08-31 CN CN201610793811.0A patent/CN106355282B/en not_active Expired - Fee Related
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008137083A3 (en) * | 2007-05-02 | 2008-12-24 | Toshiba Kk | Optimum route planning for service vehicles |
| CN102859323A (en) * | 2009-11-24 | 2013-01-02 | 特洛吉斯有限公司 | Vehicle route selection based on energy usage |
| CN102830702A (en) * | 2012-09-07 | 2012-12-19 | 无锡普智联科高新技术有限公司 | Mobile robot path planning method used in intensive storage zone |
| CN103413209A (en) * | 2013-07-17 | 2013-11-27 | 西南交通大学 | Method for selecting multi-user and multi-warehouse logistics distribution path |
| CN104102953A (en) * | 2014-06-24 | 2014-10-15 | 四川省烟草公司广安市公司 | Logistics delivery route optimizing generation method and system |
| CN105046365A (en) * | 2015-07-29 | 2015-11-11 | 余意 | Method and device for route optimization of logistics delivery vehicle |
| CN105184412A (en) * | 2015-09-21 | 2015-12-23 | 北京农业信息技术研究中心 | Logistics delivery route planning method and system based on geographic positions |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107274128A (en) * | 2017-06-15 | 2017-10-20 | 上海汽车集团股份有限公司 | A kind of vehicle load method and device |
| CN107274128B (en) * | 2017-06-15 | 2020-09-15 | 上海汽车集团股份有限公司 | Vehicle loading method and device |
| CN109784808A (en) * | 2018-12-29 | 2019-05-21 | 山东省产品质量检验研究院 | A kind of instant handling technigue of the vehicles based on prestowage balance |
| CN110400113A (en) * | 2019-08-06 | 2019-11-01 | 三江学院 | Part real-time scheduling method and system are pulled in a kind of logistics |
| CN110400113B (en) * | 2019-08-06 | 2022-01-11 | 三江学院 | Real-time scheduling method and system for logistics package |
| CN111652439A (en) * | 2020-06-04 | 2020-09-11 | 上海燕汐软件信息科技有限公司 | Method and device for generating delivery quantity of delivery points and computer system |
| CN111652439B (en) * | 2020-06-04 | 2024-02-23 | 上海燕汐软件信息科技有限公司 | Method and device for generating dispatch quantity of dispatch points and computer system |
| CN113919159A (en) * | 2021-10-14 | 2022-01-11 | 云南特可科技有限公司 | Logistics space optimization method |
| CN113919159B (en) * | 2021-10-14 | 2022-10-21 | 云南特可科技有限公司 | Logistics space optimization method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106355282B (en) | 2019-09-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106355282A (en) | Logistics loading optimizing method and device | |
| CN109583800B (en) | Logistics warehouse parcel sorting method, device and system | |
| Bartholdi et al. | Warehouse & Distribution Science: Release 0.89 | |
| EP2904511B1 (en) | Replenishing a retail facility | |
| US8805573B2 (en) | System and method for order fulfillment | |
| CN204507907U (en) | A kind of storage based on submersible AGV divides integral system | |
| US10223670B1 (en) | Bin content determination using flying automated aerial vehicles for imaging | |
| CN104555222A (en) | Storage and distribution integration system and method based on insert-type AGV | |
| JP5811040B2 (en) | Operation method of article sorting equipment and article sorting equipment | |
| CN109313731A (en) | The system of buffer-stored and object sequence including two elevators | |
| JP5863553B2 (en) | Sorting system | |
| CN111217067A (en) | Transport system, transport management device, and logistics layout | |
| KR101592939B1 (en) | Transport and stowage plan generating method and transport and stowage plan generating apparatus | |
| CN112678409A (en) | Goods processing method, device, equipment, system, storage medium and program product | |
| WO2017061632A1 (en) | Article loading device having loading logic | |
| US20160202941A1 (en) | Transport route planning | |
| CN108657705A (en) | Intelligent logistics warehouse and cargo storage method | |
| CN103057888B (en) | Automatic gravity type flue-cured tobacco lamina formula warehouse control system | |
| Sadjady | Physical flows | |
| Schmidt et al. | New design guidelines for in-plant milk-run systems | |
| CN203111911U (en) | Automatic gravity type flue-cured tobacco lamina formula warehouse control system | |
| CN104340574A (en) | Intelligent storage and transportation device | |
| CN109034707A (en) | A method of logistics route is stored through bar code management system | |
| CN115393003A (en) | Similarity-based multi-sorting-table-oriented order batching, sorting and sorting method and system | |
| CN114728746B (en) | Management system and article warehouse-in and warehouse-out management method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190913 Termination date: 20210831 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |