A hybrid metaheuristic for the minimum labeling spanning tree problem

Silva, Thiago Gouveia da; Queiroga, Eduardo; Ochi, Luiz Satoru; Cabral, Lucídio dos Anjos Formiga; Gueye, Serigne; Michelon, Philippe

doi:10.1016/j.ejor.2018.09.044

Cited by 15 publications

(8 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Da et al proposed an improved maximum vertex cover algorithm to meet the strict time complexity constraint of mixed integer linear program, and multi-start local branch handles it by combining the proposed algorithm with local search (Da Silva et al. 2019 ).…”

Section: Binary Metaheuristic Algorithms In Applicationsmentioning

confidence: 99%

“…( 2020 ) Binary FA MLST Medium Medium High Zhang and Zhang ( 2017 ) Binary ABC Vehicular AD Hoc Networks High Medium High Da Silva et al. ( 2019 ) MSLB MLST Fast High Low Priya and Umamaheswari ( 2019 ) Multi-Objective PSO Text Summarization Low Low High Jaszkiewicz ( 2003 ) GA & SPEA & MA Set Covering Low Medium Medium Mojrian and Mirroshandel ( 2021 ) QIGA Text Summarization Medium Medium High Debnath et al. ( 2021 ) Multi-Objective CSO Text Summarization Medium Medium High Alguliev et al.…”

Section: Binary Metaheuristic Algorithms In Applicationsmentioning

confidence: 99%

See 1 more Smart Citation

A survey on binary metaheuristic algorithms and their engineering applications

Pan

Snåšel

et al. 2022

Artif Intell Rev

View full text Add to dashboard Cite

This article presents a comprehensively state-of-the-art investigation of the engineering applications utilized by binary metaheuristic algorithms. Surveyed work is categorized based on application scenarios and solution encoding, and describes these algorithms in detail to help researchers choose appropriate methods to solve related applications. It is seen that transfer function is the main binary coding of metaheuristic algorithms, which usually adopts Sigmoid function. Among the contributions presented, there were different implementations and applications of metaheuristic algorithms, or the study of engineering applications by different objective functions such as the single- and multi-objective problems of feature selection, scheduling, layout and engineering structure optimization. The article identifies current troubles and challenges by the conducted review, and discusses that novel binary algorithm, transfer function, benchmark function, time-consuming problem and application integration are need to be resolved in future.

show abstract

Section: Binary Metaheuristic Algorithms In Applicationsmentioning

confidence: 99%

Section: Binary Metaheuristic Algorithms In Applicationsmentioning

confidence: 99%

A survey on binary metaheuristic algorithms and their engineering applications

Pan

Snåšel

et al. 2022

Artif Intell Rev

View full text Add to dashboard Cite

show abstract

“…Several families of valid inequalities are identified and their facial aspect is investigated. In [18], the authors introduce a new MIP-based metaheuristic for the MLSTP called the multi-start local branching (MSLB). Computational experiments show that the MSLB outperforms the state-of-the-art metaheuristics with respect to optimality and processing times.…”

Section: Classical Labeled Problems In Graphsmentioning

confidence: 99%

The edge-labeled survivable network design problem: Formulations and branch-and-cut

2022

View full text Add to dashboard Cite

Abstract. In this paper, we study a variant of the survivable network design problem, that is the survivable network design problem with labels (colors) on the edges. In particular, we address the Generalized Labeled Two Edge Connected Subgraph Problem (GLTECSP) that has many applications in telecommunication and transportation. Given a connected undirected graph G such that with each edge is associated a set of labels (colors), the GLTECSP consists in finding a two-edge connected spanning subgraph of G with a minimum number of distinct labels. We propose two Integer Programming (IP) formulations for the problem, a natural formulation using cuts on the edges, and a compact formulation using color-cuts. We devise Branch-and-Cut algorithms to solve both formulations and compare them on sets of randomly generated instances. Computational results show that the compact formulation outperforms the natural one regarding the linear relaxation and the computational time. Moreover, the compact formulation is able to solve to optimality several instances left unsolved within the time limit by the natural formulation.

show abstract

“…The Ant Colony Optimization method [8], the integer programming [9,16], and the mixed integer linear formulation approach of Captivo et al [4]. In addition, a range of powerful metaheuristic algorithms that are mostly based on sophisticated local search procedures, were introduced by Consoli et al [11][12][13][14], and Silva et al [27]. Among these methods, a very interesting idea of using the so-called complementary space and the corresponding variable neighborhood search is due to Consoli et al [13].…”

Section: Figurementioning

confidence: 99%

Finding minimum label spanning trees using cross‐entropy method

Vaisman

2021

Networks

View full text Add to dashboard Cite

Obtaining high-quality solutions to the minimum label spanning tree problem is of crucial importance to efficient communication network design, since such solutions can reduce both the construction cost and the complexity of the ultimate architecture. However, the corresponding optimization task was shown to be hard even for complete graphs. As a consequence, no computationally efficient method for solving this problem exactly in a reasonable time is known to exist and one has to rely on approximation techniques such as heuristic and evolutionary algorithms. In this study, we investigate the performance of a different method called the Cross-Entropy algorithm which relies on rigorous developments in the fields of information theory and stochastic simulation. Our findings indicate that the mathematical soundness of the Cross-Entropy method makes it very reliable and robust as compared to its counterparts. In particular, the obtained results suggest that the Cross-Entropy method is not sensitive to different graph models and that the proposed algorithm can obtain optimal or near-optimal solutions while using a reasonable computational effort.

show abstract

A hybrid metaheuristic for the minimum labeling spanning tree problem

Cited by 15 publications

References 19 publications

A survey on binary metaheuristic algorithms and their engineering applications

A survey on binary metaheuristic algorithms and their engineering applications

The edge-labeled survivable network design problem: Formulations and branch-and-cut

Finding minimum label spanning trees using cross‐entropy method

Contact Info

Product

Resources

About