CN113390414A - Military oil delivery path planning method - Google Patents
Military oil delivery path planning method Download PDFInfo
- Publication number
- CN113390414A CN113390414A CN202110458694.3A CN202110458694A CN113390414A CN 113390414 A CN113390414 A CN 113390414A CN 202110458694 A CN202110458694 A CN 202110458694A CN 113390414 A CN113390414 A CN 113390414A
- Authority
- CN
- China
- Prior art keywords
- chromosomes
- cost
- node
- shortest
- points
- 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
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000002156 mixing Methods 0.000 claims abstract description 4
- 210000000349 chromosome Anatomy 0.000 claims description 61
- 108090000623 proteins and genes Proteins 0.000 claims description 23
- 230000035772 mutation Effects 0.000 claims description 11
- 238000013178 mathematical model Methods 0.000 claims description 6
- 238000012546 transfer Methods 0.000 claims description 6
- 238000005457 optimization Methods 0.000 claims description 5
- 238000004891 communication Methods 0.000 claims description 3
- 230000001186 cumulative effect Effects 0.000 claims description 3
- 238000010586 diagram Methods 0.000 claims description 3
- 230000000717 retained effect Effects 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/20—Instruments for performing navigational calculations
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- Automation & Control Theory (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
One embodiment of the invention discloses a military oil delivery path planning method, which comprises the following steps: s10: calculating the shortest delivery path between the starting point and the end point according to the actual map condition; s20: and planning the oil blending sequence based on the shortest delivery path. The method has a dynamic obstacle avoidance searching function, can dynamically adjust the searching direction of the algorithm as required by reconstructing the weight coefficients with different costs, can expand the searching direction on the basis of improving the searching efficiency, and avoids trapping in a local optimal solution.
Description
Technical Field
The present invention relates to the field of path planning. And more particularly, to a military oil delivery path planning method.
Background
The oil delivery path planning difficulty is increased by the problems of wide amplitude personnel, different battlefield configuration positions, uneven distribution, huge road network, complex road conditions and the like in China. When oil is delivered to multiple delivery points, the allocation sequence and the path planning are carried out by depending on manual experience and in a manual arrangement mode without the participation of a high-level command control system, so that the oil resources cannot be delivered in time according to required time limit. At present, no systematic solution is provided for the military oil distribution problem in China, and most of the solutions focus on solving the problem of planning the shortest path between two points of a single distribution point.
Disclosure of Invention
In view of the above, a first embodiment of the present invention provides a military oil delivery path planning method, including:
s10: calculating the shortest delivery path between the starting point and the end point according to the actual map condition;
s20: and planning the oil blending sequence based on the shortest delivery path.
In a specific embodiment, the S10 includes:
s101: constructing a mathematical model for calculating the shortest path between two points;
s103: constructing a cost function;
s105: and calculating the shortest delivery path by using the mathematical model and the cost function.
In a specific embodiment, the S101 includes:
the map comprises n nodes, and the road distribution diagram is marked as G1＝(V1,A1) Wherein V is1Is a node set, denoted as V1＝{v1 1＝(x1 1,y1 1),...,v1 n＝(x1 n,y1 n) Wherein (x)1 i,y1 i) The coordinate of the vertex i is shown, and the two demand points are respectively marked as v1 startAnd v1 end，A1Representing the set of edges, the distance between vertex j and vertex k is noted
The shortest path is marked as point set P1＝{p1 1,p1 2,...,p1 l}(0<l is less than or equal to n), and the shortest oil delivery path optimization objective function is as follows:
is A1All edges within define a binary variable Oij
Constructing constraint conditions to ensure that the planned path does not pass through a special road section
In a specific embodiment, the S103 includes:
constructing a cost function containing the cost of the current state to the failed road segment,
f(n)＝α×g(n)+β×h(n)+γ×y(n)
wherein g (n) represents an initial state v1 startTo the current state v1 nH (n) represents the current state v1 nTo an end state v1 endY (n) represents the current state v1 nTo all faulty section v1 i(0<i is less than or equal to l); α, β, and γ are weighting coefficients of g (n), h (n), and y (n), respectively, and α + β + γ is 1.
In a specific embodiment, the S105 includes:
s1051: setting initial values alpha, beta and gamma of cost function influence factors;
s1053 generating P1', wherein P1' includes the elements of being in communication with a current road node and OijAll nodes of 1;
s1055: judging whether the cost is unbalanced according to the judgment basis, if so, resetting the values of the cost function influence factors alpha, beta and gamma, otherwise, performing S1057, wherein the judgment basis is as follows: judging whether the cost function satisfies the following formula, if yes, the cost is balanced, otherwise, the cost is unbalanced
S1057: computing a set P1' cost value of each element in P1' minimum cost value selection node v1 2Updating the Path Access sequence P1＝{v1 start,v1 2}；
S1059: repeating S1053-1057 until v is accessed1 endUntil now.
In a specific embodiment, the S20 includes:
s201: constructing an objective function of a transfer sequence plan, comprising the following steps:
denote the network distribution map of m points as G2＝(V2,A2) Wherein the m points include m-1 demand points and 1 distribution station, V2Is a demand point set, denoted as V2＝{v2 1＝(x2 1,y2 1),...,v2 m＝(x2 m,y2 m) P, the scheduling order is denoted as P2＝{p2 1,p2 2,...,p2 mCalculating the shortest distance D between each two points according to the S105ij 1Then the target function of the calling sequence planning is
Will demand point v2 iThe number of accesses is defined as
Constraint condition of 0<i≤m,Ni1 so that each demand point in the scheduling scheme is visited and only once;
s202, representing a scheduling sequence by using genes and chromosomes and generating an initial feasible solution;
s203: establishing a fitness function, and calculating the adaptability of all feasible solutions;
s205: determining chromosomes needing to be reserved, chromosomes formed after crossing and chromosomes formed after mutation;
s207: updating the population until an iteration condition is met;
s209: and arranging the node serial numbers in a descending order according to the node weights to obtain a transfer sequence.
In a specific embodiment, the S202 includes:
the total number of nodes is m, the total number of chromosomes of each generation is GEN, and then the chromosome i is expressed as chromoi＝{a1 i,a2 i,...,am i}, in which the gene value is 0<ak i<1 represents the weight of the node k, and if the gene value is large, the node is accessed preferentially;
the node sequence numbers are arranged according to the gene values on the chromosome in a descending order to obtain an initial feasible solution.
In one embodiment, the fitness function is
Wherein D isi 2For determining the degree of excellence of chromosome i.
In a specific embodiment, the S205 includes:
the composition ratio of the chromosomes to be retained, the chromosomes formed after crossing and the chromosomes formed after mutation is t1,t2,t3The three parameters satisfy the following conditions:
t1+t2+t3＝1
if the fitness of chromosome i is f (x)i) Then the probability that the individual is selected is:
the cumulative probability of this chromosome is:
in [0,1 ]]Randomly generating random number r in interval1Retention of the formula Q (x)k-1)≤r1<Q(xk) The kth chromosome of (1);
two chromosomes can form two new chromosomes through crossing operation, and the crossing points r are randomly set2∈N*,1≤r2M is less than or equal to m. Randomly generating [0,1 ]]Randomly generating random number r in interval3Comparison of r3And cross probability PmIf r is3>PmIf so, the two chromosomes are crossed with each other, otherwise, no operation is performed, and the crossing operation is that the genes after the crossing of the two chromosomes are mutually exchanged to form two new chromosomes.
In a specific embodiment, the S205 further includes:
randomly setting the intersection r4∈N*,1≤r4M or less, randomly generating [0,1 ]]Random number r in interval5Comparison of r5And cross probability PcIf r is5>PcThen mutation operation is performed, i.e., the gene value of the gene locus is changed to [0,1 ]]Random number r in interval6On the contraryNo mutation is performed.
The invention has the following beneficial effects:
the method solves the problem of path planning of oil delivery at multiple delivery points under the condition of a complex network, has a dynamic obstacle avoidance search function by introducing the weight coefficients, can dynamically adjust the search direction as required by reconstructing the weight coefficients with different costs, expands the search direction on the basis of improving the search efficiency, and avoids the algorithm from falling into a local optimal solution. And then calculating the shortest paths between the distribution points and all the supply points and between the two points between the supply points, and then calculating the shortest oil delivery allocation sequence problem based on the total delivery path by using a genetic algorithm based on a priority value, thereby saving more time.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic diagram of a military oil delivery path planning method according to an embodiment of the present invention.
FIG. 2 is a flow chart of a military oil delivery route planning method that can implement one embodiment of the present invention.
Detailed Description
In order to make the technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be described in detail with reference to the accompanying drawings.
As shown in fig. 1, in order to implement the military oil delivery route planning method and system architecture according to an embodiment of the present invention, the system architecture may include a map data set 101 and a server 103. The map data set 101 includes a plurality of road distribution maps including a plurality of nodes, and stores the road distribution map of the planned delivery route and the road distribution map of the unplanned route, respectively, and the server 103 is a server providing various services, such as a background server providing support for calculating a tracking target measurement value.
It should be noted that the map data set 101 may be stored on other devices, on a network, or directly in the server 103, which is not limited in this application.
As shown in fig. 2, a military oil delivery path planning method includes:
s10: calculating the shortest delivery path between the starting point and the end point according to the actual map condition;
s101: constructing a mathematical model for calculating the shortest path between two points;
the road distribution map containing n nodes is marked as G1＝(V1,A1) Node set is denoted as V1＝{v1 1＝(x1 1,y1 1),...,v1 n＝(x1 n,y1 n) In which (x)1 i,y1 i) The coordinate of the vertex i is shown, and the two demand points are respectively marked as v1 startAnd v1 end，A1Representing the set of edges. The distance between vertex j and vertex k is noted as
The shortest path is marked as point set P1＝{p1 1,p1 2,...,p1 l}(0<l is less than or equal to n), and the shortest oil delivery path optimization objective function is as follows:
the problems of road blockage, bridge damage, enemy interference and the like exist in the actual military oil delivery process. In such a case, the relevant link is prohibited from access, a1All edges within define a binary variable OijIf O isijIs 1, the path can pass if OijAt 0, the path may not be passed.
The following constraint conditions are required to be met when the planned path does not pass through a special road section:
s103: constructing a cost function;
constructing an initial cost function as f (n) ═ g (n) + h (n), f (n) representing the actual cost from the initial state through state n, g (n) the actual cost from the initial state to state n in the state space, and h (n) the estimated cost from state n to the target state. In order to solve the problem that the cost from the current state to the fault road section is increased in the initial cost function by forbidding the access to the road section in the actual delivery process, weight coefficients are added into the three types of cost, the solution space priority search direction is changed by adjusting the size of the weight coefficients, and finally the cost function containing the cost from the current state to the fault road section is obtained,
f(n)＝α×g(n)+β×h(n)+γ×y(n)
wherein g (n) represents an initial state v1 startTo the current state v1 nH (n) represents the current state v1 nTo an end state v1 endY (n) represents the current state v1 nTo all faultsSection of road v1 i(0<i is less than or equal to l); α, β, and γ are weighting coefficients of g (n), h (n), and y (n), respectively, and α + β + γ is 1.
By introducing y (n) cost factors, the method has a function of dynamically avoiding obstacles in the process of searching for the optimal path. The cost function is composed of 3 factors, if the cost value of a certain factor is too small/too large, the cost function is unbalanced, the search is continued towards the direction, and the local optimal solution is trapped. The invention provides a method for adjusting the search direction of the algorithm, expanding the search range and avoiding the generation of local optimal solution by dynamically planning the values of alpha, beta and gamma.
S105: and calculating the shortest delivery path by using the mathematical model and the cost function.
S1051: setting initial values alpha, beta and gamma of cost function influence factors;
s1053 generating P1', wherein P1' includes the elements of being in communication with a current road node and OijAll nodes of 1;
s1055: judging whether the cost is unbalanced according to the judgment basis, if so, resetting the values of the cost function influence factors alpha, beta and gamma, otherwise, performing S1057, wherein the judgment basis is as follows: judging whether the cost function satisfies the following formula, if yes, the cost is balanced, otherwise, the cost is unbalanced
S1057: computing a set P1' cost value of each element in P1' minimum cost value selection node v1 2Updating the Path Access sequence P1＝{v1 start,v1 2}；
S1059: repeating S1053-1057 until v is accessed1 endUntil now.
S20: and planning the oil blending sequence based on the shortest delivery path.
S201: constructing an objective function for a call sequence plan
Two pointsAfter the shortest delivery route planning is completed, the demand point allocation sequence planning needs to be carried out by taking the shortest total path as a target. Denote the network profile comprising m points as G2＝(V2,A2) Wherein the m points include m-1 demand points and 1 distribution station, V2Is a demand point set, denoted as V2＝{v2 1＝(x2 1,y2 1),...,v2 m＝(x2 m,y2 m) P, the scheduling order is denoted as P2＝{p2 1,p2 2,...,p2 mAnd the target function of the calling and dialing sequence planning is
Wherein D isij 1For the shortest distance of each two points calculated in S105,
will demand point v2 iThe number of accesses is defined as
Constraint condition of 0<i≤m,Ni1, such that each demand point in the scheduling scheme is accessed and only accessed once,
s202, representing a scheduling sequence by using genes and chromosomes and generating an initial feasible solution;
the process of generating a feasible solution to the problem of transpose order scheduling and representing it in terms of genes and chromosomes is called chromosome coding. The total number of nodes is m, the total number of chromosomes of each generation is GEN, and then the chromosome i is expressed as chromoi＝{a1 i,a2 i,...,am i}, in which the gene value is 0<ak i<1 represents the weight of the node k, and if the gene value is large, the node is accessed preferentially
Arranging the node serial numbers in descending order according to the gene values on the chromosome, namely the weight of a certain node, and obtaining a transfer sequence;
s203: establishing a fitness function, and calculating the adaptability of all feasible solutions;
the goodness of the individual can be calculated by a fitness function, the individual with higher fitness has higher retention probability, the gene can be continuously inherited in the population, and the goodness of the chromosome i is calculated by the advancing distance D of the allocation sequencei 2Determining a fitness function f (x) as:
s205: determining chromosomes needing to be reserved, chromosomes formed after crossing and chromosomes formed after mutation;
the calculation method based on genetics is a global search calculation method proposed by imitating the biological evolution theory in nature. Each feasible solution of the optimization problem corresponds to a chromosome, individuals with high fitness are reserved through operations such as crossing, variation and selection, a new population is generated, and the optimal solution of the optimization problem is approached through continuous iteration. The new population chromosomes respectively have the proportion of t formed by crossing, variation and selection1,t2,t3The three parameters satisfy the following conditions:
t1+t2+t3＝1
whether the individual is retained or not is determined by the method of rotation betting, if the fitness of the chromosome i is f (x)i) Then the probability that the individual is selected is:
the cumulative probability of this chromosome is:
in [0,1 ]]Randomly generating random number r in interval1Retention of the formula Q (x)k-1)≤r1<Q(xk) The kth chromosome of (1);
by adopting a single-point crossover operator, two chromosomes can form two new chromosomes through crossover operation. Randomly setting the intersection r2∈N*,1≤r2M is less than or equal to m. Randomly generating [0,1 ]]Randomly generating random number r in interval3Comparison of r3And cross probability PmIf r is3>PmIf so, the two chromosomes are crossed with each other, otherwise, no operation is performed. Performing cross operation, namely performing mutual exchange of genes behind the cross point of the two chromosomes to form two new chromosomes;
randomly setting the intersection r4∈N*,1≤r4M or less, randomly generating [0,1 ]]Random number r in interval5Comparison of r5And cross probability PcIf r is5>PcThen mutation operation is performed, i.e., the gene value of the gene locus is changed to [0,1 ]]Random number r in interval6Otherwise, no mutation is performed.
S207: updating the population into a selected reserved chromosome, a crossed chromosome and a mutated chromosome until an iteration condition is met;
s209: and arranging the node serial numbers in a descending order according to the node weights to obtain a transfer sequence.
It should be understood that the above-mentioned embodiments of the present invention are only examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention, and it will be obvious to those skilled in the art that other variations or modifications may be made on the basis of the above description, and all embodiments may not be exhaustive, and all obvious variations or modifications may be included within the scope of the present invention.
Claims (10)
1. A military oil delivery path planning method is characterized by comprising the following steps:
s10: calculating the shortest delivery path between the starting point and the end point according to the actual map condition;
s20: and planning the oil blending sequence based on the shortest delivery path.
2. The method according to claim 1, wherein the S10 includes:
s101: constructing a mathematical model for calculating the shortest path between two points;
s103: constructing a cost function;
s105: and calculating the shortest delivery path by using the mathematical model and the cost function.
3. The method according to claim 1, wherein the S101 comprises:
the map comprises n nodes, and the road distribution diagram is marked as G1＝(V1,A1) Wherein V is1Is a node set, denoted as V1＝{v1 1＝(x1 1,y1 1),...,v1 n＝(x1 n,y1 n) Wherein (x)1 i,y1 i) The coordinate of the vertex i is shown, and the two demand points are respectively marked as v1 startAnd v1 end，A1Representing the set of edges, the distance between vertex j and vertex k is noted
The shortest path is marked as point set P1＝{p1 1,p1 2,...,p1 lAnd (l is more than 0 and less than or equal to n), the shortest oil delivery path optimization objective function is as follows:
is A1All edges within define a binary variable Oij
Constructing constraint conditions to ensure that the planned path does not pass through a special road section
4. The method of claim 3, wherein the S103 comprises:
constructing a cost function containing the cost of the current state to the failed road segment,
f(n)＝α×g(n)+β×h(n)+γ×y(n)
wherein g (n) represents an initial state v1 startTo the current state v1 nH (n) represents the current state v1 nTo an end state v1 endY (n) represents the current state v1 nTo all faulty section v1 i(i is more than 0 and less than or equal to l); α, β, and γ are weighting coefficients of g (n), h (n), and y (n), respectively, and α + β + γ is 1.
5. The method according to claim 1, wherein the S105 comprises:
s1051: setting initial values alpha, beta and gamma of cost function influence factors;
s1053 generating P1', wherein P1' includes the elements of being in communication with a current road node and OijAll nodes of 1;
s1055: judging whether the cost is unbalanced according to the judgment basis, if so, resetting the values of the cost function influence factors alpha, beta and gamma, otherwise, performing S1057, wherein the judgment basis is as follows: judging whether the cost function satisfies the following formula, if yes, the cost is balanced, otherwise, the cost is unbalanced
S1057: computing a set P1' cost value of each element in P1' minimum cost value selection node v1 2Updating the Path Access sequence P1＝{v1 start,v1 2}；
S1059: repeating S1053-1057 until v is accessed1 endUntil now.
6. The method according to claim 1, wherein the S20 includes:
s201: constructing an objective function of a transfer sequence plan, comprising the following steps:
denote the network distribution map of m points as G2＝(V2,A2) Wherein the m points include m-1 demand points and 1 distribution station, V2Is a demand point set, denoted as V2＝{v2 1＝(x2 1,y2 1),...,v2 m＝(x2 m,y2 m) P, the scheduling order is denoted as P2＝{p2 1,p2 2,...,p2 mCalculating the shortest distance D between each two points according to the S105ij 1Then the target function of the calling sequence planning is
Will demand point v2 iThe number of accesses is defined as
The constraint condition is that i is more than 0 and less than or equal to m, Ni1 so that each demand point in the scheduling scheme is visited and only once;
s202, representing a scheduling sequence by using genes and chromosomes and generating an initial feasible solution;
s203: establishing a fitness function, and calculating the adaptability of all feasible solutions;
s205: determining chromosomes needing to be reserved, chromosomes formed after crossing and chromosomes formed after mutation;
s207: updating the population until an iteration condition is met;
s209: and arranging the node serial numbers in a descending order according to the node weights to obtain a transfer sequence.
7. The method according to claim 6, wherein the S202 comprises:
the total number of nodes is m, the total number of chromosomes of each generation is GEN, and then the chromosome i is expressed as chromoi＝{a1 i,a2 i,...,am iIn which the gene value 0 < ak iIf the weight of the node k is less than 1, if the gene value is large, the node is accessed preferentially;
the node sequence numbers are arranged according to the gene values on the chromosome in a descending order to obtain an initial feasible solution.
8. The method of claim 1, wherein the fitness function is
Wherein D isi 2For determining the degree of excellence of chromosome i.
9. The method according to claim 1, wherein the S205 comprises:
the composition ratio of the chromosomes to be retained, the chromosomes formed after crossing and the chromosomes formed after mutation is t1,t2,t3The three parameters satisfy the following conditions:
t1+t2+t3＝1
if the fitness of chromosome i is f (x)i) Then the probability that the individual is selected is:
the cumulative probability of this chromosome is:
in [0,1 ]]Randomly generating random number r in interval1Retention of the formula Q (x)k-1)≤r1＜Q(xk) The kth chromosome of (1);
two chromosomes can form two new chromosomes through crossing operation, and the crossing points r are randomly set2∈N*,1≤r2M is less than or equal to m. Randomly generating [0,1 ]]Randomly generating random number r in interval3Comparison of r3And cross probability PmIf r is3＞PmIf so, the two chromosomes are crossed with each other, otherwise, no operation is performed, and the crossing operation is that the genes after the crossing of the two chromosomes are mutually exchanged to form two new chromosomes.
10. The method according to claim 1, wherein the S205 further comprises:
randomly setting the intersection r4∈N*,1≤r4M or less, randomly generating [0,1 ]]Random number r in interval5Comparison of r5And cross probability PcIf r is5＞PcThen perform mutation operationThen, the gene value of the gene locus is changed to [0,1 ]]Random number r in interval6Otherwise, no mutation is performed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110458694.3A CN113390414A (en) | 2021-04-27 | 2021-04-27 | Military oil delivery path planning method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110458694.3A CN113390414A (en) | 2021-04-27 | 2021-04-27 | Military oil delivery path planning method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113390414A true CN113390414A (en) | 2021-09-14 |
Family
ID=77617937
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110458694.3A Pending CN113390414A (en) | 2021-04-27 | 2021-04-27 | Military oil delivery path planning method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113390414A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114281108A (en) * | 2021-12-28 | 2022-04-05 | 北京神星科技有限公司 | Delivery task planning method based on hierarchical improved genetic algorithm |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002502997A (en) * | 1998-02-03 | 2002-01-29 | シーメンス アクチエンゲゼルシヤフト | Path planning method of mobile unit for surface work |
| CN103324982A (en) * | 2013-06-07 | 2013-09-25 | 银江股份有限公司 | Path planning method based on genetic algorithm |
| CN107345815A (en) * | 2017-07-24 | 2017-11-14 | 东北大学 | A kind of home-services robot paths planning method based on improvement A* algorithms |
| CN108549378A (en) * | 2018-05-02 | 2018-09-18 | 长沙学院 | A kind of mixed path method and system for planning based on grating map |
| CN109343528A (en) * | 2018-10-30 | 2019-02-15 | 杭州电子科技大学 | A kind of energy-efficient unmanned plane path planning barrier-avoiding method |
-
2021
- 2021-04-27 CN CN202110458694.3A patent/CN113390414A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002502997A (en) * | 1998-02-03 | 2002-01-29 | シーメンス アクチエンゲゼルシヤフト | Path planning method of mobile unit for surface work |
| CN103324982A (en) * | 2013-06-07 | 2013-09-25 | 银江股份有限公司 | Path planning method based on genetic algorithm |
| CN107345815A (en) * | 2017-07-24 | 2017-11-14 | 东北大学 | A kind of home-services robot paths planning method based on improvement A* algorithms |
| CN108549378A (en) * | 2018-05-02 | 2018-09-18 | 长沙学院 | A kind of mixed path method and system for planning based on grating map |
| CN109343528A (en) * | 2018-10-30 | 2019-02-15 | 杭州电子科技大学 | A kind of energy-efficient unmanned plane path planning barrier-avoiding method |
Non-Patent Citations (1)
| Title |
|---|
| 王安琪等: "基于改进Dijkstra算法和遗传算法的军用油料投送问题研究", 《第七届中国指挥控制大会论文集》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114281108A (en) * | 2021-12-28 | 2022-04-05 | 北京神星科技有限公司 | Delivery task planning method based on hierarchical improved genetic algorithm |
| CN114281108B (en) * | 2021-12-28 | 2024-05-03 | 北京神星科技有限公司 | Delivery task planning method based on hierarchical improvement genetic algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111310999B (en) | Warehouse mobile robot path planning method based on improved ant colony algorithm | |
| Gallego et al. | Parallel simulated annealing applied to long term transmission network expansion planning | |
| Li et al. | A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities | |
| Hardiansyah et al. | Solving economic load dispatch problem using particle swarm optimization technique | |
| Li et al. | Efficient path planning method based on genetic algorithm combining path network | |
| CN114815802A (en) | Unmanned overhead traveling crane path planning method and system based on improved ant colony algorithm | |
| Sevkli et al. | A novel discrete particle swarm optimization for p-median problem | |
| CN110460091A (en) | A kind of acquisition methods of power transmission network optimum programming under new energy access | |
| CN112052544A (en) | Wind power plant current collection network design method and system, storage medium and computing device | |
| CN113390414A (en) | Military oil delivery path planning method | |
| CN115470600A (en) | Electric vehicle charging station planning method based on multi-objective optimization | |
| CN108711860B (en) | Parallel computing-based power distribution network transformer substation-line joint planning method | |
| CN116820110B (en) | Ecological environment monitoring task planning method and device based on intelligent optimization algorithm | |
| CN113379268A (en) | Agricultural machinery scheduling method for resolving genetic algorithm initial population based on Christofises | |
| Zhang et al. | Combining extended imperialist competitive algorithm with a genetic algorithm to solve the distributed integration of process planning and scheduling problem | |
| CN112787833B (en) | Method and device for deploying CDN (content delivery network) server | |
| Chiang et al. | A genetic-based algorithm with the optimal partition approach for the cell formation in bi-directional linear flow layout | |
| Shirakawa et al. | Multi-objective optimization system for plant layout design (3rd report, Interactive multi-objective optimization technique for pipe routing design) | |
| CN110503234B (en) | Method, system and equipment for logistics transportation scheduling | |
| CN115270377B (en) | Multi-cable optimal path planning method based on improved ant colony algorithm | |
| Dong et al. | Ant colony optimization for VRP and mail delivery problems | |
| CN112070351B (en) | Substation optimization site selection method based on gravity center regression and particle swarm mixing algorithm | |
| CN116339973A (en) | Digital twin cloud platform computing resource scheduling method based on particle swarm optimization algorithm | |
| CN113298315A (en) | Electric vehicle charging station site selection optimization method based on double-layer coding | |
| CN108921354A (en) | A method of the ant colony algorithm for solving TSP problems based on particle group optimizing |
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: 20210914 |