Suboptimal cycle bases of graphs using ant colony system algorithm

Suboptimal cycle bases of graphs using ant colony system algorithm Purpose – Cycle bases of graphs have many applications in science and engineering. For an efficient force method of structural analysis, a special cycle basis corresponding to sparse cycle adjacency matrix is required. The purpose of this paper is to develop an ant colony system (ACS) algorithm for the generation of a cycle basis, leading to suboptimal cycle bases. Design/methodology/approach – In this paper, an ACS algorithm is developed for the generation of a cycle basis, leading to suboptimal cycle basis corresponding to highly sparse flexibility matrices. Examples are included to illustrate the efficiency of the developed algorithm. Findings – A new approach is developed which uses the recently developed ACS algorithm for the optimization. Originality/value – Previously, graph theoretical method had been used for the formation of suboptimal cycle bases. Here, optimization is performed using ACS algorithm for the first time. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Engineering Computations Emerald Publishing

Suboptimal cycle bases of graphs using ant colony system algorithm

Engineering Computations, Volume 27 (4): 10 – Jun 1, 2010

Loading next page...
 
/lp/emerald-publishing/suboptimal-cycle-bases-of-graphs-using-ant-colony-system-algorithm-jltSDI0gXl
Publisher
Emerald Publishing
Copyright
Copyright © 2010 Emerald Group Publishing Limited. All rights reserved.
ISSN
0264-4401
DOI
10.1108/02644401011044586
Publisher site
See Article on Publisher Site

Abstract

Purpose – Cycle bases of graphs have many applications in science and engineering. For an efficient force method of structural analysis, a special cycle basis corresponding to sparse cycle adjacency matrix is required. The purpose of this paper is to develop an ant colony system (ACS) algorithm for the generation of a cycle basis, leading to suboptimal cycle bases. Design/methodology/approach – In this paper, an ACS algorithm is developed for the generation of a cycle basis, leading to suboptimal cycle basis corresponding to highly sparse flexibility matrices. Examples are included to illustrate the efficiency of the developed algorithm. Findings – A new approach is developed which uses the recently developed ACS algorithm for the optimization. Originality/value – Previously, graph theoretical method had been used for the formation of suboptimal cycle bases. Here, optimization is performed using ACS algorithm for the first time.

Journal

Engineering ComputationsEmerald Publishing

Published: Jun 1, 2010

Keywords: Probabilistic analysis; Programming and algorithm theory; Graph theory; Structural analysis; design and theory

References

  • Optimal plastic analysis and design of frames; graph‐theoretical methods
    Mokhtar‐zadeh, A.; Kaveh, A.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off