Application of Ant System to network design problem

Network design problem (NDP) is the problem of choosing from among a set of alternative projects which optimizes an objective (e.g., minimizes total travel time), while keeping consumption of resources (e.g., budget) within their limits. This problem is difficult to solve, because of its combinatori...

Full description

Saved in:
Bibliographic Details
Published in:Transportation (Dordrecht) 2005-05, Vol.32 (3), p.251-273
Main Authors: POORZAHEDY, Hossain, ABULGHASEMI, Farhad
Format: Article
Language:English
Subjects:
Algorithms
Ant System
Applied sciences
Buildings. Public works
Design
Exact sciences and technology
Heuristic
Mathematical models
network design
Networks
Objective function
Project management. Process of design
Resource consumption
Road construction. Pavements. Maintenance
Statistical analysis
Studies
Systems design
Trade-off
Transport
Transportation infrastructure
Transportation planning
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Network design problem (NDP) is the problem of choosing from among a set of alternative projects which optimizes an objective (e.g., minimizes total travel time), while keeping consumption of resources (e.g., budget) within their limits. This problem is difficult to solve, because of its combinatorial nature and nonconvexity of the objective function. Many algorithms are presented to solve the problem more efficiently, while trading-off accuracy with computational speed. This increase in speed stems from certain approximations in the formulation of the problem, decomposition, or heuristics. This study adapts a meta-heuristic approach to solve NDP, namely Ant System (AS). The algorithm is first designed, and then calibrated to solve NDP for the Sioux Falls test network. The behavior of the algorithm is then investigated. The result seems encouraging. [PUBLICATION ABSTRACT]
ISSN:0049-4488
1572-9435
DOI:10.1007/s11116-004-8246-7