CN109242211A - A kind of transportation network planing method, system, equipment and storage medium - Google Patents
A kind of transportation network planing method, system, equipment and storage medium Download PDFInfo
- Publication number
- CN109242211A CN109242211A CN201811201170.0A CN201811201170A CN109242211A CN 109242211 A CN109242211 A CN 109242211A CN 201811201170 A CN201811201170 A CN 201811201170A CN 109242211 A CN109242211 A CN 109242211A
- Authority
- CN
- China
- Prior art keywords
- route
- transport
- consuming
- transport capacity
- point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- 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)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention relates to a kind of transportation network planing method, system, equipment and storage mediums.This method includes the tolerable maximum time-consuming of outbox weight and target warehouse to default destination site in determining target warehouse, counts transport capacity resource；According to the time-consuming route for meeting timeliness requirement with the tolerable maximum time-consuming default the constraint relationship screening in target warehouse to default destination site of route transport；Meet the route of transport capacity according to the screening of the default the constraint relationship of the outbox weight in target warehouse and route transportation capability；The route transportation cost for meeting timeliness requirement and transport capacity is calculated, determines the minimum route of route transportation cost.The application makes full use of existing resource, and Optimizing Transport network guarantees to keep the whole network transportation cost minimum in the case that timeliness is reached with transport capacity, to realize that specific timeliness provides cost support.
Description
Technical field
The invention belongs to logistics technology more particularly to a kind of transportation network planing method, system, equipment and storage to be situated between
Matter.
Background technique
Under existing stream background, commodity can be delivered to faster and have become electric business and logistics company in user hand
One of core competitiveness.In order to enhance this core competitiveness, client's public praise is promoted, most of company blindly selection can increase certain
The warehouse and transportation route in one area, the considerations of often ignoring to oneself existing global transportation network, it is unnecessary to increase
Transportation cost.
Summary of the invention
In order to solve the above-mentioned technical problem, the purpose of the present invention is to provide a kind of transportation network planing method, system, set
Standby and storage medium.
According to an aspect of the invention, there is provided a kind of transportation network planing method, comprising:
Determine that outbox weight and target warehouse to the default destination site in target warehouse are tolerable maximum time-consuming, statistics fortune
Power resource；
It is closed according to route transport is time-consuming with the tolerable maximum time-consuming default constraint in target warehouse to default destination site
System's screening meets the route of timeliness requirement；
Meet transport capacity according to the screening of the default the constraint relationship of the outbox weight in target warehouse and route transportation capability
Route；
The route transportation cost for meeting timeliness requirement and transport capacity is calculated, determines the minimum route of transportation cost.
Preferably, the transport capacity resource includes existing transport capacity resource and can increase transport capacity resource newly, the existing transport power is provided
Source includes existing line and the corresponding transport of the route is time-consuming, transportation cost and transport capacity, described to increase transport capacity resource packet newly
Route and the corresponding transport time-consuming of the route, transportation cost and transport capacity can be increased newly by including.
Preferably, route transport it is time-consuming with target warehouse to default destination site it is tolerable it is maximum it is time-consuming it is default about
Beam relationship are as follows:
Wherein,
xijFor the route selection in transportation network from i point to j point, xijWhen=1, the route, x are selectedijWhen=0, do not select
The route,
tijIt is time-consuming to be transported in transportation network from i point to the route of j point,
TiendIt is time-consuming for the tolerable maximum transport in transportation network from i point to j point.
Preferably, the outbox weight in target warehouse and the default the constraint relationship of route transportation capability are as follows:
∑xij*Wtstart≤CAPij
Wherein,
WtstartFor sometime point, outbox weight from target warehouse,
CAPijFor in transportation network from i point to the maximum transport capacity of j point.
Preferably, transportation network planing method further include:
Target warehouse to default destination site, which is calculated, according to goal-selling function meets timeliness requirement and transport capacity
Minimum rate of accumulation road transportation cost in route, the goal-selling function are as follows:
min∑xij*Cij
Wherein,
CijFor in transportation network from i point to the transportation cost of j point.
According to another aspect of the present invention, a kind of transportation network planning system is provided, comprising:
Configuration and statistic unit, outbox weight and target warehouse to default destination site for determining target warehouse can
Allow maximum time-consuming, counts transport capacity resource；
Timeliness constraint element, it is time-consuming tolerable maximum time-consuming with target warehouse to default destination site according to route transport
Default the constraint relationship screening meet timeliness requirement route；
Transport capacity constraint element is sieved according to the default the constraint relationship of the outbox weight in target warehouse and route transportation capability
The route for the sufficient transport capacity that is full；
Inexpensive route determination unit calculates the route transportation cost for meeting timeliness requirement and transport capacity, determines route
The minimum route of transportation cost.
Preferably, the transport capacity resource includes existing transport capacity resource and can increase transport capacity resource newly, the existing transport power is provided
Source includes existing line and the corresponding transport of the route is time-consuming, transportation cost and transport capacity, described to increase transport capacity resource packet newly
Route and the corresponding transport time-consuming of the route, transportation cost and transport capacity can be increased newly by including.
Preferably, route transport it is time-consuming with target warehouse to default destination site it is tolerable it is maximum it is time-consuming it is default about
Beam relationship are as follows:
Wherein,
xijFor the route selection in transportation network from i point to j point, xijWhen=1, the route, x are selectedijWhen=0, do not select
The route,
tijIt is time-consuming to be transported in transportation network from i point to the route of j point,
TiendIt is time-consuming for the tolerable maximum transport in transportation network from i point to j point.
Preferably, the outbox weight in target warehouse and the default the constraint relationship of route transportation capability are as follows:
∑xij*Wtstart≤CAPij
Wherein,
WtstartFor sometime point, outbox weight from target warehouse,
CAPijFor in transportation network from i point to the maximum transport capacity of j point.
Preferably, transportation network planning system further include:
Transportation cost computing unit calculates target warehouse to default destination site according to goal-selling function and meets timeliness
It is required that with minimum rate of accumulation road transportation cost in the route of transport capacity, the goal-selling function are as follows:
min∑xij*Cij
Wherein,
CijFor in transportation network from i point to the transportation cost of j point.
According to another aspect of the present invention, a kind of transportation network planning apparatus is provided, comprising:
One or more processors；
Memory, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of places
It manages device and executes as above described in any item methods.
According to another aspect of the present invention, a kind of computer-readable storage medium for being stored with computer program is provided
Matter realizes as above described in any item methods when the program is executed by processor.
Compared with prior art, the invention has the following advantages:
The exemplary transportation network planing method of the present invention, it is contemplated that global transportation network counts existing transport capacity resource and can
Newly-increased transport capacity resource, by route transport it is time-consuming with target warehouse to default destination site it is tolerable it is maximum it is time-consuming it is default about
Beam relationship carries out timeliness constraint, is transported by the outbox weight in target warehouse and the default the constraint relationship of route transportation capability
The constraint of ability finally determines the minimum route of transportation cost, avoids warehouse and fortune that a certain area is increased in blindly selection
The wasting of resources caused by defeated route, makes full use of existing resource, and Optimizing Transport network guarantees that timeliness reaches the feelings with transport capacity
Make the whole network transportation cost minimum under condition.
In addition, by the constraint of timeliness constraint and transport capacity, and calculate the line for meeting timeliness requirement and transport capacity
Road transportation cost, it is determined that extra cost needed for enterprise reaches specific timeliness can also determine and maintain current timeliness institute of enterprise
The least cost needed.
The exemplary transportation network planning system of the present invention, including configuration and statistic unit, for determining the hair in target warehouse
Part weight and target warehouse to default destination site are tolerable maximum time-consuming, count transport capacity resource；Timeliness constraint element, according to
When the time-consuming default the constraint relationship screening time-consuming with the tolerable maximum in target warehouse to default destination site of route transport meets
Imitate desired route；Transport capacity constraint element, according to the default constraint of the outbox weight in target warehouse and route transportation capability
Relationship screens the route for meeting transport capacity；Inexpensive route determination unit calculates the line for meeting timeliness requirement and transport capacity
Road transportation cost determines the minimum route of route transportation cost.Cooperated by said units, count existing transport capacity resource and
Transport capacity resource can be increased newly, based on global transportation network, make full use of existing resource, avoid the warehouse for blindly increasing a certain area
And the wasting of resources caused by transportation route, the setting of constraint condition and transport capacity constraint condition is reached by timeliness, is guaranteed
Timeliness makes the whole network transportation cost minimum in the case where reaching with transport capacity, realize the optimization of transportation network.
The exemplary transportation network planning apparatus of the present invention and storage medium, it is contemplated that global transportation network fully considers existing
There is transport capacity resource and transport capacity resource can be increased newly, caused by reducing warehouse and transportation route because of a certain area of blindness selection increase
The wasting of resources makes full use of existing resource, reaches constraint and transport capacity constraint by the way that timeliness is arranged, Optimizing Transport network is protected
Card timeliness keeps the whole network transportation cost minimum in the case where reaching with transport capacity.
Detailed description of the invention
Fig. 1 is the flow chart of the method for the present invention；
Fig. 2 is the line information figure of the method for the present invention model；
Fig. 3 sends information table with charge free for target warehouse；
Fig. 4 is the method for the present invention model output information figure；
Fig. 5 is integer programming model of the present invention just scheme；
Fig. 6 is general frame figure of the invention.
Specific embodiment
In order to be better understood by technical solution of the present invention, combined with specific embodiments below, Figure of description is to the present invention
It is described further.
Present embodiments provide a kind of transportation network planing method, comprising:
S1, the outbox weight for determining target warehouse and target warehouse to default destination site are tolerable maximum time-consuming, system
Count transport capacity resource；
Wherein, the transport capacity resource includes existing transport capacity resource and can increase transport capacity resource, the existing transport capacity resource packet newly
Include existing line and the corresponding transport of the route be time-consuming, transportation cost and transport capacity, it is described increase newly transport capacity resource include can
Newly-increased route and the corresponding transport time-consuming of the route, transportation cost and transport capacity.
S2, it may be allowed maximum time-consuming default constraint with target warehouse to default destination site according to route transport is time-consuming
Relationship screening meets the route of timeliness requirement；
Wherein, route transport is time-consuming closes with the tolerable maximum time-consuming default constraint in target warehouse to default destination site
System are as follows:
Wherein,
xijFor, from i point to the route selection of j point, i and j are the node in transportation network, the transport in transportation network
Network node includes at least warehouse, transit depot and destination site,
xijWhen=1, the route, x are selectedijWhen=0, the route is not selected,
tijIt is time-consuming to be transported in transportation network from i point to the route of j point,
TiendIt is time-consuming for the tolerable maximum transport in transportation network from i point to j point.
It should be noted that herein the straight hair route of i to j only one, and cost and transport capacity are it is known that if from i
To the process stop over of j other nodes k, then xij=1 is xik=1, xkj=1.
S3, transport capacity is met according to the default the constraint relationship screening of the outbox weight and route transportation capability in target warehouse
Route；
Wherein, the default the constraint relationship of the outbox weight and route transportation capability in target warehouse are as follows:
∑xij*wtstart≤CAPij
Wherein,
WtstartFor sometime point, outbox weight from target warehouse,
CAPijFor in transportation network from i point to the maximum transport capacity of j point.
It is to be understood that meeting timeliness requires the limitation for having no tandem with transport capacity, only need the two full simultaneously
Foot.
S4, calculating meet the route transportation cost of timeliness requirement and transport capacity, determine the minimum line of route transportation cost
Road.
Wherein, according to goal-selling function calculate target warehouse to default destination site route in meet timeliness require and
The minimum rate of accumulation road transportation cost of transport capacity, the goal-selling function are as follows:
min∑xij*Cij
Wherein,
CijFor in transportation network from i point to the transportation cost of j point.
The integer programming model scheme that this method model uses, mode input are as follows:
On the one hand, the express mail received before some period of certain warehouse is formulated, determines addressee weight, is reached from the warehouse each
A destination city timeliness expectation (same day, secondary morning, the next day etc.).Such as Fig. 3, Fig. 3 sends information table with charge free for target warehouse, in the figure
Information include target bin library send part to be sent to default destination city, the target warehouse addressee period and send requirement with charge free, such as:
This warehouse, addressee before 12 points, and destination are that the express mail in Shanghai will be sent on the same day, and Fig. 3 further comprises addressee weight, i.e. mesh
Mark the outbox weight in warehouse.Therefore, the information of Fig. 3 include target warehouse to default destination site it is tolerable maximum time-consuming and
The outbox weight in target warehouse.
On the other hand, statistics company has in transportation network, the supply line between storage, middle swivel link and final destination
Road time-consuming, transport capacity and unit cost, route and its transport power, required additional cost can be increased newly by counting each region.Fig. 2
For the line information of this method model, including timeliness requirement, existing line, it can increase that route, line capacity, route be time-consuming and line newly
Road cost, line capacity include existing line ability and can increase line capacity newly, and route time-consuming includes existing line time-consuming and can
Newly-increased route is time-consuming, and line cost includes existing line cost and can increase line cost newly.Every route designates 0/ in Fig. 2
1,0/1 is decision variable, and 1 is selection current line, and 0 is not select current line.
The output of this method model is as follows:
As shown in figure 4, Fig. 4 is the output quantity of this method model, i.e., the exportable cost met under current timeliness is minimum
Route.
The present embodiment additionally provides a kind of transportation network planning system, comprising:
Configuration and statistic unit, outbox weight and target warehouse to default destination site for determining target warehouse can
Allow maximum time-consuming, counts transport capacity resource；
Wherein, the transport capacity resource includes existing transport capacity resource and can increase transport capacity resource, the existing transport capacity resource packet newly
Include existing line and the corresponding transport of the route be time-consuming, transportation cost and transport capacity, it is described increase newly transport capacity resource include can
Newly-increased route and the corresponding transport time-consuming of the route, transportation cost and transport capacity.
Timeliness constraint element, it is time-consuming tolerable maximum time-consuming with target warehouse to default destination site according to route transport
Default the constraint relationship screening meet timeliness requirement route；
Wherein, route transport is time-consuming closes with the tolerable maximum time-consuming default constraint in target warehouse to default destination site
System are as follows:
Wherein,
xijFor the route selection in transportation network from i point to j point, xijWhen=1, the route, x are selectedijWhen=0, do not select
The route,
tijIt is time-consuming to be transported in transportation network from i point to the route of j point,
TiendIt is time-consuming for the tolerable maximum transport in transportation network from i point to j point.
Transport capacity constraint element is sieved according to the default the constraint relationship of the outbox weight in target warehouse and route transportation capability
The route for the sufficient transport capacity that is full；
Wherein, the default the constraint relationship of the outbox weight and route transportation capability in target warehouse are as follows:
∑xij*Wtstart≤CAPij
Wherein,
WtstartFor sometime point, outbox weight from target warehouse,
CAPijFor in transportation network from i point to the maximum transport capacity of j point.
Inexpensive route determination unit calculates the route transportation cost for meeting timeliness requirement and transport capacity, determines route
The minimum route of transportation cost.
Transportation cost computing unit calculates full in the route of target warehouse to default destination site according to goal-selling function
Sufficient timeliness requires and the minimum rate of accumulation road transportation cost of transport capacity, the goal-selling function are as follows:
min∑xij*Cij
Wherein,
CijFor in transportation network from i point to the transportation cost of j point.
The present embodiment additionally provides a kind of transportation network planning apparatus, comprising:
One or more processors；
Memory, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of places
Reason device executes method described above.
The present embodiment additionally provides a kind of computer readable storage medium for being stored with computer program,
The program realizes method described above when being executed by processor.
Above description is only the preferred embodiment of the application and the explanation to institute's application technology principle.Those skilled in the art
Member is it should be appreciated that invention scope involved in the application, however it is not limited to technology made of the specific combination of above-mentioned technical characteristic
Scheme, while should also cover in the case where not departing from inventive concept, it is carried out by above-mentioned technical characteristic or its equivalent feature any
Other technical solutions of combination and formation.Such as features described above and (but being not limited to) disclosed herein have similar functions
Technical characteristic is replaced mutually and the technical solution that is formed.
Claims (12)
1. a kind of transportation network planing method characterized by comprising
Determine that outbox weight and target warehouse to the default destination site in target warehouse are tolerable maximum time-consuming, statistics transport power money
Source；
It is sieved according to route transport is time-consuming with the tolerable maximum time-consuming default the constraint relationship in target warehouse to default destination site
The route that the sufficient timeliness that is full requires；
Meet the route of transport capacity according to the screening of the default the constraint relationship of the outbox weight in target warehouse and route transportation capability；
The route transportation cost for meeting timeliness requirement and transport capacity is calculated, determines the minimum route of transportation cost.
2. a kind of transportation network planing method according to claim 1, which is characterized in that the transport capacity resource includes existing
Transport capacity resource and can increase transport capacity resource newly, the existing transport capacity resource include existing line and the corresponding transport time-consuming of the route,
Transportation cost and transport capacity, the transport capacity resource that increases newly includes that can increase route and the corresponding transport time-consuming of the route, fortune newly
Defeated cost and transport capacity.
3. a kind of transportation network planing method according to claim 1, which is characterized in that route transport time-consuming and target bin
The tolerable maximum time-consuming default the constraint relationship in library to default destination site are as follows:
Wherein,
xijFor the route selection in transportation network from i point to j point, xijWhen=1, the route, x are selectedijWhen=0, the line is not selected
Road,
tijIt is time-consuming to be transported in transportation network from i point to the route of j point,
TiendIt is time-consuming for the tolerable maximum transport in transportation network from i point to j point.
4. a kind of transportation network planing method according to claim 1, which is characterized in that the outbox weight in target warehouse with
The default the constraint relationship of route transportation capability are as follows:
∑xij*Wtstart≤CAPij
Wherein,
WtstartFor sometime point, outbox weight from target warehouse,
CAPijFor in transportation network from i point to the maximum transport capacity of j point.
5. a kind of transportation network planing method according to claim 1, which is characterized in that further include:
The route that target warehouse to default destination site meets timeliness requirement and transport capacity is calculated according to goal-selling function
Middle minimum rate of accumulation road transportation cost, the goal-selling function are as follows:
min∑xij*Cij
Wherein,
CijFor in transportation network from i point to the transportation cost of j point.
6. a kind of transportation network planning system characterized by comprising
Configuration and statistic unit, the outbox weight and target warehouse to default destination site for determining target warehouse are tolerable
It is maximum time-consuming, count transport capacity resource；
Timeliness constraint element, it is time-consuming pre- with the tolerable maximum time-consuming in target warehouse to default destination site according to route transport
If the constraint relationship screening meets the route of timeliness requirement；
Transport capacity constraint element screens full according to the default the constraint relationship of the outbox weight in target warehouse and route transportation capability
The route of sufficient transport capacity；
Inexpensive route determination unit calculates the route transportation cost for meeting timeliness requirement and transport capacity, determines that route transports
The minimum route of cost.
7. transportation network planning system according to claim 6, which is characterized in that the transport capacity resource includes existing transport power
Resource includes that existing line and the corresponding transport of the route are time-consuming, transports with that can increase transport capacity resource, the existing transport capacity resource newly
Cost and transport capacity, it is described increase newly transport capacity resource include can increase newly route and the corresponding transport of the route are time-consuming, transport at
Sheet and transport capacity.
8. transportation network planning system according to claim 6, which is characterized in that route transport time-consuming and target warehouse are extremely
The default tolerable maximum time-consuming default the constraint relationship in destination site are as follows:
Wherein,
xijFor the route selection in transportation network from i point to j point, xijWhen=1, the route, x are selectedijWhen=0, the line is not selected
Road,
tijIt is time-consuming to be transported in transportation network from i point to the route of j point,
TiendIt is time-consuming for the tolerable maximum transport in transportation network from i point to j point.
9. transportation network planning system according to claim 6, which is characterized in that the outbox weight and route in target warehouse
The default the constraint relationship of transport capacity are as follows:
∑xij*Wtstart≤CAPij
Wherein,
WtstartFor sometime point, outbox weight from target warehouse,
CAPijFor in transportation network from i point to the maximum transport capacity of j point.
10. transportation network planning system according to claim 6, which is characterized in that further include:
Transportation cost computing unit calculates target warehouse to default destination site according to goal-selling function and meets timeliness requirement
With minimum rate of accumulation road transportation cost in the route of transport capacity, the goal-selling function are as follows:
min∑xij*Cij
Wherein,
CijFor in transportation network from i point to the transportation cost of j point.
11. a kind of equipment, characterized in that the equipment includes:
One or more processors；
Memory, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processors
Execute method according to any one of claims 1 to 5.
12. a kind of computer readable storage medium for being stored with computer program, characterized in that when the program is executed by processor
Realize method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811201170.0A CN109242211A (en) | 2018-10-16 | 2018-10-16 | A kind of transportation network planing method, system, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811201170.0A CN109242211A (en) | 2018-10-16 | 2018-10-16 | A kind of transportation network planing method, system, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109242211A true CN109242211A (en) | 2019-01-18 |
Family
ID=65053556
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811201170.0A Pending CN109242211A (en) | 2018-10-16 | 2018-10-16 | A kind of transportation network planing method, system, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109242211A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110490507A (en) * | 2019-07-04 | 2019-11-22 | 丰图科技(深圳)有限公司 | A kind of newly-increased wireline inspection method, device and equipment of logistics network |
| CN111340431A (en) * | 2020-03-27 | 2020-06-26 | 上海东普信息科技有限公司 | Method, device and equipment for planning transportation route and storage medium |
| CN112183860A (en) * | 2020-09-28 | 2021-01-05 | 上海寻梦信息技术有限公司 | Dynamic routing method and device for warehouse-left package, electronic equipment and storage medium |
| CN112418584A (en) * | 2019-08-23 | 2021-02-26 | 深圳顺丰泰森控股(集团)有限公司 | Task planning method and device, computer equipment and storage medium |
| CN112686706A (en) * | 2020-12-31 | 2021-04-20 | 重庆运点点物流科技有限公司 | Multi-parameter-based ship shipping cost estimation method |
| CN112749931A (en) * | 2019-10-31 | 2021-05-04 | 顺丰科技有限公司 | Object transportation method, device, object transportation equipment and storage medium |
| CN112837001A (en) * | 2019-11-22 | 2021-05-25 | 顺丰科技有限公司 | Logistics network planning method and device and computer readable storage medium |
| CN113077103A (en) * | 2021-04-16 | 2021-07-06 | 北京京东振世信息技术有限公司 | Transportation network planning method and device |
| CN113128820A (en) * | 2020-01-16 | 2021-07-16 | 北京京东振世信息技术有限公司 | Method, apparatus, device and computer readable medium for evaluating warehouse adjustment plans |
| CN113259144A (en) * | 2020-02-07 | 2021-08-13 | 北京京东振世信息技术有限公司 | Storage network planning method and device |
| CN113537866A (en) * | 2020-04-20 | 2021-10-22 | 北京京东振世信息技术有限公司 | Method, apparatus and storage medium for determining product distribution parameters |
| CN113673932A (en) * | 2021-08-24 | 2021-11-19 | 北京京东振世信息技术有限公司 | Logistics network planning method and device |
| CN113762869A (en) * | 2021-01-29 | 2021-12-07 | 北京京东振世信息技术有限公司 | Transportation task processing method and device |
| CN113902359A (en) * | 2020-07-06 | 2022-01-07 | 上海顺如丰来技术有限公司 | Logistics distribution path planning method and device, computer equipment and storage medium |
| CN114066345A (en) * | 2020-08-10 | 2022-02-18 | 上海顺如丰来技术有限公司 | Method, device, server and storage medium for planning transit transportation |
| CN114693180A (en) * | 2022-05-30 | 2022-07-01 | 广东省信息工程有限公司 | Intelligent material protection and supply system based on information creation environment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160048802A1 (en) * | 2014-08-13 | 2016-02-18 | Tianyu Luwang | Transportation planning for a regional logistics network |
| CN107944598A (en) * | 2017-10-31 | 2018-04-20 | 苏宁云商集团股份有限公司 | A kind of logistics route collocation method and system |
| CN108154325A (en) * | 2016-12-06 | 2018-06-12 | 钟志刚 | Intelligent logistics transportation networks |
| CN108399464A (en) * | 2017-09-27 | 2018-08-14 | 圆通速递有限公司 | A kind of multimodal transport method for optimizing route and system |
-
2018
- 2018-10-16 CN CN201811201170.0A patent/CN109242211A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160048802A1 (en) * | 2014-08-13 | 2016-02-18 | Tianyu Luwang | Transportation planning for a regional logistics network |
| CN108154325A (en) * | 2016-12-06 | 2018-06-12 | 钟志刚 | Intelligent logistics transportation networks |
| CN108399464A (en) * | 2017-09-27 | 2018-08-14 | 圆通速递有限公司 | A kind of multimodal transport method for optimizing route and system |
| CN107944598A (en) * | 2017-10-31 | 2018-04-20 | 苏宁云商集团股份有限公司 | A kind of logistics route collocation method and system |
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110490507A (en) * | 2019-07-04 | 2019-11-22 | 丰图科技(深圳)有限公司 | A kind of newly-increased wireline inspection method, device and equipment of logistics network |
| CN112418584A (en) * | 2019-08-23 | 2021-02-26 | 深圳顺丰泰森控股(集团)有限公司 | Task planning method and device, computer equipment and storage medium |
| CN112749931A (en) * | 2019-10-31 | 2021-05-04 | 顺丰科技有限公司 | Object transportation method, device, object transportation equipment and storage medium |
| CN112749931B (en) * | 2019-10-31 | 2023-03-28 | 顺丰科技有限公司 | Object transportation method, device, object transportation equipment and storage medium |
| CN112837001A (en) * | 2019-11-22 | 2021-05-25 | 顺丰科技有限公司 | Logistics network planning method and device and computer readable storage medium |
| CN113128820B (en) * | 2020-01-16 | 2024-03-01 | 北京京东振世信息技术有限公司 | Method, apparatus, device and computer readable medium for evaluating warehouse adjustment plans |
| CN113128820A (en) * | 2020-01-16 | 2021-07-16 | 北京京东振世信息技术有限公司 | Method, apparatus, device and computer readable medium for evaluating warehouse adjustment plans |
| CN113259144B (en) * | 2020-02-07 | 2024-05-24 | 北京京东振世信息技术有限公司 | Warehouse network planning method and device |
| CN113259144A (en) * | 2020-02-07 | 2021-08-13 | 北京京东振世信息技术有限公司 | Storage network planning method and device |
| CN111340431B (en) * | 2020-03-27 | 2021-11-09 | 上海东普信息科技有限公司 | Method, device and equipment for planning transportation route and storage medium |
| CN111340431A (en) * | 2020-03-27 | 2020-06-26 | 上海东普信息科技有限公司 | Method, device and equipment for planning transportation route and storage medium |
| CN113537866A (en) * | 2020-04-20 | 2021-10-22 | 北京京东振世信息技术有限公司 | Method, apparatus and storage medium for determining product distribution parameters |
| CN113902359A (en) * | 2020-07-06 | 2022-01-07 | 上海顺如丰来技术有限公司 | Logistics distribution path planning method and device, computer equipment and storage medium |
| CN114066345A (en) * | 2020-08-10 | 2022-02-18 | 上海顺如丰来技术有限公司 | Method, device, server and storage medium for planning transit transportation |
| CN112183860B (en) * | 2020-09-28 | 2024-05-03 | 上海寻梦信息技术有限公司 | Method, device, electronic equipment and storage medium for dynamic routing of warehouse package |
| CN112183860A (en) * | 2020-09-28 | 2021-01-05 | 上海寻梦信息技术有限公司 | Dynamic routing method and device for warehouse-left package, electronic equipment and storage medium |
| CN112686706B (en) * | 2020-12-31 | 2023-06-27 | 重庆运点点物流科技有限公司 | Ship shipping cost prediction method based on multiple parameters |
| CN112686706A (en) * | 2020-12-31 | 2021-04-20 | 重庆运点点物流科技有限公司 | Multi-parameter-based ship shipping cost estimation method |
| CN113762869A (en) * | 2021-01-29 | 2021-12-07 | 北京京东振世信息技术有限公司 | Transportation task processing method and device |
| CN113077103A (en) * | 2021-04-16 | 2021-07-06 | 北京京东振世信息技术有限公司 | Transportation network planning method and device |
| CN113673932A (en) * | 2021-08-24 | 2021-11-19 | 北京京东振世信息技术有限公司 | Logistics network planning method and device |
| CN113673932B (en) * | 2021-08-24 | 2024-06-18 | 北京京东振世信息技术有限公司 | Logistics network planning method and device |
| CN114693180A (en) * | 2022-05-30 | 2022-07-01 | 广东省信息工程有限公司 | Intelligent material protection and supply system based on information creation environment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109242211A (en) | A kind of transportation network planing method, system, equipment and storage medium | |
| Waserhole et al. | Pricing techniques for self regulation in vehicle sharing systems | |
| CN109472441B (en) | Method, processing device, equipment and storage medium for allocating materials | |
| Angelelli et al. | Congestion avoiding heuristic path generation for the proactive route guidance | |
| Cai et al. | Failure-resilient DAG task scheduling in edge computing | |
| US9075832B2 (en) | Tenant placement in multitenant databases for profit maximization | |
| Krile et al. | Non-linear mini-max problem of multi-stop flight routes | |
| CN108833294B (en) | Low-bandwidth-overhead flow scheduling method for data center wide area network | |
| US9686099B2 (en) | Updating virtual network maps | |
| Shahzaad et al. | Top-k dynamic service composition in skyway networks | |
| Giesen et al. | A method for solving the multi‐objective transit frequency optimization problem | |
| Campuzano et al. | A Multi-start VNS Algorithm for the TSP-D with Energy Constraints | |
| Larrain et al. | Public transit corridor assignment assuming congestion due to passenger boarding and alighting | |
| CN113077106A (en) | Time window-based article transportation method and device | |
| US9473354B2 (en) | Assigning resources to resource-utilising entities | |
| US11108625B2 (en) | Computer system and method for message routing | |
| Gidofalvi et al. | Cab-sharing: An effective, door-to-door, on-demand transportation service | |
| CN114118632B (en) | Distribution route determining method and device, electronic equipment and readable storage medium | |
| Min et al. | Effective evacuation route planning algorithms by updating earliest arrival time of multiple paths | |
| CN112862135B (en) | Express delivery route planning method, device, server and storage medium | |
| Goswami et al. | One-shot coordination of feeder vehicles for multi-modal transportation | |
| Mrsic et al. | Smart tourist destination management using demand forecasting techniques: Using big data for destination demand forecasting as part of a destination management system | |
| CN112308267B (en) | Route group determination method, device, network equipment and storage medium | |
| Wang et al. | Facility location with congestion and priority in drone-based emergency delivery | |
| Ma et al. | Research on hub location and routing distribution for Hub-and-Spoke logistics network |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190118 |