CN105809402A - Freight information processing method and system based on BFS algorithm - Google Patents
Freight information processing method and system based on BFS algorithm Download PDFInfo
- Publication number
- CN105809402A CN105809402A CN201610140913.2A CN201610140913A CN105809402A CN 105809402 A CN105809402 A CN 105809402A CN 201610140913 A CN201610140913 A CN 201610140913A CN 105809402 A CN105809402 A CN 105809402A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- approach
- freight
- shipping
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 9
- 230000010365 information processing Effects 0.000 title claims abstract description 8
- 238000013459 approach Methods 0.000 claims abstract description 50
- 238000002360 preparation method Methods 0.000 claims abstract description 9
- 238000004458 analytical method Methods 0.000 claims abstract description 5
- 238000010276 construction Methods 0.000 claims abstract description 4
- 238000000034 method Methods 0.000 claims description 32
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 claims description 5
- 238000005457 optimization Methods 0.000 abstract description 3
- 238000012545 processing Methods 0.000 abstract description 2
- 238000007599 discharging Methods 0.000 description 8
- 238000012546 transfer Methods 0.000 description 4
- 239000002699 waste material Substances 0.000 description 3
- 229910000831 Steel Inorganic materials 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 239000010959 steel Substances 0.000 description 2
- 238000003860 storage Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000005304 joining Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
- 238000012360 testing method 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
Abstract
The invention provides a freight information processing method and system based on a BFS (breadth-first search) algorithm. The system mainly comprises a data obtaining module used for obtaining practical freight data information; a model construction module used for establishing a freight model according to the data information obtained by the data obtaining module, wherein the freight model is characterized in that places in approach data are set as nodes in an undirected connected graph, and the approaches among the places in the approach data stand for edges in the undirected connected graph; an analysis module and a freight data setting module, wherein the freight data setting module further comprises a node data preparation module, an edge data preparation module and a BFS operation module. The freight information processing method and system effectively improve the optimization processing efficiency of mass freight information and facilitate the subsequent freight plan guidance and making.
Description
Technical field
The present invention relates to intelligent optimization method and system, particularly relate to a kind of ship data processing method based on BFS algorithm and system.
Background technology
At present, shipping present situation is also in extensive developmental stage, and the sky of return car and boat is sailed transport power and can't be fully used, and the actual waste of objective resource is serious, and shipping expenses remains high on the one hand, and transport capacity resource waste is serious on the other hand.Existing goods is joined goods station and is also rested on original driver and look for goods and goods to look for the stage of car；How to reduce the transport power waste in transportation and reduce the cost of transportation, improve the efficiency of shipping, improve the service efficiency to actual freight transport resource, it is accomplished by the data messages such as the traveling road conditions to car and boat and carries out systematic analysis, needs according to goods transport optimize actual ship data and processing mode thereof, the invention solves given goods, starting point and destination, from different means of transportation and transportation route, according to the restriction element such as time priority, the problem calculating intelligently and selecting optimal path data set-up mode.
Present invention innovation BFS algorithm is conducted in-depth research, and verify based on mass data analog simulation and field test, successfully propose the path intelligent optimization method based on above-mentioned algorithm and system, and efficiently solve the problem of ship data configuration when car and boat run.
Summary of the invention
The invention provides a kind of freight information processing method based on BFS and system, specifically, technical scheme provided by the invention is as follows.
First, the invention provides a kind of freight information based on BFS algorithm and process system, described system includes:
Data acquisition module, is used for obtaining actual ship data information；
Model construction module, for the data message obtained according to described data acquisition module, sets up shipping model；Described shipping model is the node that the place in approach data is set in Connected undigraph, and the approach between place in described approach data is expressed as the limit in Connected undigraph；
Analysis module, analyzes the influence factor during ship data is arranged；And
Ship data arranges module, for according to described ship data information, shipping model, ship data set-up mode influence factor, by BFS algorithm obtain optimal path data set-up mode；Described ship data arranges module and comprises node data preparation module, limit data preparation module and BFS computing module further.
Preferably, in described shipping model: the location table in approach data is shown as in Connected undigraph node, and the location table in described approach data is shown as node set { V0,V1,V2,...,Vm,...,Vn, wherein starting point is node V0, destination is node Vn；
The approach between place in described approach data is expressed as the limit in Connected undigraph, and the total cost data between place and the weights on limit described in time data Connected undigraph in described approach data are expressed as { S0,S1,S2,...,Sm,...,SnAnd { T0,T1,T2,...,Tm,...,Tn}。
Additionally, present invention also offers a kind of freight information processing method based on BFS algorithm, described method comprises the steps:
Build shipping model, the influence factor analyzed in ship data set-up mode according to actual ship data, and calculate acquisition optimal path data set-up mode；Described shipping model is the node that the place in approach data is set in Connected undigraph, and the approach between place in described approach data is expressed as the limit in Connected undigraph；
Based on the actual ship data obtained, set up based on after the described shipping model of Connected undigraph, the factor of the different types of ship data set-up mode of analyzing influence.
Preferably, described structure shipping model specifically includes that
Location table in approach data is shown as in Connected undigraph node, and the location table in described approach data is shown as node set { V0,V1,V2,...,Vm,...,Vn, wherein starting point is node V0, destination is node Vn；
The approach between place in described approach data is expressed as the limit in Connected undigraph, and the total cost data between place and the weights on limit described in time data Connected undigraph in described approach data are expressed as { S0,S1,S2,...,Sm,...,SnAnd { T0,T1,T2,...,Tm,...,Tn, it is converted into the optimum data configuration mode using in described BFS Algorithm for Solving Connected undigraph the starting point determined to fixed endpoint.
Preferably, the place in described approach data include railway freight station, highway freight station, join goods point, join goods station, car and boat master, Logistic Park, logistics company, forwarder, port and pier；
Preferably, described path data arranges influence factor and includes the different cost data of goods, the basic cost data of Shipping Method and time data and multimodal transport.
Preferably, the described step obtaining optimal path data set-up mode that calculates is: node data prepare, limit data prepare and based on BFS Algorithm for Solving optimal path data set-up mode.
Preferably, described node data refer to the relevant information describing described node；Described limit data refer to the cost data required for the two specific Shipping Methods of node or time data, including the time data required for the specific Shipping Method between starting point to destination and cost data, the cost element between two nodes is the weights of corresponding edge data.
Preferably, employing BFS Algorithm for Solving by the optimal path data of described starting point to destination is:
Step 1: access start node V0。
Step 2: from start node V0Start, access V0Each adjacent node { V not accessed0,V1,V2,...,Vi, wherein i≤n, and add up V0Cost data weights { S between its neighborhood of nodes0,S1,S2,...,Si, wherein i≤n and time data weights { T0,T1,T2,...,Ti, wherein i≤n；
Successively from V0,V1,V2,...,ViAccess of setting out each is not accessed for adjacent node, and add up the cost data weights { S between the node accessed0,S1,...,Si,...,Sj... } and time data weights { T0,T1,...,Ti,...,Tj... }, wherein i, j≤n, may have access to node according to the weights size access next one；
Step 3: repeat step 2, until having access to destination node Vn, get from starting point V0Arrive at node VnIn the summation of cost data weights between each node and time data weights, can count on from starting point V0Arrive at node VnTotal cost data and time data.
Preferably, described based on BFS Algorithm for Solving optimal path data set-up mode, need to use BFS Algorithm for Solving respectively according to all possible Shipping Method and approach in the real data got, and screen according to different constraints data, obtain described optimal path data set-up mode.
Build shipping model according to actual ship data, analyze the influence factor of ship data set-up mode and calculate the best ship data set-up mode of acquisition.This method solve under determining goods, starting point and destination data situation, from different ship data set-up modes, according to the restriction element of the breadth Firsts such as time priority, calculate intelligently and process freight information, the problem in the best way freight information being configured.
Accompanying drawing explanation
Fig. 1 is the flow chart that the present invention calculates optimal path data set-up mode.
Fig. 2 is the algorithm flow chart that the present invention calculates optimal path data set-up mode.
Fig. 3 is the present invention freight information process system flow chart based on BFS algorithm.
Fig. 4 is node and transport cost schematic diagram.
Detailed description of the invention
For making the technical problem to be solved in the present invention, technical scheme and advantage clearly, it is described in detail below in conjunction with the accompanying drawings and the specific embodiments.
Those skilled in the art should know, following specific embodiment or detailed description of the invention, be the present invention it is that the set-up mode of series of optimum that concrete summary of the invention enumerate is explained further, and all can be combined with each other or interrelated use between those set-up modes, cannot be associated arranging or being used in conjunction with other embodiment or embodiment unless clearly proposed some of which or a certain specific embodiment or embodiment in the present invention.Meanwhile, following specific embodiment or embodiment are only used as optimized set-up mode, not as the understanding limiting protection scope of the present invention.
Embodiment 1
According to Fig. 1, the invention provides a kind of freight information processing method based on BFS, specifically comprise the following steps that
Hereinafter, said method is more specifically expanded on further.Specifically comprise the following steps that
(1) shipping model is built
Location table in transit is shown as in Connected undigraph node, and described location table in transit is shown as node set { V0,V1,V2,...,Vm,...,Vn, wherein shipping starting point is node V0, shipping destination is node Vn；The transportation route between place in described approach data is expressed as the limit in Connected undigraph, and the weights on total Transportation Expenditure between described place in transit and limit described in haulage time Connected undigraph are expressed as { S0,S1,S2,...,Sm,...,SnAnd { T0,T1,T2,...,Tm,...,Tn, it is converted into and uses in described BFS Algorithm for Solving Connected undigraph the starting point determined to the optimum means of transportation of fixed endpoint and shortest path.
Place in described approach data include logistics railway freight station, highway freight station or port and pier include joining goods point, join goods station, car and boat master, Logistic Park, the owner of cargo, logistics company, forwarder, port and pier；Transportation route between the described place of described connection includes highway, railway, water route and both or multimodal transport between the two.
(2) influence factor of ship data set-up mode is analyzed
1) the different costs of transportation of different goods
Preferential, the cost of transportation of railway transportation way difference goods category is listed below:
2) the basic freight of several modes and the time
The present invention is follow-up all for steel, enumerate expense when steel transport with several modes and time, for single means of transportation, various expense can be comprised to the process of shipping destination from shipping starting point, each step can spend the corresponding time, is specifically listed below:
Highway transportation: car-loading charge, freight and discharging charge；
Railway transportation: car-loading charge of visiting, visiting connects goods freight, railway car-loading charge, railway transportation expense, railway discharging charge, Transform of Railway Freight Transport Station stockyard cost of use, car-loading charge of delivering goods to the customers, freight of delivering goods to the customers and discharging charge of delivering goods to the customers；
Water-borne transport: starting point harbour transhipment charge, uses including stockyard, loads and unloads goods, freighter freight, destination's harbour transhipment charge, use including stockyard, load and unload goods.
Preferential, the expense of transport is water-borne transport, railway transportation, highway transportation from high to low successively, therefore when selecting means of transportation, preferentially can select according to this order.
In each step of transit link, also it is necessarily required to the time that cost is corresponding.
3) multimodal transport
In logistics transportation process; generally not only use a kind of means of transportation; different means of transportation can be used to combine; minimum to reach expense and time; would generally select according to the order of water route, railway and highway when transport; but during without water route or railway, then must be equipped with the process of one section of highway transportation, create multimodal transport.Although use various ways can reduce the expense of transport, but when carrying out transfer between different means of transportation, it is necessary to spend a number of transhipment charge and time.
Use multiple means of transportation time, due to the cost problem of transfer, means of transportation will not be switched frequently, be generally up to about use two kinds of means of transportation, it is possible to intermodal be several as follows:
Highway railway combined transport: namely use highway transportation and two kinds of means of transportation of railway transportation, produce expense in the process and the point of time includes:
If starting point at train freight damp station periphery, does not then need highway transportation, the expense of generation has automobile loading expense, Automobile Transportation expense and automobile discharging charge.
The expense that train transport is relevant has stockyard, railway station, starting point cost of use (if having), train loading expense, train freight, train discharging charge and stockyard, destination railway station cost of use (if having).
If destination at train freight damp station periphery, does not then remain a need for highway transportation, the expense of generation has automobile loading expense, Automobile Transportation expense and automobile discharging charge.
Public water through transport: namely use highway transportation and two kinds of means of transportation of water-borne transport, produce expense in the process and the point of time includes:
If starting point is not at harbour periphery, then needing highway transportation, the expense of generation has automobile loading expense, Automobile Transportation expense and automobile discharging charge；
The expense that port traffic is relevant has starting point storage yard cost of use, harbour loading charges, water-borne transport expense, port discharge expense and destination port stockyard cost of use；
If destination is not at harbour periphery, then remaining a need for highway transportation, the expense of generation has automobile loading expense, Automobile Transportation expense and automobile discharging charge.
(3) optimal path data set-up mode is calculated
1) node data are prepared
Node data refer to the relevant information describing described node, including:
Geographical location information data: the home position information data of each described node；
Expenses standard: through the basic charge of described node；
Flow information: generally go through the time that described node needs；
2) limit data are prepared
Limit data refer to expense or the cost of time of the required cost of the two specific means of transportation of node, including time of cost required for the specific means of transportation from shipping starting point to shipping destination and expense cost, the cost element between two nodes is the weights of corresponding edge data.
The weights on total Transportation Expenditure between described place in transit and limit described in haulage time Connected undigraph are expressed as { S0,S1,S2,...,Sm,...,SnAnd { T0,T1,T2,...,Tm,...,Tn}。
3) BFS Algorithm for Solving logistics transportation optimum means of transportation and transportation route are adopted
Fig. 2 be as described in the flow chart based on BFS algorithm, location table in transit is shown as node set { V0,V1,V2,...,Vm,...,Vn, wherein shipping starting point is node V0, shipping destination is node Vn, from described shipping starting point to the shortest access route of shipping destination it is:
Step 1: access shipping start node V0。
Step 2: from shipping start node V0Start, access V0Each adjacent node { V not accessed0,V1,V2,...,Vi, wherein i≤n, and add up V0Cost metric { S between its neighborhood of nodes0,S1,S2,...,Si, wherein i≤n and time weight { T0,T1,T2,...,Ti, wherein i≤n；
Successively from V0,V1,V2,...,ViAccess of setting out each is not accessed for adjacent node, and add up the cost metric { S between the node accessed0,S1,...,Si,...,Sj... } and time weight { T0,T1,...,Ti,...,Tj... }, wherein i, j≤n, may have access to node according to the weights size access next one.
Step 3: repeat step 2, until having access to shipping destination node Vn, get from shipping starting point V0Arrive shipping destination node VnIn the summation of cost metric between each node and time weight, can count on from shipping starting point V0Arrive shipping destination node VnTotal cost and the time.
Above-mentioned need use BFS Algorithm for Solving respectively according to means of transportation all possible in reality scene and transportation route and carry out screening according to different constraints and obtain optimum means of transportation and transportation route based on BFS Algorithm for Solving optimum means of transportation and transportation route.
The possible constraints that in real world applications scene, data preparation module needs in limit add is:
The adaptation issues of goods and means of transportation, some goods is because the factor such as size, safety is only capable of using specific mode to transport；The restriction of means of transport, including car, ship, the quantity of train and capacity problem；The restriction of shipping station, the depot storage capacity of port and pier, handling capacity etc.；Transprovincially, the official inspection in city and time consuming problem；The Scheduling factors of means of transport, in special time period, the scheduling problem of means of transport；Ship is by the transfer problem in sea to river, and its expense and time do not calculate temporarily；The preferences of each place transportation policy；The use of big small cargo boat and transfer problem in river transport；The difference problem of each river transport price；The flow control problems of each transport hub；The time lock information of river transport；The order of classes or grades at school information of train transport；The favor information that the owner of cargo can obtain；Due to factors such as the traffic controls that the factor such as traffic flow, weather causes.
In another specific embodiment, can to the possible means of transportation obtained from the above-mentioned concrete method for solving of embodiment 1 in real world applications scene, use BFS Algorithm for Solving respectively, and carry out screening according to different constraints and obtain corresponding best ship data set-up mode.
Embodiment 2
In another specific embodiment, as it is shown on figure 3, the invention provides a kind of freight information based on BFS algorithm to process system, described system includes:
Data acquisition module, is used for obtaining actual ship data information；
Model construction module, for the data message obtained according to described data acquisition module, sets up shipping model；Described shipping model is the node that the place in approach data is set in Connected undigraph, and the approach between place in described approach data is expressed as the limit in Connected undigraph；
Analysis module, analyzes the influence factor in ship data set-up mode；And
Ship data arranges module, for the influence factor arranged according to described ship data information, shipping model, ship data, is calculated by BFS algorithm and obtains optimal path data set-up mode；Described ship data arranges module and comprises node data preparation module, limit data preparation module and BFS computing module further.
Preferably, in described shipping model: the location table in approach data is shown as in Connected undigraph node, and the location table in described approach data is shown as node set { V0,V1,V2,...,Vm,...,Vn, wherein starting point is node V0, destination is node Vn；
The approach between place in described approach data is expressed as the limit in Connected undigraph, and the total cost data between place and the weights on limit described in time data Connected undigraph in described approach data are expressed as { S0,S1,S2,...,Sm,...,SnAnd { T0,T1,T2,...,Tm,...,Tn}。
The above is the preferred embodiment of the present invention; it should be pointed out that, for those skilled in the art, under the premise without departing from principle of the present invention; can also making some improvements and modifications, these improvements and modifications also should be regarded as protection scope of the present invention.
Claims (10)
1. the freight information processing method based on BFS algorithm, it is characterised in that described method includes:
Build shipping model, the influence factor analyzed in ship data set-up mode according to actual ship data, and calculate the best ship data set-up mode of acquisition；Described shipping model is the node that the place in approach data is set in Connected undigraph, and the approach between place in described approach data is expressed as the limit in Connected undigraph；
Based on the actual ship data obtained, set up based on after the described shipping model of Connected undigraph, the factor of the different types of ship data set-up mode of analyzing influence.
2. method according to claim 1, it is characterised in that described structure shipping model specifically includes that
Location table in approach data is shown as in Connected undigraph node, and the location table in described approach data is shown as node set { V0,V1,V2,...,Vm,...,Vn, wherein starting point is node V0, destination is node Vn；
The approach between place in described approach data is expressed as the limit in Connected undigraph, and the total cost data between place and the weights on limit described in time data Connected undigraph in described approach data are expressed as { S0,S1,S2,...,Sm,...,SnAnd { T0,T1,T2,...,Tm,...,Tn, it is converted into the optimum data configuration mode using in described BFS Algorithm for Solving Connected undigraph the starting point determined to fixed endpoint.
3. method according to claim 2, it is characterised in that the place in described approach data includes railway freight station, highway freight station, joins goods point, joins goods station, car and boat master, Logistic Park, logistics company, forwarder, port and pier；Approach between the described place of described connection includes highway, railway, water route and both or multimodal transport between the two.
4. method according to claim 1, it is characterised in that described path data arranges influence factor and includes the different cost data of goods, the basic cost data of Shipping Method and time data and multimodal transport.
5. method according to claim 1, it is characterised in that described calculating obtains the step of optimal path data set-up mode and is: node data prepare, limit data prepare and based on BFS Algorithm for Solving the best ship data set-up mode.
6. method according to claim 5, it is characterised in that described node data refer to the relevant information describing described node；Described limit data refer to the cost data required for the two specific Shipping Methods of node or time data, including the time data required for the specific Shipping Method between starting point to destination and cost data, the cost element between two nodes is the weights of corresponding edge data.
7. method according to claim 6, it is characterised in that employing BFS Algorithm for Solving by the optimal path data set-up mode of described starting point to destination is:
Step 1: access start node V0。
Step 2: from start node V0Start, access V0Each adjacent node { V not accessed0,V1,V2,...,Vi, wherein i≤n, and add up V0Cost data weights { S between its neighborhood of nodes0,S1,S2,...,Si, wherein i≤n and time data weights { T0,T1,T2,...,Ti, wherein i≤n；
Successively from V0,V1,V2,...,ViAccess of setting out each is not accessed for adjacent node, and add up the cost data weights { S between the node accessed0,S1,...,Si,...,Sj... } and time data weights { T0,T1,...,Ti,...,Tj... }, wherein i, j≤n, may have access to node according to the weights size access next one；
Step 3: repeat step 2, until having access to destination node Vn, get from starting point V0Arrive at node VnIn the summation of cost data weights between each node and time data weights, can count on from starting point V0Arrive at node VnTotal cost data and time data.
8. according to claim 1,2,5,6, method described in 7 any one, it is characterised in that described need to use BFS Algorithm for Solving respectively according to all possible Shipping Method in the real data that gets and approach based on BFS Algorithm for Solving optimal path data set-up mode, and screen according to different constraints data, obtain described optimal path data set-up mode.
9. the freight information based on BFS algorithm processes system, it is characterised in that described system includes:
Data acquisition module, is used for obtaining actual ship data information；
Model construction module, for the data message obtained according to described data acquisition module, sets up shipping model；Described shipping model is the node that the place in approach data is set in Connected undigraph, and the approach between place in described approach data is expressed as the limit in Connected undigraph；
Analysis module, analyzes the influence factor during ship data is arranged；And
Ship data arranges module, for according to described ship data information, shipping model, ship data set-up mode influence factor, by BFS algorithm obtain optimal path data set-up mode；Described ship data arranges module and comprises node data preparation module, limit data preparation module and BFS computing module further.
10. system according to claim 9, it is characterised in that in described shipping model: the location table in approach data is shown as in Connected undigraph node, and the location table in described approach data is shown as node set { V0,V1,V2,...,Vm,...,Vn, wherein starting point is node V0, destination is node Vn；
The approach between place in described approach data is expressed as the limit in Connected undigraph, and the total cost data between place and the weights on limit described in time data Connected undigraph in described approach data are expressed as { S0,S1,S2,...,Sm,...,SnAnd { T0,T1,T2,...,Tm,...,Tn}。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610140913.2A CN105809402A (en) | 2016-03-11 | 2016-03-11 | Freight information processing method and system based on BFS algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610140913.2A CN105809402A (en) | 2016-03-11 | 2016-03-11 | Freight information processing method and system based on BFS algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105809402A true CN105809402A (en) | 2016-07-27 |
Family
ID=56468275
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610140913.2A Pending CN105809402A (en) | 2016-03-11 | 2016-03-11 | Freight information processing method and system based on BFS algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105809402A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108428084A (en) * | 2018-03-09 | 2018-08-21 | 东南大学 | A kind of Multimodal Transport System and method based on service chaining |
| CN110490391A (en) * | 2019-09-11 | 2019-11-22 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | A kind of calculation method of multimodal transport traffic program |
| CN110544067A (en) * | 2019-09-11 | 2019-12-06 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | multi-type combined transport system |
| TWI706339B (en) * | 2016-10-31 | 2020-10-01 | 日商三菱重工業股份有限公司 | Delivery planning system, delivery planning method and program |
-
2016
- 2016-03-11 CN CN201610140913.2A patent/CN105809402A/en active Pending
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI706339B (en) * | 2016-10-31 | 2020-10-01 | 日商三菱重工業股份有限公司 | Delivery planning system, delivery planning method and program |
| CN108428084A (en) * | 2018-03-09 | 2018-08-21 | 东南大学 | A kind of Multimodal Transport System and method based on service chaining |
| CN110490391A (en) * | 2019-09-11 | 2019-11-22 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | A kind of calculation method of multimodal transport traffic program |
| CN110544067A (en) * | 2019-09-11 | 2019-12-06 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | multi-type combined transport system |
| CN110544067B (en) * | 2019-09-11 | 2022-02-18 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | Multi-type combined transport system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105809401A (en) | Freight information processing method and system based on dynamic programming algorithm | |
| CN105404941A (en) | Intelligent optimization method and system for logistics transportation mode and path | |
| CN105825296A (en) | Dijkstra-algorithm-based freight information processing method and system | |
| Janjevic et al. | Inland waterways transport for city logistics: a review of experiences and the role of local public authorities | |
| Diziain et al. | Urban logistics by rail and waterways in France and Japan | |
| Montwiłł | The role of seaports as logistics centers in the modelling of the sustainable system for distribution of goods in urban areas | |
| US20120226624A1 (en) | Optimization system of smart logistics network | |
| CN105809402A (en) | Freight information processing method and system based on BFS algorithm | |
| CN103218700A (en) | On-line intelligent pairing method for cargo and transportation capacity | |
| Ignaccolo et al. | Sustainability of freight transport through an integrated approach: the case of the eastern sicily port system | |
| CN107862493A (en) | A kind of goods stock matching travels on the way the numerical value determination methods of goods nearby | |
| CN105741074A (en) | Freight information processing method and system based on Prim algorithm | |
| Staniek et al. | Shaping Environmental Friendly Behaviour In Transport Of Goods–New Tool And Education | |
| CN110119831A (en) | A kind of the transportation route optimization system and method for logistic management system | |
| Staniek et al. | Smart platform for support issues at the first and last mile in the supply chain-the concept of the s-mile project | |
| Bergqvist | Developing Large-Scale Dry Ports—The Case of Arriyadh | |
| Tadić et al. | Sustainability of the city logistics initiatives | |
| Pachakis et al. | The Venice offshore-onshore terminal concept | |
| Malisan et al. | Development of short sea shipping in the north coast of Java Island, Indonesia as a potential market | |
| CN109130867A (en) | Charging reminding method, device and mobile terminal based on cold chain transportation | |
| CN112016782B (en) | Airport freight transportation traffic demand real-time calculation method and system | |
| Fransoo et al. | Decarbonizing Urban Logistics: Perspectives for Low-and Middle-Income Countries | |
| Herrchen et al. | Smart City Logistics: Recommendations for the City of Prague | |
| Luburić et al. | Transport Technology in the Function of Water Transport Development in the Republic of Croatia | |
| Sierpiński et al. | Environmentally Sustainable Transport Planning in the First and Last Mile Section of the Supply Chain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160727 |
|
| RJ01 | Rejection of invention patent application after publication |