.png){kind=icon}
返回
Solving the multi-objective Hamiltonian cycle problem using a Branch-and-Fix based algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jocs.2022.101578.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Hamiltonian cycle problem consists of finding a cycle in a given graph that passes through every single vertex exactly once, or determining that this cannot be achieved. In this investigation, a graph is considered with an associated set of matrices. The entries of each of the matrix correspond to a different weight of an arc. A multi-objective Hamiltonian cycle problem is addressed here by computing a Pareto set of solutions that minimize the sum of the weights of the arcs for each objective. Our heuristic approach extends the Branch-and-Fix algorithm, an exact method that embeds the problem in a stochastic process. To measure the efficiency of the proposed algorithm, we compare it with a multi-objective genetic algorithm in graphs of a different number of vertices and density. The results show that the density of the graphs is critical when solving the problem. The multi-objective genetic algorithm performs better (quality of the Pareto sets) than the proposed approach in random graphs with high density; however, in these graphs it is easier to find Hamiltonian cycles, and they are closer to the multi-objective traveling salesman problem. The results reveal that, in a challenging benchmark of Hamiltonian graphs with low density, the proposed approach significantly outperforms the multi-objective genetic algorithm.
Keyword:
Graph theory
Multi-objective optimization
Discrete optimization problems
Hamiltonian cycle problem
Branching algorithm
期刊
IF:
18.3
论文数:
3.1K
被引数:
4.0K
机构
引用论文
Inositol 1,4,5-trisphosphate receptor in developing and senescent rat cerebellum肌醇1,4,5-三磷酸受体在发育期和衰老期大鼠小脑中的表达
PREAI
分享收藏Effect of Normal and Rubberized Concrete Properties on the Behavior of RC Columns Strengthened with EB CFRP Laminates and Welded Wire Mesh under Static Axial Loading.png)
Polymers
OAAI
PolymersIF0
OAAI分享收藏
查看更多内容