Enhancing the behavior of the ant algorithms to solving network planning problem

This paper introduces an enhancements to Ant Colony system, which is considered one of the most successful ant algorithms used to solve combinatorial optimization problems. Network planning is the problem of how to plan the infrastructure network in the new city. This paper deals with optimization a...

Full description

Saved in:
Bibliographic Details
Main Authors: Ibrahim, L.F., Metwaly, O., Kapel, K., Ahmed, A.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Ant colony optimization
Artificial intelligence
Cities and towns
Computer networks
Costs
Design optimization
Distributed control
Particle swarm optimization
Process planning
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper introduces an enhancements to Ant Colony system, which is considered one of the most successful ant algorithms used to solve combinatorial optimization problems. Network planning is the problem of how to plan the infrastructure network in the new city. This paper deals with optimization algorithms for network design problem. The objective is to design a distribution network at a minimum cost that satisfies the demand and constraints required by the subscribers. This approach uses the idea of an ant group to represent a solution and can assist the solution of large networks that cannot normally be solved to optimality. The algorithmic implementation of the proposed algorithm is described and computational experience is reported. Results demonstrate the effectiveness and flexibility of the modifying algorithm. Comparisons with related work are presented showing the advantages of the purposed algorithm introduced in this paper.
DOI:10.1109/SERA.2005.39