Algoritmos experimentais para o problema biobjetivo da árvore geradora quadrática em adjacência de arestas
The Quadratic Minimum Spanning Tree (QMST) problem is a generalization of the Minimum Spanning Tree problem in which, beyond linear costs associated to each edge, quadratic costs associated to each pair of edges must be considered. The quadratic costs are due to interaction costs between the edge...
Gorde:
Egile nagusia: | |
---|---|
Beste egile batzuk: | |
Formatua: | Dissertação |
Hizkuntza: | por |
Argitaratua: |
Universidade Federal do Rio Grande do Norte
|
Gaiak: | |
Sarrera elektronikoa: | https://repositorio.ufrn.br/jspui/handle/123456789/21031 |
Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|
Gaia: | The Quadratic Minimum Spanning Tree (QMST) problem is a generalization of the Minimum
Spanning Tree problem in which, beyond linear costs associated to each edge,
quadratic costs associated to each pair of edges must be considered. The quadratic costs
are due to interaction costs between the edges. When interactions occur between adjacent
edges only, the problem is named Adjacent Only Quadratic Minimum Spanning
Tree (AQMST). Both QMST and AQMST are NP-hard and model a number of real
world applications involving infrastructure networks design. Linear and quadratic costs
are summed in the mono-objective versions of the problems. However, real world applications
often deal with conflicting objectives. In those cases, considering linear and quadratic
costs separately is more appropriate and multi-objective optimization provides a more
realistic modelling. Exact and heuristic algorithms are investigated in this work for the
Bi-objective Adjacent Only Quadratic Spanning Tree Problem. The following techniques
are proposed: backtracking, branch-and-bound, Pareto Local Search, Greedy Randomized
Adaptive Search Procedure, Simulated Annealing, NSGA-II, Transgenetic Algorithm,
Particle Swarm Optimization and a hybridization of the Transgenetic Algorithm with
the MOEA-D technique. Pareto compliant quality indicators are used to compare the
algorithms on a set of benchmark instances proposed in literature. |
---|