A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem.
V. Prem PrakashC. PatvardhanAnand SrivastavPublished in: Eng. Appl. Artif. Intell. (2020)
Keyphrases
- spanning tree
- bi objective
- minimum cost
- multi objective evolutionary algorithms
- multi objective
- edge disjoint
- multi objective optimization
- efficient solutions
- minimum total cost
- np hard
- nsga ii
- minimum spanning tree
- network design
- ant colony optimization
- multiple objectives
- approximation algorithms
- knapsack problem
- pareto optimal solutions
- shortest path problem
- total cost
- test problems
- genetic algorithm
- differential evolution
- particle swarm optimization
- objective function
- weighted graph
- swarm intelligence
- optimization algorithm
- dynamic programming
- evolutionary algorithm
- multi objective problems
- bayesian networks