CN109242172A - The maximized method and device of vehicle transport loading capacity based on dijkstra's algorithm - Google Patents
The maximized method and device of vehicle transport loading capacity based on dijkstra's algorithm Download PDFInfo
- Publication number
- CN109242172A CN109242172A CN201810993766.2A CN201810993766A CN109242172A CN 109242172 A CN109242172 A CN 109242172A CN 201810993766 A CN201810993766 A CN 201810993766A CN 109242172 A CN109242172 A CN 109242172A
- Authority
- CN
- China
- Prior art keywords
- vertex
- weight
- state
- transport
- algorithm
- 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
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 50
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000010276 construction Methods 0.000 claims abstract description 11
- 238000004590 computer program Methods 0.000 claims description 6
- 238000000151 deposition Methods 0.000 claims 1
- 238000007726 management method Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000001737 promoting effect Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
-
- G06Q50/40—
Abstract
The invention discloses the maximized method and devices of vehicle transport loading capacity based on dijkstra's algorithm, the method is suitable for executing in calculating equipment, including at least following steps: using topology model construction method, modeled to vehicle capacity problem, obtain the connected graph of Weighted Coefficients；According to the connected graph, transport task is set；The transport maximized path planning of loading capacity is carried out to the transport task using dijkstra's algorithm, obtains the corresponding dead weight path of the transport task.The present invention can be realized the purpose realized by modeling and carry out maximum lift vehicle capacity using existing map.
Description
Technical field
The present invention relates to graph theory fields, more particularly to the vehicle transport loading capacity based on dijkstra's algorithm is maximized
Method and device.
Background technique
With the high speed development of national highway, Chinese Highway shipping has become the overall market of the first in the world scale, currently,
China is extremely urgent to the requirement for promoting logistic efficiency.
Logistic management system, its main feature is that the operating quantity of sender and the operation of recipient's related service can be greatly decreased,
And have the function of monitoring the state of article during transportation in real time.Therefore, the existing method for promoting logistic efficiency, it is main
It to be operated by using logistic management system, to promote the efficiency of management and reduce management cost.But to the prior art
Research and practice process in, it was found by the inventors of the present invention that the existing method using logistic management system, existing cannot have
The problem of promotion loading capacity of effect.
Summary of the invention
Technical problem to be solved by the present invention lies in it is maximum to provide the vehicle transport loading capacity based on dijkstra's algorithm
The method and device of change realizes the purpose that maximum lift vehicle capacity is carried out using existing map by modeling.
In order to solve the above-mentioned technical problem, on the one hand, An embodiment provides be based on dijkstra's algorithm
The maximized method of vehicle transport loading capacity, suitable for calculate equipment in execute, include at least following steps:
Using topology model construction method, vehicle capacity problem is modeled, obtains the connected graph of Weighted Coefficients.
According to the connected graph, transport task is set.
The transport maximized path planning of loading capacity is carried out to the transport task using dijkstra's algorithm, is obtained described
The corresponding dead weight path of transport task.
Export the corresponding dead weight path of the transport task.
Further, the transport task includes departure place and destination.
Further, described to use topology model construction method, vehicle capacity problem is modeled, the connection of Weighted Coefficients is obtained
Figure, specifically:
It is the vertex of figure by each site setting, and every road between place and place is set as connecting in figure and is pushed up
The side of point, obtains initial connected graph.
It is limited according to loading capacity of the every road to vehicle, defines the corresponding side of every road in the initial connected graph
Weight, to obtain the connected graph of Weighted Coefficients.
Further, the connected graph is stored in a manner of corresponding adjacent chained list, specifically, according to the connected graph, wound
All vertex of connected graph described in a storage of array are built, and create a chained list for each element of array, the chained list is deposited
Put all vertex adjacent with vertex corresponding to element.Wherein, each vertex includes state, weight and father vertex three letters
Breath.
Further, described that the maximized path of transport task transport loading capacity is advised using dijkstra's algorithm
It draws, obtains the corresponding dead weight path of the transport task, specifically:
All vertex states are all set to 0；
The state of departure place in the transport task is become 2, and by the vertex adjacent with the departure place
State becomes 1；
The side between the vertex and the departure place is set by the weight on the vertex adjacent with the departure place
Weight size, father vertex are set as departure place；
Traversal the stateful vertex for being 1 weight, the state on the vertex of maximum weight is become 2；
The vertex v 2 adjacent with the vertex v 1 that state becomes 2 is traversed, if the state of vertex v 2 is 0, by the shape of vertex v 2
State becomes 1, and compares the weight on the side between the weight of vertex v 1 and vertex v 1 and vertex v 2, assigns weight less than normal to vertex
V2, and vertex v 1 is set by the father vertex of vertex v 2；If the state of vertex v 2 is 1, and 2 weight of vertex v is than the power of vertex v 1
The weight on the side between value, vertex v 1 and vertex v 2 is all small, then compares between the weight of vertex v 1 and vertex v 1 and vertex v 2
The weight on side assigns weight less than normal to vertex v 2, and sets vertex v 1 for the father vertex of vertex v 2；It repeats the above steps,
Until the departure place in the transport task and the state that all vertex are presented between target location are become 2 road
Diameter.
On the other hand, one embodiment of the present of invention additionally provides a kind of vehicle transport load-carrying based on dijkstra's algorithm
Measure maximized device, comprising:
Modeling module models vehicle capacity problem, obtains the connection of Weighted Coefficients for using topology model construction method
Figure.
Transport task setting module, for setting transport task according to the connected graph.
Dead weight path planning module, for carrying out transport load-carrying to the transport task using dijkstra's algorithm
Maximized path planning is measured, the corresponding dead weight path of the transport task is obtained.
Output module, for exporting the corresponding dead weight path of the transport task.
Further, the transport task includes departure place and destination.
Further, the modeling module, specifically for being the vertex of figure by each site setting, and by place and place
Between every road be set as in figure connect vertex side, obtain initial connected graph；Load-carrying according to every road to vehicle
Amount limitation, defines the weight on the corresponding side of every road in the initial connected graph, to obtain the connected graph of Weighted Coefficients.
Further, the connected graph is stored in a manner of corresponding adjacent chained list, specifically, according to the connected graph, wound
All vertex of connected graph described in a storage of array are built, and create a chained list for each element of array, the chained list is deposited
Put all vertex adjacent with vertex corresponding to element.Wherein, each vertex includes state, weight and father vertex three letters
Breath.
Further, the dead weight path planning module, is specifically used for, and all vertex states are all arranged
It is 0；
The state of departure place in the transport task is become 2, and by the vertex adjacent with the departure place
State becomes 1；
The side between the vertex and the departure place is set by the weight on the vertex adjacent with the departure place
Weight size, father vertex are set as departure place；
Traversal the stateful vertex for being 1 weight, the state on the vertex of maximum weight is become 2；
The vertex v 2 adjacent with the vertex v 1 that state becomes 2 is traversed, if the state of vertex v 2 is 0, by the shape of vertex v 2
State becomes 1, and compares the weight on the side between the weight of vertex v 1 and vertex v 1 and vertex v 2, assigns weight less than normal to vertex
V2, and vertex v 1 is set by the father vertex of vertex v 2；If the state of vertex v 2 is 1, and 2 weight of vertex v is than the power of vertex v 1
The weight on the side between value, vertex v 1 and vertex v 2 is all small, then compares between the weight of vertex v 1 and vertex v 1 and vertex v 2
The weight on side assigns weight less than normal to vertex v 2, and sets vertex v 1 for the father vertex of vertex v 2；It repeats the above steps,
Until the departure place in the transport task and the state that all vertex are presented between target location are become 2 road
Diameter.
Another aspect, one embodiment of the present of invention additionally provide a kind of vehicle transport load-carrying based on dijkstra's algorithm
Measure maximized method and device, including processor, memory and storage in the memory and are configured as by described
The computer program that processor executes, the processor are realized when executing the computer program as above-mentioned based on Dijkstra
The maximized method of vehicle transport loading capacity of algorithm.
The implementation of the embodiments of the present invention has the following beneficial effects:
The maximized method of vehicle transport loading capacity and dress based on dijkstra's algorithm that the embodiment of the present invention provides
It sets, the method is suitable for executing in calculating equipment, includes at least following steps: topology model construction method is used, to vehicle capacity
Problem is modeled, and the connected graph of Weighted Coefficients is obtained.According to the connected graph, transport task is set.Using dijkstra's algorithm
The transport maximized path planning of loading capacity is carried out to the transport task, obtains the corresponding dead weight of the transport task
Path.Compared to the method for maximum spanning tree, the present invention is its three times or more using the efficiency of dijkstra's algorithm.The present invention
It can be realized the purpose realized by modeling and carry out maximum lift vehicle capacity using existing map.
Detailed description of the invention
Fig. 1 is the vehicle transport loading capacity maximization side based on dijkstra's algorithm that one embodiment of the present of invention provides
The flow diagram of method；
Fig. 2 is the vehicle transport loading capacity maximization side based on dijkstra's algorithm that one embodiment of the present of invention provides
Another flow diagram of method；
Fig. 3 is the vehicle transport loading capacity maximization side based on dijkstra's algorithm that one embodiment of the present of invention provides
The connected graph schematic diagram of method；
Fig. 4 be another embodiment of the present invention provides based on dijkstra's algorithm vehicle transport loading capacity maximization
The structural schematic diagram of device.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, so that the advantages and features of the present invention can be more easily understood by those skilled in the art, it is clear that described implementation
Example is only a part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, this field is common
Technical staff's every other embodiment obtained without making creative work belongs to the model that the present invention protects
It encloses.
It is with reference to the accompanying drawing and specific real in order to make those skilled in the art more fully understand technical solution of the present invention
Applying example, the present invention is described in further detail.
First embodiment of the invention:
Please refer to Fig. 1-3.
As shown in Figs. 1-2, the vehicle transport loading capacity maximization approach provided in this embodiment based on dijkstra's algorithm,
Suitable for being executed in calculating equipment, including at least following steps:
S101, using topology model construction method, vehicle capacity problem is modeled, the connected graph of Weighted Coefficients is obtained.
Specifically, being the vertex of figure by each site setting, and every road between place and place is set as figure
The side on middle connection vertex, obtains initial connected graph.It is limited according to loading capacity of the every road to vehicle, defines the initial connection
The weight on the corresponding side of every road in figure, to obtain the connected graph of Weighted Coefficients.In order to facilitate calculating, it is assumed that each place it
Between each road be all two-way traffic road, in addition, the both direction freight weight limit of same path is identical.Therefore when figure has been established
At later, will being the connected graph of a undirected Weighted Coefficients.
Wherein, the connected graph is stored in a manner of corresponding adjacent chained list, specifically, according to the connected graph, creation one
All vertex of connected graph described in a storage of array, and create a chained list for each element of array, chained list storage with
The adjacent all vertex in vertex corresponding to element.Wherein, each vertex includes three state, weight and father vertex information.
S102, according to the connected graph, set transport task.
Wherein, the set content of the transport task includes departure place and destination.
S103, the transport maximized path planning of loading capacity is carried out to the transport task using dijkstra's algorithm, obtained
To the corresponding dead weight path of the transport task.
In the present embodiment, dijkstra's algorithm is the power on side all on the digraph of a Weighted Coefficients and in figure
It is worth non-negative, after given departure place, the algorithm in the dead weight path of any destination can be found out.
Specifically, all vertex states are all set to 0.The state of departure place in the transport task is become
It is 2, and the state on the vertex adjacent with the departure place is become 1.By the weight on the vertex adjacent with the departure place
It is set as the weight size on the side between the vertex and the departure place, father vertex is set as departure place.Traverse all shapes
The weight on the vertex that state is 1, becomes 2 for the state on the vertex of maximum weight.Traverse the top adjacent with the vertex v 1 that state becomes 2
The state of vertex v 2 is become 1 if the state of vertex v 2 is 0 by point v2, and compares weight and vertex v 1 and the vertex of vertex v 1
The weight on the side between v2 assigns weight less than normal to vertex v 2, and sets vertex v 1 for the father vertex of vertex v 2.If vertex
The state of v2 is 1, and 2 weight of vertex v is all smaller than the weight on the side between the weight of vertex v 1, vertex v 1 and vertex v 2, then compares
Compared with the weight on the side between the weight and vertex v 1 and vertex v 2 of vertex v 1, weight less than normal is assigned to vertex v 2, and by vertex
The father vertex of v2 is set as vertex v 1.Repeat the above steps, until by the transport task departure place and target location
Between present all vertex state become 2 path.
It is understood that as shown in figure 3, wanting to find out the dead weight path from a to e, steps are as follows:
0 is set by the state on all vertex, the weight on side represents the loading capacity limitation of road；
From a, 2 are set by the state of a, then sets 1 for the state of b and c, sets side ab for the weight of b
Weight, that is, 10, set the weight of c to the weight of side ac, that is, 8, set a for the father vertex of b, expression be from
A goes to b's, sets a for the father vertex of c, expression is to go to c from a；
In the vertex (b and c) that state is 1 at this time, because the maximum weight (b 10, c 8) of b, sets the state of b to
2, the state of d is 0 at this time, compares the weight (for 10) of vertex b and the weight (for 7) of side bd, the weight of side bd is smaller, therefore
Assign the weight (for 7) of side bd to vertex d.B is set by the father vertex of d, expression is to go to d from b；
There is also the vertex (c and d) that state is 1, because the maximum weight (c 8, d 7) of c, sets the state of c to
2, the state of d is 1 at this time, and the weight (for 12) of weight (for 8) and side cd of the weight (for 7) of vertex d than vertex c will
It is small, therefore compare the weight (for 8) of vertex c and the weight (for 12) of side cd, the weight of vertex c is smaller, therefore by vertex c's
Weight (for 8) assigns vertex d, and the weight of vertex d becomes 8 and (it is noted that going to this vertex d from starting point a at this time, arrives at this time
It is promoted via 7 to 8) currently, its loading capacity limitation is minimum, and the father vertex of d is updated to c, expression is to go to d from c；
There is also the vertex (d) that state is 1, set 2 for the state of d, and the state of e is 0 at this time, therefore by the state of e
Setting 1, compares the weight of vertex d and the weight of side de, and the weight of vertex d is smaller, therefore sets 8 for the weight of vertex e,
D is set by the father vertex of vertex e, expression is to go to e from d；
There is also the vertex (e) that state is 1, by the state of e set 2, due to without state being at this time 0 or 1
Vertex, algorithm terminate.
Thus a dead weight path, a-c-d-e are found out, loading capacity is up to 8.Wherein, father vertex acts on
In the father vertex of e is d, and the father vertex of d is c, and the father vertex of c is a, so can know that is path a-c-d-e.
S104, the corresponding dead weight path of the output transport task.
Vehicle transport loading capacity maximized method provided in this embodiment based on dijkstra's algorithm, is built using topology
Modulus method models vehicle capacity problem, obtains the connected graph of Weighted Coefficients；According to the connected graph, transport task is set；
The transport maximized path planning of loading capacity is carried out to the transport task using dijkstra's algorithm, obtains the transport task
Corresponding dead weight path.Compared to the method for maximum spanning tree, the present embodiment is using the efficiency of dijkstra's algorithm
It is more than its three times.The present invention can be realized the mesh realized by modeling and carry out maximum lift vehicle capacity using existing map
's.
Second embodiment of the invention:
Please refer to Fig. 4.
Modeling module 401 models vehicle capacity problem, obtains Weighted Coefficients for using topology model construction method
Connected graph.
Specifically, being the vertex of figure by each site setting, and every road between place and place is set as figure
The side on middle connection vertex, obtains initial connected graph.It is limited according to loading capacity of the every road to vehicle, defines the initial connection
The weight on the corresponding side of every road in figure, to obtain the connected graph of Weighted Coefficients.In order to facilitate calculating, it is assumed that each place it
Between each road be all two-way traffic road, in addition, the both direction freight weight limit of same path is identical.Therefore when figure has been established
At later, will being the connected graph of a undirected Weighted Coefficients.
Wherein, the connected graph is stored in a manner of corresponding adjacent chained list, specifically, according to the connected graph, creation one
All vertex of connected graph described in a storage of array, and create a chained list for each element of array, chained list storage with
The adjacent all vertex in vertex corresponding to element.Wherein, each vertex includes three state, weight and father vertex information.
Transport task setting module 402, for setting transport task according to the connected graph.
Wherein, the set content of the transport task includes departure place and destination.
Dead weight path planning module 403, for being transported using dijkstra's algorithm to the transport task
The maximized path planning of loading capacity obtains the corresponding dead weight path of the transport task.
In the present embodiment, dijkstra's algorithm is the power on side all on the digraph of a Weighted Coefficients and in figure
It is worth non-negative, after given departure place, the algorithm in the dead weight path of any destination can be found out.
Specifically, all vertex states are all set to 0.The state of departure place in the transport task is become
It is 2, and the state on the vertex adjacent with the departure place is become 1.By the weight on the vertex adjacent with the departure place
It is set as the weight size on the side between the vertex and the departure place, father vertex is set as departure place.Traverse all shapes
The weight on the vertex that state is 1, becomes 2 for the state on the vertex of maximum weight.Traverse the top adjacent with the vertex v 1 that state becomes 2
The state of vertex v 2 is become 1 if the state of vertex v 2 is 0 by point v2, and compares weight and vertex v 1 and the vertex of vertex v 1
The weight on the side between v2 assigns weight less than normal to vertex v 2, and sets vertex v 1 for the father vertex of vertex v 2.If vertex
The state of v2 is 1, and 2 weight of vertex v is all smaller than the weight on the side between the weight of vertex v 1, vertex v 1 and vertex v 2, then compares
Compared with the weight on the side between the weight and vertex v 1 and vertex v 2 of vertex v 1, weight less than normal is assigned to vertex v 2, and by vertex
The father vertex of v2 is set as vertex v 1.Repeat the above steps, until by the transport task departure place and target location
Between present all vertex state become 2 path.
It is understood that as shown in figure 3, wanting to find out the dead weight path from a to e, steps are as follows:
0 is set by the state on all vertex, the weight on side represents the loading capacity limitation of road；
From a, 2 are set by the state of a, then sets 1 for the state of b and c, sets side ab for the weight of b
Weight, that is, 10, set the weight of c to the weight of side ac, that is, 8, set a for the father vertex of b, expression be from
A goes to b's, sets a for the father vertex of c, expression is to go to c from a；
In the vertex (b and c) that state is 1 at this time, because the maximum weight (b 10, c 8) of b, sets the state of b to
2, the state of d is 0 at this time, compares the weight (for 10) of vertex b and the weight (for 7) of side bd, the weight of side bd is smaller, therefore
Assign the weight (for 7) of side bd to vertex d.B is set by the father vertex of d, expression is to go to d from b；
There is also the vertex (c and d) that state is 1, because the maximum weight (c 8, d 7) of c, sets the state of c to
2, the state of d is 1 at this time, and the weight (for 12) of weight (for 8) and side cd of the weight (for 7) of vertex d than vertex c will
It is small, therefore compare the weight (for 8) of vertex c and the weight (for 12) of side cd, the weight of vertex c is smaller, therefore by vertex c's
Weight (for 8) assigns vertex d, and the weight of vertex d becomes 8 and (it is noted that going to this vertex d from starting point a at this time, arrives at this time
It is promoted via 7 to 8) currently, its loading capacity limitation is minimum, and the father vertex of d is updated to c, expression is to go to d from c；
There is also the vertex (d) that state is 1, set 2 for the state of d, and the state of e is 0 at this time, therefore by the state of e
Setting 1, compares the weight of vertex d and the weight of side de, and the weight of vertex d is smaller, therefore sets 8 for the weight of vertex e,
D is set by the father vertex of vertex e, expression is to go to e from d；
There is also the vertex (e) that state is 1, by the state of e set 2, due to without state being at this time 0 or 1
Vertex, algorithm terminate.
Thus a dead weight path, a-c-d-e are found out, loading capacity is up to 8.Wherein, father vertex acts on
In the father vertex of e is d, and the father vertex of d is c, and the father vertex of c is a, so can know that is path a-c-d-e.
Output module 404, for exporting the corresponding dead weight path of the transport task.
Vehicle transport loading capacity maximized device provided in this embodiment based on dijkstra's algorithm, on executing
Method is stated using topology model construction method, vehicle capacity problem is modeled, the connected graph of Weighted Coefficients is obtained；According to the connection
Figure sets transport task；The transport maximized path planning of loading capacity is carried out to the transport task using dijkstra's algorithm,
Obtain the corresponding dead weight path of the transport task.Compared to the method for maximum spanning tree, the present invention is used
The efficiency of dijkstra's algorithm is its three times or more.The present embodiment can be realized utilizes existing map to carry out by modeling realization
The purpose of maximum lift vehicle capacity.
On the other hand, another embodiment of the present invention additionally provides the vehicle transport loading capacity based on dijkstra's algorithm most
The device changed greatly, which is characterized in that including processor, memory and store in the memory and be configured as by described
The computer program that processor executes, the processor are realized above-mentioned based on Dijkstra calculation when executing the computer program
The maximized method of vehicle transport loading capacity of method.
The above is a preferred embodiment of the present invention, it is noted that for those skilled in the art
For, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also considered as
Protection scope of the present invention.
Claims (10)
1. a kind of maximized method of vehicle transport loading capacity based on dijkstra's algorithm, suitable for being executed in calculating equipment,
It is characterized in that, including at least following steps:
Using topology model construction method, vehicle capacity problem is modeled, obtains the connected graph of Weighted Coefficients；
According to the connected graph, transport task is set；
The transport maximized path planning of loading capacity is carried out to the transport task using dijkstra's algorithm, obtains the transport
The corresponding dead weight path of task；
Export the corresponding dead weight path of the transport task.
2. the vehicle transport loading capacity maximized method according to claim 1 based on dijkstra's algorithm, feature
It is, the transport task includes departure place and destination.
3. the vehicle transport loading capacity maximized method according to claim 1 based on dijkstra's algorithm, feature
It is, it is described to use topology model construction method, vehicle capacity problem is modeled, the connected graph of Weighted Coefficients is obtained, specifically:
By each site setting it is the vertex of figure, and every road between place and place is set as to connect vertex in figure
Side obtains initial connected graph；
It is limited according to loading capacity of the every road to vehicle, defines the power on the corresponding side of every road in the initial connected graph
Value, to obtain the connected graph of Weighted Coefficients.
4. the vehicle transport loading capacity maximized method according to claim 3 based on dijkstra's algorithm, the company
Logical figure is stored in a manner of corresponding adjacent chained list, specifically, creating connected graph described in a storage of array according to the connected graph
All vertex, and create a chained list for each element of array, chained list storage is adjacent with vertex corresponding to element
All vertex；Wherein, each vertex includes three state, weight and father vertex information.
5. the vehicle transport loading capacity maximized method according to claim 1 based on dijkstra's algorithm, described to adopt
The maximized path planning of loading capacity is transported to the transport task with dijkstra's algorithm, it is corresponding to obtain the transport task
Dead weight path, specifically:
All vertex states are all set to 0；
The state of departure place in the transport task is become 2, and by the state on the vertex adjacent with the departure place
Become 1；
Set the weight on the vertex adjacent with the departure place to the weight on the side between the vertex and the departure place
Size, father vertex are set as departure place；
Traversal the stateful vertex for being 1 weight, the state on the vertex of maximum weight is become 2；
The vertex v 2 adjacent with the vertex v 1 that state becomes 2 is traversed, if the state of vertex v 2 is 0, the state of vertex v 2 is become
It is 1, and compares the weight on the side between the weight of vertex v 1 and vertex v 1 and vertex v 2, assigns weight less than normal to vertex v 2,
And vertex v 1 is set by the father vertex of vertex v 2；If the state of vertex v 2 be 1, and 2 weight of vertex v than vertex v 1 weight,
The weight on the side between vertex v 1 and vertex v 2 is all small, then compares the side between the weight of vertex v 1 and vertex v 1 and vertex v 2
Weight assigns weight less than normal to vertex v 2, and sets vertex v 1 for the father vertex of vertex v 2；It repeats the above steps, until
Departure place in the transport task and the state that all vertex are presented between target location are become into 2 path.
6. a kind of maximized device of vehicle transport loading capacity based on dijkstra's algorithm characterized by comprising
Modeling module models vehicle capacity problem, obtains the connected graph of Weighted Coefficients for using topology model construction method；
Transport task setting module, for setting transport task according to the connected graph；
Dead weight path planning module, for carrying out transport loading capacity most to the transport task using dijkstra's algorithm
The path planning changed greatly obtains the corresponding dead weight path of the transport task；
Output module, for exporting the corresponding dead weight path of the transport task.
7. the vehicle transport loading capacity maximized device according to claim 6 based on dijkstra's algorithm, feature
It is, the modeling module, specifically for being the vertex of figure by each site setting, and by every road between place and place
Road is set as connecting the side on vertex in figure, obtains initial connected graph；It is limited according to loading capacity of the every road to vehicle, defines institute
The weight on the corresponding side of every road in initial connected graph is stated, to obtain the connected graph of Weighted Coefficients.
8. the vehicle transport loading capacity maximized device according to claim 7 based on dijkstra's algorithm, feature
It is, the connected graph is stored in a manner of corresponding adjacent chained list, specifically, creating an array according to the connected graph and depositing
All vertex of the connected graph are stored up, and create a chained list for each element of array, the chained list storage and element institute are right
The adjacent all vertex in the vertex answered；Wherein, each vertex includes three state, weight and father vertex information.
9. the vehicle transport loading capacity maximized device according to claim 6 based on dijkstra's algorithm, feature
It is, the dead weight path planning module is specifically used for,
All vertex states are all set to 0；
The state of departure place in the transport task is become 2, and by the state on the vertex adjacent with the departure place
Become 1；
Set the weight on the vertex adjacent with the departure place to the weight on the side between the vertex and the departure place
Size, father vertex are set as departure place；
Traversal the stateful vertex for being 1 weight, the state on the vertex of maximum weight is become 2；
The vertex v 2 adjacent with the vertex v 1 that state becomes 2 is traversed, if the state of vertex v 2 is 0, the state of vertex v 2 is become
It is 1, and compares the weight on the side between the weight of vertex v 1 and vertex v 1 and vertex v 2, assigns weight less than normal to vertex v 2,
And vertex v 1 is set by the father vertex of vertex v 2；If the state of vertex v 2 be 1, and 2 weight of vertex v than vertex v 1 weight,
The weight on the side between vertex v 1 and vertex v 2 is all small, then compares the side between the weight of vertex v 1 and vertex v 1 and vertex v 2
Weight assigns weight less than normal to vertex v 2, and sets vertex v 1 for the father vertex of vertex v 2；It repeats the above steps, until
Departure place in the transport task and the state that all vertex are presented between target location are become into 2 path.
10. a kind of maximized device of vehicle transport loading capacity based on dijkstra's algorithm, which is characterized in that including processing
Device, memory and storage in the memory and are configured as the computer program executed by the processor, the place
Reason device realizes such as the vehicle described in any one of claim 1 to 5 based on dijkstra's algorithm when executing the computer program
Transport the maximized method of loading capacity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810993766.2A CN109242172A (en) | 2018-08-29 | 2018-08-29 | The maximized method and device of vehicle transport loading capacity based on dijkstra's algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810993766.2A CN109242172A (en) | 2018-08-29 | 2018-08-29 | The maximized method and device of vehicle transport loading capacity based on dijkstra's algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109242172A true CN109242172A (en) | 2019-01-18 |
Family
ID=65068934
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810993766.2A Pending CN109242172A (en) | 2018-08-29 | 2018-08-29 | The maximized method and device of vehicle transport loading capacity based on dijkstra's algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109242172A (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104494534A (en) * | 2014-12-02 | 2015-04-08 | 深圳华驿畅联技术开发有限公司 | Vehicle transportation management system and method |
| CN105467991A (en) * | 2014-09-29 | 2016-04-06 | 日立建机株式会社 | Stop position determining device for transport vehicle and transport vehicle with the same |
-
2018
- 2018-08-29 CN CN201810993766.2A patent/CN109242172A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105467991A (en) * | 2014-09-29 | 2016-04-06 | 日立建机株式会社 | Stop position determining device for transport vehicle and transport vehicle with the same |
| CN104494534A (en) * | 2014-12-02 | 2015-04-08 | 深圳华驿畅联技术开发有限公司 | Vehicle transportation management system and method |
Non-Patent Citations (5)
| Title |
|---|
| SIGN_: "图算法 单源最短路径 Dijkstra算法（邻接表_邻接矩阵+优先队列STL)", 《博客园》 * |
| 我还在路上呢: "poj 1797 Heavy Transportation（通路中的最大承载量）", 《CSDN HTTPS://BLOG.CSDN.NET/U014552756/ARTICLE/DETAILS/50590604》 * |
| 江南烟雨C: "POJ 1797 Heavy Transportation", 《CSDN HTTPS://BLOG.CSDN.NET/QQ_35109846/ARTICLE/DETAILS/71856089》 * |
| 王军等: "基于Dijkstra算法的多约束军事运输最优路径研究", 《军事交通学院学报》 * |
| 王海晓: "Dijkstra算法在求解物流运输最短路径中的应用", 《价值工程》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dong et al. | Optimal sizing of a stand-alone hybrid power system based on battery/hydrogen with an improved ant colony optimization | |
| CN112686439B (en) | Intelligent automatic container terminal energy-saving comprehensive scheduling method | |
| CN109948958A (en) | Logistics routing determination method and related equipment | |
| CN106951444A (en) | Architectural engineering information processing method and device | |
| CN107315856A (en) | The modeling method and device of a kind of power grid GIS based on chart database | |
| CN102411764A (en) | Data management system of electrical network equipment and management method thereof | |
| CN111639790B (en) | Multi-mode intermodal scheduling method and system for guaranteeing freight reliability and safety | |
| CN103870889A (en) | Logistic center cargo delivery routing problem eM-Plant simulation method | |
| CN116562738B (en) | Intelligent freight dispatching method, device, equipment and storage medium | |
| Chen et al. | Highway freight terminal facilities allocation based on flexsim | |
| Davydenko et al. | Smart Sustainable Freight Transport for a City Multi-Floor Manufacturing Cluster: A Framework of the Energy Efficiency Monitoring of Electric Vehicle Fleet Charging | |
| CN110232198A (en) | A kind of calculation method of pollution concentration, computing device and terminal | |
| CN115578038A (en) | Electric energy meter logistics scheduling method and system for large-scale batch rotation tasks | |
| Li et al. | A hybrid simulated annealing heuristic for multistage heterogeneous fleet scheduling with fleet sizing decisions | |
| CN109086532A (en) | A kind of tiered warehouse facility HWIL simulation modeling method based on OOPN pessimistic concurrency control | |
| Yu et al. | A vehicle routing problem with multiple overlapped batches | |
| CN109035112A (en) | Method and system are determined based on the urban construction and renewal model of multisource data fusion | |
| CN106130929B (en) | The service message automatic processing method and system of internet insurance field based on graph-theoretical algorithm | |
| CN109255475A (en) | The maximized method and device of vehicle transport loading capacity based on maximum spanning tree | |
| CN103745327A (en) | High-efficiency logistics information management method based on internet of things | |
| CN105956816A (en) | Cargo transportation information intelligent processing method | |
| CN109242172A (en) | The maximized method and device of vehicle transport loading capacity based on dijkstra's algorithm | |
| CN116384853B (en) | Digital twin intelligent logistics management method and device | |
| WO2023071374A1 (en) | Method and apparatus for processing data of goods | |
| CN115456247A (en) | Route planning method and device, computer equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190118 |
|
| RJ01 | Rejection of invention patent application after publication |