CN103745329B - A kind of economical logistics transportation allocator of internet of things oriented - Google Patents
A kind of economical logistics transportation allocator of internet of things oriented Download PDFInfo
- Publication number
- CN103745329B CN103745329B CN201310702496.2A CN201310702496A CN103745329B CN 103745329 B CN103745329 B CN 103745329B CN 201310702496 A CN201310702496 A CN 201310702496A CN 103745329 B CN103745329 B CN 103745329B
- Authority
- CN
- China
- Prior art keywords
- transportation
- vehicle
- current
- goods
- website
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of economical logistics transportation allocator of internet of things oriented, comprise the following steps：Current logistics transportation system is scanned, all transportation base, transportation network and haulage vehicle information is counted；Each transportation base current time goods information to be sent is counted using RFID technique；The empty wagons vehicle in all transportation bases is scanned, and is the assembly information of each vehicle distribution goods；Calculated for a selected empty wagons from the transportation base residing for the car to the most short transportation route other all transportation bases；A transportation route is chosen as the transportation route of Current vehicle；According to the fittage allocation flow of given transportation route, current transportation website shipment traffic program is calculated.The logistics transportation allocator of the present invention can improve the charging ratio of vehicle during logistics transportation as far as possible, while the goods of the farthest destination node of prioritizing selection is assembled when freighting every time, it is possible to increase the delivery ability successively of goods.
Description
Technical field
The present invention relates to a kind of economical logistics transportation allocator of internet of things oriented.
Background technology
Current logistic industry often can all improve the efficiency of logistics transportation as far as possible to improve business efficiency.But
The goods that loglstics enterprise is received daily is all during being in dynamic change constantly.In whole logistics system, each goods
The receiving station of thing is all receiving new goods to be sent all the time, at the same the goods of each website also the moment transport and
During circulation.Traditional logistics transportation allocator, is often divided into several regions, each by whole logistics transportation system
Fixed haulage vehicle is arranged between region, logistics goods and materials are periodically sent.The delivery plan of this goods and materials, does not both account for thing
The factor for the goods and materials amount dynamic change for needing to send between each website is provided, while can not be timely on every circuit
The number change of goods to be transported and dynamic adjusts traffic program, therefore in transportation, often easily there is vehicle cargo
It is discontented, or certain site goods the phenomenon such as overstocks, and a kind of logistics transportation distribution project more optimized of design is needed for this, to carry
The efficiency of high cargo transport.
The content of the invention
An Eco-power logistics transportation allocator is provided the present invention seeks to the defect existed for prior art, should
Method can adapt to the present situation of logistic industry goods and materials dynamic change to be transported, timely dynamic adjustment logistics transportation scheme so that
All haulage vehicle charging ratios are as high as possible in logistics system, and at utmost reduction goods is loaded and unloaded in the intermediate stations of transport
Number of times, accomplish the purpose once delivered as far as possible.
The present invention to achieve the above object, is adopted the following technical scheme that：A kind of economical logistics transportation of internet of things oriented
Allocator, comprises the following steps：
1）, scan current logistics transportation system, count all transportation base, transportation network and haulage vehicle letter
Breath；
2）, each transportation base current time goods information to be sent is counted using RFID technique；
3）, empty wagons vehicle in all transportation bases of scanning, and distribute for each vehicle the assembly information of goods；
4）, calculated for a selected empty wagons from the transportation base residing for the car to other all transportation bases
Most short transportation route；
5）, choose a transportation route as Current vehicle transportation route；
6）, according to the fittage allocation flow of given transportation route, calculate the transport of current transportation website shipment
Scheme；
7）, the traffic program generation when, the transportation base being sent to from the transportation base to farthest destination is counted first
Car loading；If these car loadings can fill vehicle, the vehicle only fills the transport of this parcel；If can not be by car
Fill, then continue to calculate the goods newly increased；
8）, calculate the goods that newly increases and mainly include transporting into current path time remote transportation base from current transportation website
Transport car loading；If now still vehicle can not be filled, continue choose closer to a transportation base, calculate its goods
Freight volume, until intermediate transportation website all in the path car loading to be sent all by statistics complete；
9）, when vehicle transport is to each intermediate transportation website, by the information of current transportation website and correlation goods
Thing information is all unloaded, while being transported using this current transportation website as starting point, recalculating from current transportation website to purpose
Freighting scheme between website；
10）, so constantly circulation, calculate needs the scheme ressembled in current transportation website, until vehicle transport extremely
Purpose transportation base, the cargo transport scheme of Current vehicle terminates.
Beneficial effects of the present invention：The present invention design based on the Eco-power logistics transportation method of Internet of Things, pass through design
Loading algorithm based on maximum distance, can improve the charging ratio of vehicle during logistics transportation as far as possible, while dress every time
The goods of the farthest destination node of prioritizing selection is assembled during goods, it is possible to increase the delivery ability successively of goods, and reduction goods exists
The hop count of intermediate node, while can greatly also improve the conevying efficiency of goods.
Brief description of the drawings
Fig. 1 is that task distribution object of the present invention chooses flow.
Fig. 2 is the fittage allocation flow of given path of the present invention.
Fig. 3 is the loading algorithm flow of the invention based on maximum distance.
Embodiment
The present invention relates to a kind of economical logistics transportation allocator of internet of things oriented, comprise the following steps：
1）, scan current logistics transportation system, count all transportation base, transportation network and haulage vehicle letter
Breath；
2）, each transportation base current time goods information to be sent is counted using RFID technique；
3）, empty wagons vehicle in all transportation bases of scanning, and distribute for each vehicle the assembly information of goods；
4）, calculated for a selected empty wagons from the transportation base residing for the car to other all transportation bases
Most short transportation route；
5）, choose a transportation route as Current vehicle transportation route；
6）, according to the fittage allocation flow of given transportation route, calculate the transport of current transportation website shipment
Scheme；
7）, the traffic program generation when, the transportation base being sent to from the transportation base to farthest destination is counted first
Car loading；If these car loadings can fill vehicle, the vehicle only fills the transport of this parcel；If can not be by car
Fill, then continue to calculate the goods newly increased；
8）, calculate the goods that newly increases and mainly include transporting into current path time remote transportation base from current transportation website
Transport car loading；If now still vehicle can not be filled, continue choose closer to a transportation base, calculate its goods
Freight volume, until intermediate transportation website all in the path car loading to be sent all by statistics complete；
9）, when vehicle transport is to each intermediate transportation website, by the information of current transportation website and correlation goods
Thing information is all unloaded, while being transported using this current transportation website as starting point, recalculating from current transportation website to purpose
Freighting scheme between website；
10）, so constantly circulation, calculate needs the scheme ressembled in current transportation website, until vehicle transport extremely
Purpose transportation base, the cargo transport scheme of Current vehicle terminates.
Wherein, in step 8）Afterwards, before statistics when car loading, if the car loading that a certain moment is counted is
Through that can fill vehicle, then Current vehicle fills the delivery of these goods；If vehicle can not be filled, by Current vehicle etc.
A unit interval is treated, is calculated again；If the vehicle had waited a unit interval before, vehicle is directly filled
These upper goods, are directly delivered with discontented state.
It can be seen from Fig. 1, firstly the need of grasping in current logistics transportation system before planning logistics transportation scheme, own
Transfer of supplies transportation base, each transfer transport website can receive client need send goods and materials, while the transport
Website also possesses ability on carriage of Cargo.When generating cargo transport scheme, scan first all available in current logistics system
In the empty wagons information of transport, and calculate whole transit node topo graph in current logistics system.From all empty wagons information
Successively using each as the object calculated, the location of each empty wagons transportation base is determined, based on the transportation base
Whole topo graph is scanned, is calculated from the transportation base into whole network topo graph, the shortest path of remaining all transportation base.
A transportation route is selected from all shortest paths afterwards as the cargo transport path of this current vehicle.Its path sheet
The foundation is judged in current path, in each transfer transport website passed through goods to be sent, if having some goods
Destination be some transportation base in current path, and the goods has surpassed in the current transfer transport website holdup time
Two days later.If there is such path, then choose the transit route that the path is Current vehicle at once, if there is no then from
In all paths, one transportation route of selection most long path as Current vehicle transportation route, afterwards to selected road
Footpath starts to generate the assembling scheme of goods.
The assembling scheme flow of whole goods is as shown in Figure 2.When carrying out Freighting, calculate first from current transportation station
Point is sent to all goods informations of distalmost end purpose transportation base on this paths, if these goods can fill Current vehicle
Full, then these goods are loaded directly on Current vehicle, if these goods can not fill vehicle, using based on most long distance
From loading algorithm calculate the transportation base to the whole Freighting scheme of point of destination.If according to the calculating used just now
Algorithm, can fill Current vehicle, then vehicle is directly filled goods and sent, if dress is discontented, undergo a time delay
After deliver.
When calculating assembling scheme, while the Freighting scheme of each intermediate transportation website in the path is calculated, each
The Freighting scheme of intermediate transportation website, the same loading algorithm using maximum distance is realized.
Loading algorithm implementation process based on maximum distance is as shown in Figure 3.It is calculated in loading process, first from current
Can the goods of website to purpose transportation base fill Current vehicle, the directly delivery if it can fill；If can not fill,
The preferential Freighting for choosing maximum distance.After the completion of these goods of maximum distance are all assembled, then choose secondary remote
Freighting, is so traveled through successively, after all scanning completion along the goods to all transportation bases on the path, the loading
Algorithm performs terminate, and obtain being sent to the delivering amount of each node from starting point S.
The foregoing is only presently preferred embodiments of the present invention, be not intended to limit the invention, it is all the present invention spirit and
Within principle, any modification, equivalent substitution and improvements made etc. should be included in the scope of the protection.
Claims (1)
1. a kind of economical logistics transportation allocator of internet of things oriented, comprises the following steps：
1) current logistics transportation system, is scanned, all transportation base, transportation network and haulage vehicle information is counted；
2), each transportation base current time goods information to be sent is counted using RFID technique；
3) the empty wagons vehicle in all transportation bases, is scanned, and is the assembly information of each vehicle distribution goods；
4), calculated for a selected empty wagons from the transportation base residing for the car to most short other all transportation bases
Transportation route；
5) transportation route, is chosen as the transportation route of Current vehicle；Its path in line with foundation be to judge current path
In, in each transfer transport website for being passed through goods to be sent, if during the destination for having some goods is current path
Some transportation base, and the goods alreadys exceed two days in the current transfer transport website holdup time；If there is such
Path, then choose the transit route that the path is Current vehicle at once, if there is no then from all paths, selects one
Transportation route most long path as Current vehicle transportation route；
6), according to the fittage allocation flow of given transportation route, current transportation website shipment traffic program is calculated；
7), the traffic program counts the goods for the transportation base being sent to from the transportation base to farthest destination first in generation
Object amount；If these car loadings can fill vehicle, the vehicle only fills the transport of this parcel；If vehicle can not be filled
It is full, then continue to calculate the goods newly increased；
8), calculating the goods newly increased mainly includes transporting into current path time fortune of remote transportation base from current transportation website
Defeated car loading；If now still vehicle can not be filled, continue choose closer to a transportation base, calculate the fortune of its goods
Throughput rate, until the car loading to be sent of intermediate transportation website all in the path is all completed by statistics；
9), when vehicle transport is to each intermediate transportation website, the goods of the information of current transportation website and correlation is believed
Breath all unloadings, while using this current transportation website as starting point, recalculating from current transportation website to purpose transportation base
Between Freighting scheme；
10), so constantly circulation, calculates the scheme ressembled in current transportation website needs, until vehicle transport to purpose
Transportation base, the cargo transport scheme of Current vehicle terminates,
In step 8) after, before statistics when car loading, if the car loading that a certain moment is counted can be by car
Fill, then Current vehicle fills the delivery of these goods；If vehicle can not be filled, Current vehicle is waited into a list
The position time, calculated again；If the vehicle had waited a unit interval before, vehicle directly loads onto these goods
Thing, is directly delivered with discontented state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310702496.2A CN103745329B (en) | 2013-12-19 | 2013-12-19 | A kind of economical logistics transportation allocator of internet of things oriented |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310702496.2A CN103745329B (en) | 2013-12-19 | 2013-12-19 | A kind of economical logistics transportation allocator of internet of things oriented |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103745329A CN103745329A (en) | 2014-04-23 |
| CN103745329B true CN103745329B (en) | 2017-10-24 |
Family
ID=50502346
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310702496.2A Active CN103745329B (en) | 2013-12-19 | 2013-12-19 | A kind of economical logistics transportation allocator of internet of things oriented |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103745329B (en) |
Families Citing this family (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105550840A (en) * | 2015-12-01 | 2016-05-04 | 合肥新创中原信息技术有限公司 | Logistics cloud system |
| EP3511883A4 (en) * | 2016-09-09 | 2020-01-22 | Hitachi Transport System, Ltd. | Evaluation device, evaluation method, and evaluation program |
| CN106709679B (en) * | 2016-11-28 | 2020-05-19 | 龙岩烟草工业有限责任公司 | Method and device for allocating tasks of stacker |
| CN108304980B (en) * | 2017-01-11 | 2021-07-13 | 顺丰速运有限公司 | Sorting machine and method and system for configuring waiting time of workpiece supply table |
| CN107767013A (en) * | 2017-08-29 | 2018-03-06 | 陈飞 | A kind of foundation lorry computing with words flow package method and system |
| CN107609714B (en) * | 2017-10-09 | 2020-07-03 | 上海悦彦信息科技有限公司 | Path planning method for tubular logistics system |
| CN107679764A (en) * | 2017-10-23 | 2018-02-09 | 钦州学院 | A kind of dynamic dispatching method of container hargour truck |
| CN108062642A (en) * | 2017-12-13 | 2018-05-22 | 宿州市皖发物流有限责任公司 | A kind of efficient logistics management method |
| CN110092158A (en) * | 2018-01-31 | 2019-08-06 | 上海海洋大学 | The dispatching method of crossed loops one-way circulation handling system |
| CN108983779B (en) * | 2018-07-24 | 2021-12-21 | 合肥哈工库讯智能科技有限公司 | AGV trolley traffic control regulation and control method based on path analysis |
| CN110826951A (en) * | 2018-08-10 | 2020-02-21 | 北京京东尚科信息技术有限公司 | Transportation line stowage method and device, electronic equipment and computer readable medium |
| CN111724086A (en) * | 2019-03-18 | 2020-09-29 | 北京京东尚科信息技术有限公司 | Distribution method and system of logistics orders, storage medium and electronic equipment |
| CN111144808A (en) * | 2019-12-20 | 2020-05-12 | 贵州黔岸科技有限公司 | Task statistical management system and method for building material transportation |
| CN111178810B (en) * | 2019-12-31 | 2023-06-20 | 北京百度网讯科技有限公司 | Method and device for generating information |
| CN111626578A (en) * | 2020-05-18 | 2020-09-04 | 上海东普信息科技有限公司 | Distribution method, device, equipment and storage medium of logistics truck |
| CN111612383A (en) * | 2020-06-11 | 2020-09-01 | 上海乾臻信息科技有限公司 | Logistics transport capacity regulating method and device |
| CN116911730B (en) * | 2023-09-11 | 2024-04-30 | 国网浙江省电力有限公司宁波供电公司 | Management method of intelligent transmission device of Internet of things and transmission device |
| CN117131149B (en) * | 2023-10-26 | 2024-01-23 | 四川国蓝中天环境科技集团有限公司 | Earth and rock point location and transportation network identification method based on GPS track of slag transport vehicle |
| CN117494922A (en) * | 2024-01-02 | 2024-02-02 | 全盛物流科技(山东)有限公司 | Logistics path planning method |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102445208A (en) * | 2011-09-21 | 2012-05-09 | 清华大学深圳研究生院 | Method for acquiring multiple vehicle navigation paths from map data |
-
2013
- 2013-12-19 CN CN201310702496.2A patent/CN103745329B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102445208A (en) * | 2011-09-21 | 2012-05-09 | 清华大学深圳研究生院 | Method for acquiring multiple vehicle navigation paths from map data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103745329A (en) | 2014-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103745329B (en) | A kind of economical logistics transportation allocator of internet of things oriented | |
| CN107844937B (en) | Logistics distribution management method and device | |
| WO2015062344A1 (en) | Cloud platform-based intelligent logistics goods delivery method and system | |
| CN109726863A (en) | A kind of material-flow method and system of multiple-objection optimization | |
| TW200802148A (en) | Method for optimal multi-vehicle dispatch and system for the same | |
| CN108364105A (en) | A kind of purpose optimal method of logistics distribution circuit | |
| CN106600201A (en) | Intelligent railway fast cargo transportation system and method | |
| CN108171460A (en) | A kind of Freight Transport method and its management system based on empty wagons resource peak use rate | |
| CN105678485A (en) | System and method for smart passenger and freight transportation | |
| CN103473663A (en) | Method, platform and system for scheduling physical distribution delivery | |
| Shen et al. | A new urban logistics transport system based on a public transit service | |
| CN105069592A (en) | Logistics information processing method and device | |
| CN107180280A (en) | Logistics route planning method and system based on path adaptation | |
| CN114662929A (en) | Logistics distribution method, logistics distribution system, electronic equipment and computer readable storage medium | |
| CN111861009A (en) | Intelligent route planning method, device and equipment | |
| CN104268727B (en) | A kind of logistics deployment methods, devices and systems | |
| Walha et al. | A rail-road PI-hub allocation problems: model and heuristic | |
| CN110443536A (en) | Shipping unmanned plane and its control method and device and corresponding system | |
| CN108303112A (en) | One city package delivery route planning system based on taxi group | |
| CN107730161A (en) | The method and apparatus for decomposing restructuring order according to route and carrier information | |
| CN113837495A (en) | Logistics trunk transportation scheduling optimization method based on multi-stage optimization | |
| JP2002259522A (en) | Efficiency improving system for load transportation service | |
| CN107767013A (en) | A kind of foundation lorry computing with words flow package method and system | |
| CN110956405A (en) | Intelligent express dispatching system and method based on public transportation system | |
| KR101321644B1 (en) | Method for wagon repositioning in railroad transportation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Huang Li Inventor after: Wang Dongyun Inventor after: Wei Bingui Inventor before: Huang Li Inventor before: Wang Dongyun Inventor before: Wei Bingui Inventor before: Luo Haibo Inventor before: Qiu Zhihong |
|
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20170803 Address after: 545006 No. 28, community Bay Road, Liuzhou, Guangxi Applicant after: Liuzhou Vocational & Technical College Applicant after: Guangxi University of Science and Technology Address before: 545006 No. 28, roundabout, Liuzhou, the Guangxi Zhuang Autonomous Region Applicant before: Liuzhou Vocational & Technical College |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |