According to the layout characteristics of parking in the parking lot, the problem of converting the path choice of parking is raised to seek the optimal path and generate the optimal parking guiding line. This paper proposed the concept of node busy factor, and a mathematical model of the optimal path with constraints. The state transition rules of basic ant colony algorithm is improved as well as updating rules of pheromone. After that, the taboo strategy is introduced for further optimization. At last, the experimental results and Matlab simulation verify the effectiveness of the Algorithm.
Research on Optimization Problem of Routing about Parking Guidance Based on Improved Ant Colony Algorithm
2019-10-01
431634 byte
Conference paper
Electronic Resource
English
An improved ant colony optimization based algorithm for the capacitated arc routing problem
Online Contents | 2010
An Improved Ant Colony Optimization Based Parking Algorithm with Graph Coloring
Springer Verlag | 2022
|