The multi-criteria minimum spanning tree problem based genetic algorithm
From MaRDI portal
Publication:2456475
DOI10.1016/j.ins.2007.06.005zbMath1121.90127OpenAlexW2019347980WikidataQ126235709 ScholiaQ126235709MaRDI QIDQ2456475
Huowang Chen, Guo-Long Chen, Wen-Zhong Guo, Shui-Li Chen
Publication date: 18 October 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.06.005
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (13)
A multi-agent transgenetic algorithm for the bi-objective spanning tree problem ⋮ Chromosome refinement for optimising multiple supply chains ⋮ On the bicriterion - minimal cost/minimal label - spanning tree problem ⋮ Multi-objective matroid optimization with ordinal weights ⋮ General variable neighborhood search for the minimum stretch spanning tree problem ⋮ An analysis on recombination in multi-objective evolutionary optimization ⋮ Path planning on a cuboid using genetic algorithms ⋮ A fast minimum spanning tree algorithm based on \(K\)-means ⋮ Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs ⋮ Evolutionary design of oriented-tree networks using Cayley-type encodings ⋮ Genetic algorithms for outlier detection in multiple regression with different information criteria ⋮ Empirical study of exact algorithms for the multi-objective spanning tree ⋮ Combinatorial optimization in system configuration design
Cites Work
This page was built for publication: The multi-criteria minimum spanning tree problem based genetic algorithm
