Vehicle path planning method based on chaos gravitational search

A gravitational search and vehicle routing technology, applied in the field of vehicle routing, can solve problems such as low planning efficiency and slow convergence speed, and achieve the effect of improving efficiency and enhancing search performance.

Inactive Publication Date: 2017-12-01
JIANGXI UNIV OF SCI & TECH
View PDF2 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to provide a vehicle path planning method based on chaotic gravity search, which can overcome the slow convergence speed and low planning efficiency of traditional gravity search algorithms to a certain extent when solving large-scale vehicle path planning problems disadvantages, the present invention can improve the efficiency of vehicle path planning

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
  • Vehicle path planning method based on chaos gravitational search
  • Vehicle path planning method based on chaos gravitational search
  • Vehicle path planning method based on chaos gravitational search

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0042] Step 1, enter such as figure 1 The coordinate position of the transportation point shown, and the quantity D=30 of the transportation point is obtained;

[0043] Step 2, the user initializes the population size Popsize=50, the maximum number of evaluations MAX_FEs=200000;

[0044] Step 3, let the current evolution algebra t=0, the current evaluation times FEs=0;

[0045] Step 4, randomly generate the initial population where individual subscripts i=1,2,...,Popsize, and for population P t For the i-th individual in , its random initialization formula is:

[0046]

[0047]

[0048] where dimension subscript j=1,2,...,D, and The sequence weights of D transportation points are stored, Indicates the speed of the i-th individual in each dimension, and rand(0,1) is a random real number generation function that obeys a uniform distribution between [0,1];

[0049] Step 5, calculate the population P t The fitness value of each individual in , and then save the p...

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 discloses a vehicle path planning method based on chaos gravitational search. The invention adopts the chaotic gravitational search to plan the path of a vehicle. In the chaos gravitational search, each individual stores an order weight of each transport point. In the process of evolution, chaos gravitational search first performs a basic operation operator of the gravitation search, then randomly selects one individual and performs a chaotic local search operation on the selected individual to enhance the algorithm search performance. According to the invention, the efficiency of vehicle path planning can be improved.

Description

technical field [0001] The invention relates to the field of vehicle route planning, in particular to a vehicle route planning method based on chaotic gravity search. Background technique [0002] Vehicle routing planning is an important topic in modern transportation industry. In the modern transportation industry, people often encounter the following vehicle route planning problem: given the coordinates of several transportation points, it is required to plan a route for a transportation vehicle, so that the vehicle needs to start from the source transportation point and then pass through each The transport point returns to the source transport point once and only once, and it is required to minimize the cost of the path traveled by the transport vehicle. In order to solve this problem, people often solve it by designing a heuristic intelligent optimization algorithm. [0003] The gravitational search algorithm is a newly emerged intelligent optimization algorithm, which...

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 Applications(China)
IPC IPC(8): G06Q10/04G06N3/00
CPCG06N3/006G06Q10/047
Inventor 郭肇禄王洋鄢化彪周才英刘小生余法红李康顺
Owner JIANGXI UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap