基于蚁群算法的停车场车位引导问题研究  

Research on Parking Guidance Based on Improved Ant Colony Algorithm

作　　者：黄小珂[1] 

机构地区：[1]中国船舶重工集团公司第七一三研究所,河南郑州450001

出　　处：《软件导刊》2012年第1期64-66,共3页Software Guide

摘　　要：根据停车场实际情况建立了停车场结构模型,引入了节点繁忙因子的概念,提出了带约束的最优路径数学模型,将车位引导问题转化为对网络中最优路径的求解,并对基本蚁群算法的启发函数、信息素更新规则进行改进,将改进后的算法用于停车场车位引导问题中最优路径的求解。最后通过仿真实验找出了最优车位及存取车路线,为进出停车场的车辆提供引导,提高了停车场的使用效率。In order to solve the problem of parking guidance in modern large scale parking lot more efficiently,a parking lot structure model is built in this paper;the concept of node busy factor is introduced,a constrained mathematical model of the optimal path is mentioned,and the problem of parking guidance to be translated into solving for the optimal path based on the actual situation.Moreover,improved the heuristic function and pheromone update rule of ant colony algorithm,which is used to get the optimal path of the parking guidance.Finally,the best parking space and the guiding paths out of parking lot are given out by the simulation.This solution provides guidance for the parking,and the efficiency of the parking lot usage is improved.

关 键 词：停车场 车位引导 最优路径 蚁群算法 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]