基于蚁群优化算法模型的最优路径规划--以昆明市为例  

Optimal path planning based on ant colony optimization algorithm model--Taking Kunming city as an example

作　　者：魏宇琦 王亚 陈玉秋 吴德星 WEI Yuqi;WANG Ya;CHEN Yuqiu;WU Dexing(College of Arts and Sciences·Kunming,Kunming 650221,China)

机构地区：[1]昆明文理学院,昆明650221

出　　处：《计算机应用文摘》2024年第18期89-91,共3页

基　　金：2023年度校级大学生创新创业训练计划项目:童心携旅(2023XJ5322)。

摘　　要：最优路径规划是在起点和终点之间可能经过的路径集合中找到一条满足某种最优性标准的路径,文章中的最优性标准为最短距离。蚁群算法可以用于解决最优路径规划问题,通过模拟蚂蚁觅食行为中的信息素传递和路径选择机制,能够在大量可能的路径中逐步逼近最优解。文章通过蚁群算法规划了昆明市14个景点之间的最短路径,旨在帮助来昆明旅游的游客节省时间并提高效率。The optimal path planning is to find a path that satisfies a certain optimality criterion from the set of possible paths between the starting and ending points.The optimality criterion in the article is the shortest distance.Ant colony algorithm can be used to solve optimal path planning problems.By simulating the pheromone transmission and path selection mechanism in ant foraging behavior,it can gradually approach the optimal solution among a large number of possible paths.This article uses ant colony algorithm to plan the shortest path between 14 scenic spots in Kunming,aiming to help tourists who come to Kunming save time and improve efficiency.

关 键 词：蚁群算法 昆明市 最短距离 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]