A multiethnic genetic approach for the minimum conflict weighted spanning tree problem

Carrabs, Francesco; Cerrone, Carmine; Pentangelo, Rosa

doi:10.1002/net.21883

Cited by 15 publications

(13 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…ConflictRemoval was introduced in [2] and used without modification in HDA + . The procedure works as follow.…”

Section: The Algorithmmentioning

confidence: 99%

“…In the computational tests, we will consider only the type 1 instances where the presence of a feasible solution is guaranteed. The instances 10 and 11 are classified in literature as type 1 (unknown feasibility), even though the presence of a feasible solution for these instances was proved in [2]. We verify the effectiveness and the performance of HDA by comparing it with the two Lagrangian approaches, LB‐MST and LB‐MI , proposed for the MSTC in [26].…”

Section: Computational Testsmentioning

confidence: 99%

“…The MSTC problem has a number of practical applications. For instance, it arises in the design of offshore wind farm networks [2]. In this context, it is often required to build spanning trees to connect a set of turbines.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs

Carrabs

Gaudioso

2020

Networks

Self Cite

View full text Add to dashboard Cite

This article addresses the minimum spanning tree problem with conflicting edge pairs, a variant of the classical minimum spanning tree where, given a list of conflicting edges, the goal is to find the cheapest spanning tree with no edges in conflict. We adopt a Lagrangian relaxation approach together with a dual ascent and a subgradient procedure to find tight lower bounds on the optimal solution. The algorithm is also equipped with a heuristic approach which provides an upper bound by removing the conflicts from possible infeasible solutions met during the calculation of the lower bounds. The computational results, carried out on benchmark instances, show that the proposed algorithm finds the optimal solutions on several instances. Moreover, the lower bounds it provides are much more accurate than ones provided by other Lagrangian approaches available in the literature and they are computed in much less time.

show abstract

“…ConflictRemoval was introduced in [2] and used without modification in HDA + . The procedure works as follow.…”

Section: The Algorithmmentioning

confidence: 99%

Section: Computational Testsmentioning

confidence: 99%

See 1 more Smart Citation

A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs

Carrabs

Gaudioso

2020

Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…The paper “A multiethnic genetic approach for the minimum conflict weighted spanning tree problem” by Carrabs et al addresses a variant of the minimum spanning tree problem in which, given a list of conflicting edges, the primary goal is to find a spanning tree with the minimum number of conflicting edge pairs and the secondary goal is to minimize the weight of spanning trees without conflicts. The problem is NP‐hard and it finds applications in the design of off‐shore wind farm networks.…”

mentioning

confidence: 99%

Preface: Special issue on network optimization in transportation, logistics, and industry

2019

View full text Add to dashboard Cite

This special issue is addressed to scientists and experts from academia and industry interested in network optimization problems. Its aim is presenting ideas and experiences and sharing knowledge among researchers and practitioners working in this field with different perspectives and skills. It presents high quality research papers on methodological and theoretical advances aimed to solve complex decision problems emerging in different application fields.We encouraged the submission of papers from the entire operations research, computer science and quantitative methods communities. After several rounds of peer review, a dozen or so papers were selected for publication. The accepted papers cover a wide range of optimization methodologies and application contexts. This issue will contain seven of these papers. A second special issue will include the remaining articles. A brief overview of the papers in this issue is reported in the following, discussing them in alphabetical order with respect to the first author. This summary shows that all the papers highlight the impact that optimization methods and tools could have in a society with complex and challenging problems.In the paper "Evaluation of flow dependent external costs in freight logistics networks," Ambrosino et al.[1] approach a distribution problem arising in a freight logistics context, which involves the containerized flow originating from maritime terminals and going to inland destinations using the road transportation network. The goal is the minimization of the total shipping costs, given by the travelled distance, vehicles and external cost components. The authors consider a global cost depending on the amount of flow through the selected arcs in the route and their capacity, for which a novel stepwise function is proposed and analyzed. A real case instance related to the logistics network connecting the main ports of the Liguria County (Italy) to the main inland destinations is proposed and analyzed."An optimization approach for congestion control in network routing with quality of service requirements" is the paper written by Avella et al. [2]. They study a network design problem arising in the management of a carrier network. The aim is to route a traffic matrix, minimizing a measure of the network congestion while guaranteeing a prescribed quality of service. They formulate the problem, devise presolve procedures to reduce the size of the corresponding mixed-integer programming formulation and show that the proposed approach can efficiently solve some real-life problems, leading to an improvement with respect to the current practice in a real case study.The paper "A multiethnic genetic approach for the minimum conflict weighted spanning tree problem" by Carrabs et al.[3] addresses a variant of the minimum spanning tree problem in which, given a list of conflicting edges, the primary goal is to find a spanning tree with the minimum number of conflicting edge pairs and the secondary goal is to minimize the weight of spanning trees without conflic...

show abstract

“…Pode-se observar que o GRASP apresenta uma convergência mais rápida aos alvos que o ILS.3.2. GRASP × MEGACarrabs et al (2017) desenvolveram um algoritmo genético denominado MEGA. Como o código-fonte não foi disponibilizado, não foi possível executar os testes sob as mesmas condições.…”

unclassified

A GRASP Approach for The Minimum Spanning Tree Under Conflict Constraints

Barros

Pinheiro

Ochi

et al. 2019

Anais Do Encontro Nacional De Inteligência Artificial E Computacional (ENIAC 2019)

View full text Add to dashboard Cite

Dados um grafo não direcionado com pesos nas arestas e um conjunto de pares de arestas conflitantes, a Árvore de Geradora Mı́nima com Restrições de Conflito (AGMRC) consiste em encontrar árvore geradora com no máximo uma aresta de cada par conflitante e custo mı́nimo. O problema é N P-difı́cil e foi introduzido recentemente na literatura. Este artigo propõe uma nova abordagem para a solução do AGMRC, o método é baseado na meta-heurı́stica GRASP com uso de uma memória adaptativa. A heurı́stica proposta foi avaliada nas instâncias da literatura com milhares de conflitos. Os resultados indicam que o algoritmo proposto foi capaz de encontrar todas as soluções ótimas conhecidas e superar as heurı́sticas da literatura para o AGMRC.

show abstract

A multiethnic genetic approach for the minimum conflict weighted spanning tree problem

Cited by 15 publications

References 17 publications

A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs

A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs

Preface: Special issue on network optimization in transportation, logistics, and industry

A GRASP Approach for The Minimum Spanning Tree Under Conflict Constraints

Contact Info

Product

Resources

About