CN105157712A - Vehicle routing planning method and planning system - Google Patents
Vehicle routing planning method and planning system Download PDFInfo
- Publication number
- CN105157712A CN105157712A CN201510508100.XA CN201510508100A CN105157712A CN 105157712 A CN105157712 A CN 105157712A CN 201510508100 A CN201510508100 A CN 201510508100A CN 105157712 A CN105157712 A CN 105157712A
- Authority
- CN
- China
- Prior art keywords
- solution
- initial
- initial parameter
- optimum solution
- path
- 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.)
- Granted
Links
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/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
- 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/3407—Route searching; Route guidance specially adapted for specific applications
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention applies to the field of vehicle routing planning and provides a vehicle routing planning method and planning system. The method comprises steps as follows: an initial solution of a vehicle routing scheme is established on the basis of a minimum cost insertion method based on user demands; initial parameters of the initial solution are set; whether the initial solution meets the end condition of a stage is judged, the optimal solution is updated according to a judgement result, corresponding initial parameters of the optimal solution are updated, and the optimal solution is updated according to the judgement result as follows: if the initial solution doesn't meet the end condition, the optimal solution is acquired with a variable neighborhood search algorithm, and if the initial solution meets the end condition, the initial solution is the optimal solution, and restarting is performed. Through implementation of the embodiment of the invention, the routing planning procedure can be simplified.
Description
Technical field
The invention belongs to vehicle path planning field, particularly relate to a kind of planing method and planning system of vehicle route.
Background technology
Along with the arrival of economic globalization, manufacturing industry, retail trade and ecommerce have expedited the emergence of the fast development of modern logistics.The widespread use of logistics information technology, the construction of management information system, Logistics Information Platform, logistics distribution system advances fast.Vehicle path planning is the important step of urban logistics distribution, is also basis and the important module of logistics distribution information system foundation.
Logistics distribution center is often faced with the constraint of various goods stock resource, an actual constraint has limited various, the vehicle number of often kind of vehicle fixes the capacity limit with the vehicle of every type, this problem is the Multi-types vehicle routine problem (HeterogeneousFixedFleetVehicleRoutingProblem typically with fixed vehicle number, HFFVRP), and the arrangement vehicle route of how economical rationality in logistics distribution, most important for development low cost, high efficiency material flow industry.
Tabu search algorithm (TabuSearch is called for short TS) is the one overall situation Stepwise optimization algorithm proposed in 1986 by Glover, simulates the mental process of the mankind.Tabu search algorithm have employed storage organization and taboo rule in order to avoid roundabout search, and introduces special pardon criterion and absolve by some excellent conditions avoided, thus ensure that the variation of search, is conducive to realizing global optimum.Tabu search algorithm has been applied to many field of engineering technology, comprises production scheduling, machine learning, computer network Route Selection, circuit design and neural network etc.But this algorithm is parameter-dependent, lack dirigibility, variation search and concentrate that the balance of searching for is poor, arithmetic speed is slower.
Variable neighborhood search algorithm (VariableNeighborhoodSearch is called for short VNS) is a kind of meta-heuristic algorithm proposed first in 1997 by Hansen and Mladenovic.It constantly can adjust neighbour structure collection to expand hunting zone in search procedure, produces locally optimal solution, and then again expands hunting zone to explore new locally optimal solution by this locally optimal solution by systematically changing neighbour structure collection.The basic operation of variable neighborhood search algorithm comprises the selection of search order between the structure of neighbour structure collection, neighbour structure, the design of neighbour structure search mechanisms, Local Search design and stopping criterion design etc.Variable neighborhood search algorithm simple structure, has good local search ability and versatility, but variable neighborhood search algorithm is based on neighbour structure collection, is easily absorbed in locally optimal solution.
Summary of the invention
Given this, the invention provides a kind of planing method and planning system of vehicle route, to solve the technical matters of prior art path planning complexity.
The embodiment of the present invention is achieved in that a kind of planing method of vehicle route, said method comprising the steps of:
Minimum cost insertion method based on user's request builds the initial solution of vehicle route scheme;
The initial parameter of described initial solution is set;
Judge whether described initial solution meets the end condition in stage, optimum solution is upgraded according to judged result, and upgrade initial parameter corresponding to described optimum solution, described according to judged result renewal optimum solution, comprise: if do not met, then obtain optimum solution by variable neighborhood search algorithm, if met, then described initial solution be set to optimum solution and restart.
The embodiment of the present invention also provides a kind of planning system of vehicle route, and described system comprises:
Initial solution construction unit, for building the initial solution of vehicle route scheme based on the minimum cost insertion method of user's request;
Initial parameter setting unit, for arranging the initial parameter of the initial solution that described initial solution construction unit builds;
Optimum solution acquiring unit, for judging whether described initial solution meets the end condition in stage, optimum solution is upgraded according to judged result, and upgrade initial parameter corresponding to described optimum solution, described according to judged result renewal optimum solution, comprising: if do not met, then obtain optimum solution by variable neighborhood search algorithm, if met, then described initial solution be set to optimum solution and restart.
The embodiment of the present invention, stage of algorithm and cycle are divided, accommodation is carried out according to the scale of problem solving and network structure, improve the dirigibility of vehicle path planning, the Regulation mechanism of auto-adaptive parameter is incorporated in tabu search algorithm, make the restriction of Tabu Length, neighborhood and neighbor operator perform the parameters such as frequency automatically to regulate according to the change of solution space, effectively balance the centrality in algorithm search and diversity; Construct sequentially variable neighborhood search algorithm and nested type variable neighborhood search algorithm and be respectively used to the search of neighbour structure in algorithm major cycle and the further improvement to best feasible solution, improve the global optimizing ability of vehicle route, shorten search time, make the vehicle route arrangement searched more save logistics transportation cost, and meet the real-time response requirement in application.
Accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme in the embodiment of the present invention, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the process flow diagram of the vehicle path planning method that the embodiment of the present invention provides;
Fig. 2 is touring Distribution path put by vehicle that the embodiment of the present invention provides schematic diagram different client;
Fig. 3 is the schematic diagram of the implementation of the order variable neighborhood search algorithm that the embodiment of the present invention provides;
Fig. 4 is the schematic diagram of neighborhood search operator between 4 kinds of paths providing of the embodiment of the present invention;
Fig. 5 is the schematic diagram of neighborhood search operator in 2 kinds of paths providing of the embodiment of the present invention;
Fig. 6 is the schematic diagram of the implementation of the nested type variable neighborhood search algorithm that the embodiment of the present invention provides;
Fig. 7 is the structural drawing of the vehicle path planning system that the embodiment of the present invention provides.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
In order to technical solutions according to the invention are described, be described below by specific embodiment.
Embodiment one
Be illustrated in figure 1 the process flow diagram of the vehicle path planning method that the embodiment of the present invention provides, said method comprising the steps of:
Step S101, the minimum cost insertion method based on user's request builds the initial solution of vehicle route scheme.
In embodiments of the present invention, the minimum cost insertion method based on user's request is first adopted to build the initial solution of vehicle route scheme.The step of the initial solution of described structure vehicle route scheme, comprising:
1, metric solution vector encoding method encodes solution vector is adopted.
In embodiments of the present invention, solution vector x is expressed as π
jsequence j=1,2 ..., m, the wherein sum of various types of vehicles that has for home-delivery center of m, π
jfor the set that node each in vehicle route sorts successively, vehicle route is expressed as the sequence of touring node successively, and first node and last node of sequence are fixed as home-delivery center's point respectively.As in Fig. 2, the solution vector of vehicle delivery process can be expressed as: π
1=0,5,2, Isosorbide-5-Nitrae, 8,0}, π
2={ 0,6,3,7,9,11,0}, π
3={ 0,10,14,13,12,0}.
2, Stochastic choice m client's point, is initialised to described solution vector by described m client's point and produces m bar Distribution path R
i(i=1,2 ..., m).
In embodiments of the present invention, i is put for each client undetermined, if the path total cost inserting this client point is minimum and demand that is that increase does not exceed the residual capacity in path, then select the feasible path R with greatest residual capacity
k, calculate and insert cost
and client is put i and be inserted into the path R meeting cost minimization
krelevant position.
Described client puts i at path R
kon insertion cost
be calculated as follows:
Wherein, i
1and i
2continue before insertion position node and descendant node respectively, v
kfor the variable cost of vehicle k.
3, when there is the client undetermined not inserting path and putting, j is put for arbitrary client undetermined
1, select the path R with greatest residual capacity
k1, by j
1be inserted into path R
k1on make to insert the position of cost minimization.
In embodiments of the present invention, in order to strengthen the diversity of algorithm, algorithm allows to occur infeasible solution, and what namely can produce vehicle capacity runs counter to operation.To algorithm search to infeasible solutions give certain rejection penalty according to the amount of running counter to, use punishment objective function f (x ') carry out evaluate candidate solution x ', f (x ') comprises former target expense and rejection penalty two parts, and computing method are:
Wherein, P is penalty term, l
kfor the load-carrying amount of exceeding of vehicle k.
Algorithm also adopts long-term memory, objective function f simultaneously
1(x ') is:
Wherein x is current solution, and β is zooming parameter, and D is the maximum absolute difference that f (x) produces in two continuous print iteration steps, and ρ is that client puts the number of times be moved, and K is algorithm iteration number of times up to the present.
Step S102, arranges the initial parameter of described initial solution.
In embodiments of the present invention, the step arranging the initial parameter of initial solution comprises:
1, the initial parameter in stage is set and the initial parameter in cycle is set.
Wherein, the initial parameter in stage comprises: the iterations in a stage is restricted to K
l, zooming parameter β, Tabu Length θ, neighborhood restriction δ.The initial parameter in cycle comprises: the controling parameters σ that feasible and infeasible solution space boundary shakes, and maximum permission solution does not improve number of times K
bL, neighborhood search operator performs frequency F
k, k=1,2 ..., 6.
2, the taboo list of the initial parameter in described stage and the taboo list of the initial parameter in described cycle is emptied.
Step S103, judge whether described initial solution meets the end condition in stage, optimum solution is upgraded according to judged result, and upgrade initial parameter corresponding to described optimum solution, described according to judged result renewal optimum solution, comprising: if do not met, then obtain optimum solution by variable neighborhood search algorithm, if met, then described initial solution be set to optimum solution and restart.
In embodiments of the present invention, after the initial parameter being provided with initial solution, judge whether initial solution meets the end condition in stage, if do not met, then obtain optimum solution by variable neighborhood search algorithm, if met, then initial solution be set to optimum solution and restart, wherein determination methods uses prior art, does not repeat at this.Described variable neighborhood search algorithm obtains optimum solution, comprising:
1, execution sequence variable neighborhood search algorithm, the result of calculation according to described variable neighborhood search algorithm obtains optimum solution.
In embodiments of the present invention, described order variable neighborhood search algorithm, flow process as shown in Figure 3, performs neighbor operator N successively according to given order
k, k=1,2 ..., 6, if algorithm is absorbed in local optimum, will by execution N
kjump to and perform N
k+1, otherwise will from first operator N
1the operator of all uses starts to re-execute, until all cannot improve current optimum solution.
To each operator N
kalso define one and perform frequency F
k, k=1,2 ..., 6, as F
3=10, F
5=∞ then represents that every iteration performs a N 10 times
3, do not perform operator N
5.The execution frequency of operator will adjust according to solution procedure, thus improve dirigibility and the diversity of neighborhood search.
Described neighbor operator to comprise between path search operators two class in search operators and path, and its concrete action mode is respectively as shown in Figure 4 and Figure 5, as follows:
(1) N
1: 1-0 exchanges.
1-0 exchange is that the client between a kind of path puts moving method, and move also referred to as Swap/Shift, client o'clock is inserted into another paths from a paths by it.
(2) N
2: 1-1 exchanges.
1-1 exchanges and belongs to mobile operator between a kind of path, is also that a kind of Swap/Shift moves, and realizes the client's point in a path to put mutual exchange with the client in another paths.
(3) N
3: 2-opt* exchanges.
It is search operators between a kind of path that 2-opt* exchanges, and be the expansion that 1-1 exchanges, the afterbody in two different paths exchanges by mutually.
(4) N
4: Cross exchanges.
It is neighborhood search method between a kind of path that Cross exchanges.First the arc of two neighboring customer points in the neighboring customer point of two in one paths and an other paths is deleted by it, and then by they cross connections.
(5)N
5:Exchange。
Exchange is the neighborhood search operator in a kind of path, is the 1-1 switching method in path.It realizes the exchange operation of two different client's points in a paths.
(6)N
6:Reverse。
Reverse belongs to neighborhood transform method in path.This operator selects the parton road of a paths, is then reversed on this sub-road.
In order to reduce the number of times of potential movement in each iteration, the saving algrithm execution time, guarantee to search better solution simultaneously, the restriction of δ neighborhood search is performed to each neighbor operator, here the δ neighborhood definition of node i is the set of δ the node nearest apart from this node, and namely operator only operates the δ neighborhood of node.
2, by nested type variable neighborhood search algorithm, described optimum solution is improved, and upgrade initial parameter corresponding to described optimum solution.
In embodiments of the present invention, described nested type variable neighborhood search algorithm, performs flow process as shown in Figure 6, is the neighbor operator N to current solution x
r(x) (r=1,2 ..., 6) and each candidate solution x ' execution that produces becomes neighborhood search computing, and selecting of operator is random to increase the diversity of searching for, until N
rx the solution in () cannot be improved till.
It is pointed out that if reach the centre position in cycle, namely
then adjust θ, δ and F
k(k=1,2 ..., 6).
The embodiment of the present invention, stage of algorithm and cycle are divided, accommodation is carried out according to the scale of problem solving and network structure, improve the dirigibility of vehicle path planning, the Regulation mechanism of auto-adaptive parameter is incorporated in tabu search algorithm, make the restriction of Tabu Length, neighborhood and neighbor operator perform the parameters such as frequency automatically to regulate according to the change of solution space, effectively balance the centrality in algorithm search and diversity; Construct sequentially variable neighborhood search algorithm and nested type variable neighborhood search algorithm and be respectively used to the search of neighbour structure in algorithm major cycle and the further improvement to best feasible solution, improve the global optimizing ability of vehicle route, shorten search time, make the vehicle route arrangement searched more save logistics transportation cost, and meet the real-time response requirement in application.
Embodiment two
Be illustrated in figure 7 the structural drawing of the vehicle path planning system that the embodiment of the present invention provides, for convenience of explanation, the part relevant to the embodiment of the present invention be only shown, comprise:
Initial solution construction unit 701, for building the initial solution of vehicle route scheme based on the minimum cost insertion method of user's request.
In embodiments of the present invention, the minimum cost insertion method based on user's request is first adopted to build the initial solution of vehicle route scheme.Described initial solution construction unit 701 build initial solution, is specially:
1, metric solution vector encoding method encodes solution vector is adopted.
In embodiments of the present invention, solution vector x is expressed as π
jsequence j=1,2 ..., m, the wherein sum of various types of vehicles that has for home-delivery center of m, π
jfor the set that node each in vehicle route sorts successively, vehicle route is expressed as the sequence of touring node successively, and first node and last node of sequence are fixed as home-delivery center's point respectively.As in Fig. 2, the solution vector of vehicle delivery process can be expressed as: π
1=0,5,2, Isosorbide-5-Nitrae, 8,0}, π
2={ 0,6,3,7,9,11,0}, π
3={ 0,10,14,13,12,0}.
2, Stochastic choice m client's point, is initialised to described solution vector by described m client's point and produces m bar Distribution path R
i(i=1,2 ..., m).
In embodiments of the present invention, i is put for each client undetermined, if the path total cost inserting this client point is minimum and demand that is that increase does not exceed the residual capacity in path, then select the feasible path R with greatest residual capacity
k, calculate and insert cost
and client is put i and be inserted into the path R meeting cost minimization
krelevant position.
Described client puts i at path R
kon insertion cost
be calculated as follows:
Wherein, i
1and i
2continue before insertion position node and descendant node respectively, v
kfor the variable cost of vehicle k.
3, when there is the client undetermined not inserting path and putting, j is put for arbitrary client undetermined
1, select the path with greatest residual capacity
by j
1be inserted into path
on make to insert the position of cost minimization.
In embodiments of the present invention, in order to strengthen the diversity of algorithm, algorithm allows to occur infeasible solution, and what namely can produce vehicle capacity runs counter to operation.To algorithm search to infeasible solutions give certain rejection penalty according to the amount of running counter to, use punishment objective function f (x ') carry out evaluate candidate solution x ', f (x ') comprises former target expense and rejection penalty two parts, and computing method are:
Wherein, P is penalty term, l
kfor the load-carrying amount of exceeding of vehicle k.
Algorithm also adopts long-term memory, objective function f simultaneously
1(x ') is:
Wherein x is current solution, and β is zooming parameter, and D is the maximum absolute difference that f (x) produces in two continuous print iteration steps, and ρ is that client puts the number of times be moved, and K is algorithm iteration number of times up to the present.
Initial parameter setting unit 702, for arranging the initial parameter of the initial solution that described initial solution construction unit 701 builds.
In embodiments of the present invention, initial parameter setting unit 702 arranges initial parameter, is specially:
1, the initial parameter in stage is set and the initial parameter in cycle is set.
Wherein, the initial parameter in stage comprises: the iterations in a stage is restricted to K
l, zooming parameter β, Tabu Length θ, neighborhood restriction δ.The initial parameter in cycle comprises: the controling parameters σ that feasible and infeasible solution space boundary shakes, and maximum permission solution does not improve number of times K
bL, neighborhood search operator performs frequency F
k, k=1,2 ..., 6.
2, the taboo list of the initial parameter in described stage and the taboo list of the initial parameter in described cycle is emptied.
Optimum solution acquiring unit 703, for judging whether described initial solution meets the end condition in stage, optimum solution is upgraded according to judged result, and upgrade initial parameter corresponding to described optimum solution, described according to judged result renewal optimum solution, comprising: if do not met, then obtain optimum solution by variable neighborhood search algorithm, if met, then described initial solution be set to optimum solution and restart.
In embodiments of the present invention, after the initial parameter being provided with initial solution, judge whether initial solution meets the end condition in stage, if do not met, then obtain optimum solution by variable neighborhood search algorithm, if met, then initial solution be set to optimum solution and restart, wherein determination methods uses prior art, does not repeat at this.Described optimum solution acquiring unit 703 obtains optimum solution, is specially:
1, execution sequence variable neighborhood search algorithm, the result of calculation according to described variable neighborhood search algorithm obtains optimum solution.
In embodiments of the present invention, described order variable neighborhood search algorithm, flow process as shown in Figure 3, performs neighbor operator N successively according to given order
k, k=1,2 ..., 6, if algorithm is absorbed in local optimum, will by execution N
kjump to and perform N
k+1, otherwise will from first operator N
1the operator of all uses starts to re-execute, until all cannot improve current optimum solution.
To each operator N
kalso define one and perform frequency F
k, k=1,2 ..., 6, as F
3=10, F
5=∞ then represents that every iteration performs a N 10 times
3, do not perform operator N
5.The execution frequency of operator will adjust according to solution procedure, thus improve dirigibility and the diversity of neighborhood search.
Described neighbor operator to comprise between path search operators two class in search operators and path, and its concrete action mode is respectively as shown in Figure 4 and Figure 5, as follows:
(1) N
1: 1-0 exchanges.
1-0 exchange is that the client between a kind of path puts moving method, and move also referred to as Swap/Shift, client o'clock is inserted into another paths from a paths by it.
(2) N
2: 1-1 exchanges.
1-1 exchanges and belongs to mobile operator between a kind of path, is also that a kind of Swap/Shift moves, and realizes the client's point in a path to put mutual exchange with the client in another paths.
(3) N
3: 2-opt* exchanges.
It is search operators between a kind of path that 2-opt* exchanges, and be the expansion that 1-1 exchanges, the afterbody in two different paths exchanges by mutually.
(4) N
4: Cross exchanges.
It is neighborhood search method between a kind of path that Cross exchanges.First the arc of two neighboring customer points in the neighboring customer point of two in one paths and an other paths is deleted by it, and then by they cross connections.
(5)N
5:Exchange。
Exchange is the neighborhood search operator in a kind of path, is the 1-1 switching method in path.It realizes the exchange operation of two different client's points in a paths.
(6)N
6:Reverse。
Reverse belongs to neighborhood transform method in path.This operator selects the parton road of a paths, is then reversed on this sub-road.
In order to reduce the number of times of potential movement in each iteration, the saving algrithm execution time, guarantee to search better solution simultaneously, the restriction of δ neighborhood search is performed to each neighbor operator, here the δ neighborhood definition of node i is the set of δ the node nearest apart from this node, and namely operator only operates the δ neighborhood of node.
2, by nested type variable neighborhood search algorithm, described optimum solution is improved, and upgrade initial parameter corresponding to described optimum solution.
In embodiments of the present invention, described nested type variable neighborhood search algorithm, performs flow process as shown in Figure 6, is the neighbor operator N to current solution x
r(x) (r=1,2 ..., 6) and each candidate solution x ' execution that produces becomes neighborhood search computing, and selecting of operator is random to increase the diversity of searching for, until N
rx the solution in () cannot be improved till.
It is pointed out that if reach the centre position in cycle, namely
then adjust θ, δ and F
k(k=1,2 ..., 6).
The embodiment of the present invention, stage of algorithm and cycle are divided, accommodation is carried out according to the scale of problem solving and network structure, improve the dirigibility of vehicle path planning, the Regulation mechanism of auto-adaptive parameter is incorporated in tabu search algorithm, make the restriction of Tabu Length, neighborhood and neighbor operator perform the parameters such as frequency automatically to regulate according to the change of solution space, effectively balance the centrality in algorithm search and diversity; Construct sequentially variable neighborhood search algorithm and nested type variable neighborhood search algorithm and be respectively used to the search of neighbour structure in algorithm major cycle and the further improvement to best feasible solution, improve the global optimizing ability of vehicle route, shorten search time, make the vehicle route arrangement searched more save logistics transportation cost, and meet the real-time response requirement in application.
One of ordinary skill in the art will appreciate that the unit included by above-described embodiment two is carry out dividing according to function logic, but be not limited to above-mentioned division, as long as corresponding function can be realized; In addition, the concrete title of each functional unit, also just for the ease of mutual differentiation, is not limited to protection scope of the present invention.
Those of ordinary skill in the art it is also understood that, the all or part of step realized in above-described embodiment method is that the hardware that can carry out instruction relevant by program has come, described program can be stored in a computer read/write memory medium, described storage medium, comprises ROM/RAM, disk, CD etc.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.
Claims (8)
1. a planing method for vehicle route, is characterized in that, said method comprising the steps of:
Minimum cost insertion method based on user's request builds the initial solution of vehicle route scheme;
The initial parameter of described initial solution is set;
Judge whether described initial solution meets the end condition in stage, optimum solution is upgraded according to judged result, and upgrade initial parameter corresponding to described optimum solution, described according to judged result renewal optimum solution, comprise: if do not met, then obtain optimum solution by variable neighborhood search algorithm, if met, then described initial solution be set to optimum solution and restart.
2. the method for claim 1, is characterized in that, the step of the initial solution of described structure vehicle route scheme, comprising:
Adopt metric solution vector encoding method encodes solution vector;
Stochastic choice m client's point, is initialised to described solution vector by described m client's point and produces m bar Distribution path R
i(i=1,2 ..., m);
When there is the client undetermined not inserting path and putting, j is put for arbitrary client undetermined
1, select the path R with greatest residual capacity
k1, by j
1be inserted into path R
k1on make to insert the position of cost minimization.
3. the method for claim 1, is characterized in that, the described step arranging the initial parameter of initial solution comprises:
The initial parameter in stage is set and the initial parameter in cycle is set;
Empty the taboo list of the initial parameter in described stage and the taboo list of the initial parameter in described cycle.
4. the method as described in any one of claim 1 ~ 2, is characterized in that, described variable neighborhood search algorithm of crossing obtains optimum solution, comprising:
Execution sequence variable neighborhood search algorithm, the result of calculation according to described variable neighborhood search algorithm obtains optimum solution;
By nested type variable neighborhood search algorithm, described optimum solution is improved, and upgrade initial parameter corresponding to described optimum solution.
5. a planning system for vehicle route, is characterized in that, described system comprises:
Initial solution construction unit, for building the initial solution of vehicle route scheme based on the minimum cost insertion method of user's request;
Initial parameter setting unit, for arranging the initial parameter of the initial solution that described initial solution construction unit builds;
Optimum solution acquiring unit, for judging whether described initial solution meets the end condition in stage, optimum solution is upgraded according to judged result, and upgrade initial parameter corresponding to described optimum solution, described according to judged result renewal optimum solution, comprising: if do not met, then obtain optimum solution by variable neighborhood search algorithm, if met, then described initial solution be set to optimum solution and restart.
6. system as claimed in claim 5, it is characterized in that, described initial solution construction unit build initial solution, is specially:
Adopt metric solution vector encoding method encodes solution vector;
Stochastic choice m client's point, is initialised to described solution vector by described m client's point and produces m bar Distribution path R
i(i=1,2 ..., m);
When there is the client undetermined not inserting path and putting, j is put for arbitrary client undetermined
1, select the path R with greatest residual capacity
k1, by j
1be inserted into path R
k1on make to insert the position of cost minimization.
7. system as claimed in claim 5, it is characterized in that, initial parameter setting unit arranges initial parameter, is specially:
The initial parameter in stage is set and the initial parameter in cycle is set;
Empty the taboo list of the initial parameter in described stage and the taboo list of the initial parameter in described cycle.
8. system as claimed in claim 5, is characterized in that, described optimum solution acquiring unit obtains optimum solution, is specially:
Execution sequence variable neighborhood search algorithm, the result of calculation according to described variable neighborhood search algorithm obtains optimum solution;
By nested type variable neighborhood search algorithm, described optimum solution is improved, and upgrade initial parameter corresponding to described optimum solution.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510508100.XA CN105157712B (en) | 2015-08-18 | 2015-08-18 | A kind of planing method and planning system of vehicle route |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510508100.XA CN105157712B (en) | 2015-08-18 | 2015-08-18 | A kind of planing method and planning system of vehicle route |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105157712A true CN105157712A (en) | 2015-12-16 |
CN105157712B CN105157712B (en) | 2019-06-04 |
Family
ID=54798652
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510508100.XA Active CN105157712B (en) | 2015-08-18 | 2015-08-18 | A kind of planing method and planning system of vehicle route |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105157712B (en) |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108038600A (en) * | 2017-12-01 | 2018-05-15 | 中国人民解放军国防科技大学 | Agile earth satellite task planning method |
CN108932564A (en) * | 2018-07-05 | 2018-12-04 | 上海大学 | A kind of method and system of the path planning for determining collection with integrated consistency vehicle |
CN109800910A (en) * | 2019-01-10 | 2019-05-24 | 浙江工业大学 | A kind of vehicle routing optimization method of the meta-heuristic algorithms based on TABU search |
CN109919369A (en) * | 2019-02-26 | 2019-06-21 | 浙江财经大学 | A kind of battery-exchange station addressing and electric car paths planning method |
CN110147971A (en) * | 2019-04-08 | 2019-08-20 | 合肥工业大学 | For planning the method, system and storage medium of vehicle route |
CN110147901A (en) * | 2019-04-08 | 2019-08-20 | 合肥工业大学 | Vehicle path planning method, system and storage medium based on pointer neural network |
CN110378639A (en) * | 2018-09-06 | 2019-10-25 | 北京京东尚科信息技术有限公司 | Distribution route method and system for planning |
CN111199369A (en) * | 2019-12-18 | 2020-05-26 | 南方科技大学 | Addressing route-finding planning method, device, equipment and computer readable storage medium |
WO2020263177A1 (en) * | 2019-06-26 | 2020-12-30 | Swat Mobility Pte. Ltd. | Transportation system and method for passenger and route scheduling |
CN112633609A (en) * | 2021-01-06 | 2021-04-09 | 南方科技大学 | Vehicle path planning method, device, equipment and storage medium |
CN113050614A (en) * | 2019-12-26 | 2021-06-29 | 炬星科技(深圳)有限公司 | Method, device and storage medium for autonomous robot execution capacity management |
CN116539058A (en) * | 2023-05-08 | 2023-08-04 | 山东省交通规划设计院集团有限公司 | Navigation system with line planning function |
Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101866384A (en) * | 2010-06-18 | 2010-10-20 | 杭州电子科技大学 | Improved artificial fish school optimization method based on vehicle path planning |
CN101984412A (en) * | 2010-10-13 | 2011-03-09 | 北京航空航天大学 | Method for scheduling parallel test tasks based on grouping and tabu search |
EP2375364A1 (en) * | 2010-04-12 | 2011-10-12 | Karlsruher Institut für Technologie | Method and system for time-dependent routing |
CN102521724A (en) * | 2011-12-07 | 2012-06-27 | 清华大学 | Planning device and planning method based on vehicle path |
CN102538812A (en) * | 2011-12-07 | 2012-07-04 | 清华大学 | Taboo search simulation optimization system based on dynamic multi-vehicle path plan and method |
CN102855328A (en) * | 2012-09-18 | 2013-01-02 | 浪潮(北京)电子信息产业有限公司 | Parallel variable neighborhood search method |
CN102880798A (en) * | 2012-09-20 | 2013-01-16 | 浪潮电子信息产业股份有限公司 | Variable neighborhood search algorithm for solving multi depot vehicle routing problem with time windows |
CN103413209A (en) * | 2013-07-17 | 2013-11-27 | 西南交通大学 | Method for selecting multi-user and multi-warehouse logistics distribution path |
CN104616070A (en) * | 2015-01-15 | 2015-05-13 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution route |
-
2015
- 2015-08-18 CN CN201510508100.XA patent/CN105157712B/en active Active
Patent Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2375364A1 (en) * | 2010-04-12 | 2011-10-12 | Karlsruher Institut für Technologie | Method and system for time-dependent routing |
CN101866384A (en) * | 2010-06-18 | 2010-10-20 | 杭州电子科技大学 | Improved artificial fish school optimization method based on vehicle path planning |
CN101984412A (en) * | 2010-10-13 | 2011-03-09 | 北京航空航天大学 | Method for scheduling parallel test tasks based on grouping and tabu search |
CN102521724A (en) * | 2011-12-07 | 2012-06-27 | 清华大学 | Planning device and planning method based on vehicle path |
CN102538812A (en) * | 2011-12-07 | 2012-07-04 | 清华大学 | Taboo search simulation optimization system based on dynamic multi-vehicle path plan and method |
CN102855328A (en) * | 2012-09-18 | 2013-01-02 | 浪潮(北京)电子信息产业有限公司 | Parallel variable neighborhood search method |
CN102880798A (en) * | 2012-09-20 | 2013-01-16 | 浪潮电子信息产业股份有限公司 | Variable neighborhood search algorithm for solving multi depot vehicle routing problem with time windows |
CN103413209A (en) * | 2013-07-17 | 2013-11-27 | 西南交通大学 | Method for selecting multi-user and multi-warehouse logistics distribution path |
CN104616070A (en) * | 2015-01-15 | 2015-05-13 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution route |
Non-Patent Citations (4)
Title |
---|
刘霞等: "最小-最大车辆路径问题的禁忌搜索算法", 《***工程》 * |
李建等: "多车次同时集散货物路线问题研究", 《管理科学学报》 * |
李进等: "具有固定车辆数的多车型低碳路径问题及算法", 《计算机集成制造***》 * |
王晓博等: "多车型单配送中心混合装卸车辆路径问题研究", 《***工程学报》 * |
Cited By (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108038600A (en) * | 2017-12-01 | 2018-05-15 | 中国人民解放军国防科技大学 | Agile earth satellite task planning method |
CN108932564A (en) * | 2018-07-05 | 2018-12-04 | 上海大学 | A kind of method and system of the path planning for determining collection with integrated consistency vehicle |
CN110378639A (en) * | 2018-09-06 | 2019-10-25 | 北京京东尚科信息技术有限公司 | Distribution route method and system for planning |
CN109800910A (en) * | 2019-01-10 | 2019-05-24 | 浙江工业大学 | A kind of vehicle routing optimization method of the meta-heuristic algorithms based on TABU search |
CN109919369B (en) * | 2019-02-26 | 2021-04-20 | 浙江财经大学 | Battery exchange station site selection and electric vehicle path planning method |
CN109919369A (en) * | 2019-02-26 | 2019-06-21 | 浙江财经大学 | A kind of battery-exchange station addressing and electric car paths planning method |
CN110147971A (en) * | 2019-04-08 | 2019-08-20 | 合肥工业大学 | For planning the method, system and storage medium of vehicle route |
CN110147901A (en) * | 2019-04-08 | 2019-08-20 | 合肥工业大学 | Vehicle path planning method, system and storage medium based on pointer neural network |
CN110147971B (en) * | 2019-04-08 | 2023-02-03 | 合肥工业大学 | Method, system and storage medium for planning a vehicle path |
WO2020263177A1 (en) * | 2019-06-26 | 2020-12-30 | Swat Mobility Pte. Ltd. | Transportation system and method for passenger and route scheduling |
JP2022500796A (en) * | 2019-06-26 | 2022-01-04 | スワット、モビリティ、ピーティーイー、リミテッドSWAT Mobility Pte. Ltd. | Transportation systems and methods for passenger and route scheduling |
JP7057471B2 (en) | 2019-06-26 | 2022-04-19 | スワット、モビリティ、ピーティーイー、リミテッド | Transportation systems and methods for passenger and route scheduling |
CN111199369A (en) * | 2019-12-18 | 2020-05-26 | 南方科技大学 | Addressing route-finding planning method, device, equipment and computer readable storage medium |
CN111199369B (en) * | 2019-12-18 | 2023-12-12 | 南方科技大学 | Addressing routing method, apparatus, device and computer readable storage medium |
CN113050614A (en) * | 2019-12-26 | 2021-06-29 | 炬星科技(深圳)有限公司 | Method, device and storage medium for autonomous robot execution capacity management |
CN112633609A (en) * | 2021-01-06 | 2021-04-09 | 南方科技大学 | Vehicle path planning method, device, equipment and storage medium |
CN116539058A (en) * | 2023-05-08 | 2023-08-04 | 山东省交通规划设计院集团有限公司 | Navigation system with line planning function |
CN116539058B (en) * | 2023-05-08 | 2024-06-21 | 山东省交通规划设计院集团有限公司 | Navigation system with line planning function |
Also Published As
Publication number | Publication date |
---|---|
CN105157712B (en) | 2019-06-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105157712A (en) | Vehicle routing planning method and planning system | |
CN109583650B (en) | Electric vehicle battery replacement station site selection and logistics distribution joint scheduling method | |
CN108764777B (en) | Electric logistics vehicle scheduling method and system with time window | |
CN112833905B (en) | Distributed multi-AGV collision-free path planning method based on improved A-x algorithm | |
Zhang et al. | A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective | |
CN113074728B (en) | Multi-AGV path planning method based on jumping point routing and collaborative obstacle avoidance | |
US20220292413A1 (en) | Bike sharing rebalancing optimization method based on adaptive neighborhood search algorithm | |
Bordelon Hoff et al. | An overview of path design and dispatching methods for automated guided vehicles | |
Buchhold et al. | Real-time traffic assignment using engineered customizable contraction hierarchies | |
CN112001560A (en) | Two-stage bus scheduling algorithm based on iterative neighborhood search | |
Zhang et al. | A New Energy‐Aware Flexible Job Shop Scheduling Method Using Modified Biogeography‐Based Optimization | |
CN114399125B (en) | Motorcade optimal trajectory control method and device, electronic equipment and storage medium | |
CN113326869A (en) | Deep learning calculation graph optimization method based on longest path fusion algorithm | |
Lin et al. | Niching Pareto ant colony optimization algorithm for bi-objective pathfinding problem | |
Li et al. | Multi-AGVs conflict-free routing and dynamic dispatching strategies for automated warehouses | |
Chaovalitwongse et al. | GRASP with a new local search scheme for vehicle routing problems with time windows | |
CN112562325B (en) | Large-scale urban traffic network flow monitoring method based on block coordinate descent | |
CN112179370B (en) | Continuous optimal route planning method based on dynamic road network | |
Wendong et al. | Design of public bicycle scheduling model based on data mining algorithm | |
Lagos et al. | Combining Tabu search and genetic algorithms to solve the capacitated multicommodity network flow problem | |
Chen et al. | A variable neighbourhood search algorithm for solving dynamic vehicle routing problem under Industry 4.0 | |
Illés et al. | Route planning in matrix production | |
Mejía et al. | A Petri Net based algorithm for minimizing total tardiness in flexible manufacturing systems | |
Zhao et al. | A Levy Flight-Based Offloading Path Decision Scheme in VANET | |
CN117709839B (en) | Crown block path planning method and device based on task time limit requirements |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |