2013•Shuxue de shijian yu renshiRequires access

Research and Application for Optimal Routing Problem Based on Improved Ant Colony Algorithm

Yanping Bai

Abstract

Ant colony system(ACS),a kind of ant colony algorithm,is a effective way in solving shortest path problem,however,it has some defects.In this paper,ACS is improved for avoiding getting stuck in a local minimum,which mainly reflects in the following two aspects:initial pheromone solution and pheromone updating.In order to further learn the advantages of improved ant colony system(IACS),we run experiments for some times:we will improve the simulation of IACS which is applied to medical care in GIS,using GIS network analysis of urban road network in the shortest path selection algorithm to explore an in-depth research to the road network in Taiyuan,Shanxi as an example.Computer simulation results show that IACS has much better performance in solving shortest path problem than ACS,and it has certain theoretical reference value and practical significance.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Ant colony optimization algorithms, Shortest path problem, Computer science, Ant colony, Path (computing), Selection (genetic algorithm), Mathematical optimization, Routing (electronic design automation)