loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Ali D. Mehrabi 1 ; Saeed Mehrabi 2 and Abbas Mehrabi 3

Affiliations: 1 Yazd University, Iran, Islamic Republic of ; 2 Shahid Bahonar University of Kerman, Iran, Islamic Republic of ; 3 Islamic Azad University, South Tehran Branch, Iran, Islamic Republic of

ISBN: 978-989-674-014-6

Keyword(s): Minimum vertex cover problem, Meta-heuristic approaches, Ant colony optimization algorithms.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolution Strategies ; Evolutionary Computing ; Evolutionary Multiobjective Optimization ; Soft Computing

Abstract: Given an undirected, unweighted graph G = (V , E) the minimum vertex cover (MVC) problem is a subset of V whose cardinality is minimum subject to the premise that the selected vertices cover all edges in the graph. In this paper, we propose a meta-heuristic based on Ant Colony Optimization (ACO) approach to find approximate solutions to the minimum vertex cover problem. By introducing a visible set based on pruning paradigm for ants, in each step of their traversal, they are not forced to consider all of the remaining vertices to select the next one for continuing the traversal, resulting very high improvement in both time and convergence rate of the algorithm. We compare our algorithm with two existing algorithms which are based on Genetic Algorithms (GAs) as well as its testing on a variety of benchmarks. Computational experiments evince that the ACO algorithm demonstrates much effectiveness and consistency for solving the minimum vertex cover problem.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.227.254.12

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
D. Mehrabi A.; Mehrabi S.; Mehrabi A. and (2009). A PRUNING BASED ANT COLONY ALGORITHM FOR MINIMUM VERTEX COVER PROBLEM.In Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009) ISBN 978-989-674-014-6, pages 281-286. DOI: 10.5220/0002313802810286

@conference{icec09,
author={Ali {D. Mehrabi} and Saeed Mehrabi and Abbas Mehrabi},
title={A PRUNING BASED ANT COLONY ALGORITHM FOR MINIMUM VERTEX COVER PROBLEM},
booktitle={Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)},
year={2009},
pages={281-286},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002313802810286},
isbn={978-989-674-014-6},
}

TY - CONF

JO - Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)
TI - A PRUNING BASED ANT COLONY ALGORITHM FOR MINIMUM VERTEX COVER PROBLEM
SN - 978-989-674-014-6
AU - D. Mehrabi, A.
AU - Mehrabi, S.
AU - Mehrabi, A.
PY - 2009
SP - 281
EP - 286
DO - 10.5220/0002313802810286

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.