Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method and system for vehicle route planning

A technology of vehicle routing and optimal routing, applied in the fields of genetic laws, road network navigators, instruments, etc., can solve problems such as affecting algorithm efficiency, poor convergence performance, and insufficient antibody competitiveness, to improve convergence stability and improve performance. The effect of early convergence and enhancement of competitive potential

Active Publication Date: 2021-11-02
HUBEI UNIV
View PDF10 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] 1. Simulated annealing algorithm: slow convergence speed, long execution time, and large parameter dependence;
[0006] 2. Genetic Algorithm: It is easy to fall into local prematurity, poor convergence performance, and the solution is reduced from continuous problems to combination problems, which greatly affects the accuracy;
[0007] 3. Clone selection algorithm: belongs to the evolutionary algorithm cluster, the convergence speed is too fast, and it is easy to fall into local optimum; there are two problems in the clone selection algorithm in solving the vehicle route planning problem: first, the existence of intermediate antibodies that cannot be eliminated in time affects the efficiency of the algorithm, Second, there is a problem of insufficient competitiveness of newly generated antibodies when ensuring the diversity of antibodies
[0008] 4. Ant colony algorithm: the calculation overhead is too large, and the solution efficiency is not high
[0010] Existing vehicle path planning methods have inaccurate results, low precision, low efficiency and long time-consuming
For example, when simulated annealing is used as the core algorithm to solve the vehicle planning route in the logistics vehicle route planning system, due to the slow convergence speed of this method, the user needs to wait for a long time to get the solution, which is not user-friendly and the system efficiency is low
Another example is when the genetic algorithm or the original clone selection algorithm is used as the core algorithm of the logistics vehicle route planning system, because this type of method is prone to local prematurity, the result is often not the optimal path, resulting in a lot of manpower and material resources in the actual logistics distribution. , reducing the efficiency of logistics distribution

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and system for vehicle route planning
  • Method and system for vehicle route planning
  • Method and system for vehicle route planning

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0098] Embodiment 1: clone selection algorithm (CSA) steps:

[0099] Step 1. Initialize relevant parameters such as the size of the antibody set, the number of iterations, and the number of clones, and randomly select an antigen from the antigen set to generate a candidate antibody set. The candidate antibody set consists of a memory set and a remaining set.

[0100] Step 2. Calculate the affinity of each antibody in the candidate antibody set to the antigen, and select the top n antibodies with the highest affinity.

[0101] Step 3. Cloning the n antibodies, the number of antibody clones is positively correlated with its affinity to the antigen.

[0102] Step 4. Mutate the antibody set produced after cloning, and the antibody with higher affinity has a lower probability of mutation.

[0103] Step 5. Calculate the antibody affinity after mutation, select the antibody with the highest affinity and compare it with the antibodies in the current memory set, and select the antibod...

Embodiment 2

[0118] Embodiment 2: Applying the improved clone selection algorithm to solve the vehicle path planning problem Specific operations:

[0119] First provide the input of the algorithm: the number of cities and the coordinates of each city.

[0120] Step 1, population initialization and initialization parameter setting;

[0121] In the present invention, the antigen represents the sum of the distances between all the cities that the vehicle will pass through, and the antibody represents the sorted sequence of all the city paths that the vehicle will pass through. Randomly generate 100 path sorting sequences containing all cities as the initial antibody population. For different data sets, the initialization parameters are set as follows:

[0122] Table 1 Initialization parameter setting table

[0123]

[0124] Step 2, affinity calculation

[0125] For the vehicle route planning problem, the affinity calculation formula between antibody and antigen is as follows:

[0126]...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention belongs to the technical field of vehicle path planning, and discloses a vehicle path planning method and system. By initializing N random paths as antibodies and putting them into antibody candidate sets, the distance of each vehicle path is calculated as the distance between each antibody and the antigen. Affinity, initialize and mark each antibody; select the top n antibodies with the highest affinity, perform a cloning operation on each antibody, and update the label at the same time; re-label the mutated antibody; recalculate the affinity of the mutated antibody, and select a For the N antibodies with the highest affinity between antigens, update the antibody labeling of the antibodies in the antibody candidate set; when the antibody meets the antibody forgetting threshold, forget; when the number of evaluation function calls is satisfied, the calculation is terminated, and the optimal vehicle route is obtained. The invention carries out population marking and updating on the antibodies in the antibody concentration through the replacement process, so as to achieve the effect of improving the convergence speed and convergence stability of the algorithm.

Description

technical field [0001] The invention belongs to the technical field of vehicle route planning, and in particular relates to a vehicle route planning method and system. Background technique [0002] At present, the clonal selection algorithm is a new type of intelligent optimization algorithm inspired by the clonal selection principle of the biological immune system; Ag (antigen) antigen: the present invention specifically refers to the vehicle route planning problem requirements; Ab (antibody) antibody: the present invention specifically refers to The sorting sequence of each city route; Forgetting mechanism: Forgetting is a phenomenon of information loss. In a specific environment, the loss of information is meaningful. [0003] The vehicle routing problem (Vehicle Routing Problem, VRP) was first proposed by Dantzig and Ramser in 1959. It refers to a certain number of customers, each of whom has a different quantity of goods demand. The distribution center provides goods to...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G01C21/34G06N3/12G06N3/00
CPCG01C21/3446G06N3/006G06N3/126
Inventor 杨超陈炳秋夏雨微闻海洋贾琳程镇
Owner HUBEI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products