### 摘要

Given an undirected graph and a weighting function defined on the vertex set, the minimum weight vertex cover problem is to find a vertex subset whose total weight is minimum subject to the premise that the selected vertices cover all edges in the graph. In this paper, we introduce a meta-heuristic based upon the Ant Colony Optimization (ACO) approach, to find approximate solutions to the minimum weight vertex cover problem. In the literature, the ACO approach has been successfully applied to several well-known combinatorial optimization problems whose solutions might be in the form of paths on the associated graphs. A solution to the minimum weight vertex cover problem however needs not to constitute a path. The ACO algorithm proposed in this paper incorporates several new features so as to select vertices out of the vertex set whereas the total weight can be minimized as much as possible. Computational experiments are designed and conducted to study the performance of our proposed approach. Numerical results evince that the ACO algorithm demonstrates significant effectiveness and robustness in solving the minimum weight vertex cover problem.

原文 | English |
---|---|

頁（從 - 到） | 283-304 |

頁數 | 22 |

期刊 | Annals of Operations Research |

卷 | 131 |

發行號 | 1-4 |

DOIs | |

出版狀態 | Published - 1 十月 2004 |

## 指紋 深入研究「An ant colony optimization algorithm for the minimum weight vertex cover problem」主題。共同形成了獨特的指紋。

## 引用此

*Annals of Operations Research*,

*131*(1-4), 283-304. https://doi.org/10.1023/B:ANOR.0000039523.95673.33