Package: momst 0.1.1
Jorge A. Parraga-Alava
momst: Multi-Objective Minimum Spanning Tree via NSGA-II with Local Search
Solves the Multi-Criteria Minimum Spanning Tree (mc-MST) problem on complete weighted graphs by combining the Non-dominated Sorting Genetic Algorithm II (NSGA-II) with optional Pareto local search operators. Chromosomes are represented as Prufer sequences so that every random individual decodes to a valid spanning tree (Cayley's theorem), avoiding repair operators. Four solver variants are provided: pure NSGA-II ("base"), Path Relinking ("PR"), Pareto Local Search ("PLS"), and Tabu Search ("TS"). The package supports 2 and 3 objective formulations and provides convenience functions to plot Pareto fronts and best-compromise spanning trees. This package is the reference implementation of the method described in Parraga-Alava, Inostroza-Ponta and Dorn (2017) <doi:10.1109/CEC.2017.7969432>.
Authors:
momst_0.1.1.tar.gz
momst_0.1.1.zip(r-4.7)momst_0.1.1.zip(r-4.6)momst_0.1.1.zip(r-4.5)
momst_0.1.1.tgz(r-4.6-any)momst_0.1.1.tgz(r-4.5-any)
momst_0.1.1.tar.gz(r-4.7-any)momst_0.1.1.tar.gz(r-4.6-any)
momst_0.1.1.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
card.svg |card.png
momst/json (API)
NEWS
| # Install 'momst' in R: |
| install.packages('momst', repos = c('https://jorgeklz.r-universe.dev', 'https://cloud.r-project.org')) |
Bug tracker:https://github.com/jorgeklz/momst/issues
Pkgdown/docs site:https://jorgeklz.github.io
Last updated from:c88b27ba19. Checks:7 NOTE, 2 OK. Indexed: yes.
| Target | Result | Time | Files | Syslog |
|---|---|---|---|---|
| linux-devel-x86_64 | NOTE | 121 | ||
| source / vignettes | OK | 236 | ||
| linux-release-x86_64 | NOTE | 113 | ||
| macos-release-arm64 | NOTE | 112 | ||
| macos-oldrel-arm64 | NOTE | 91 | ||
| windows-devel | NOTE | 77 | ||
| windows-release | NOTE | 63 | ||
| windows-oldrel | NOTE | 73 | ||
| wasm-release | OK | 97 |
Exports:apply_local_searchbuild_weight_lookupcompute_objectivesdecode_prufergenerate_instancegenerate_prufer_populationnon_dominated_crowdingpareto_local_searchpath_relinkingplot_best_treeplot_pareto_frontrandom_mutationrun_momsttabu_searchtournament_selectionuniform_crossover
Dependencies:
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| momst: Multi-Objective Minimum Spanning Tree via NSGA-II with Local Search | momst-package momst |
| Apply the Configured Local-Search Variant | apply_local_search |
| Pre-build Edge-Weight Lookup Matrices | build_weight_lookup |
| Compute Multi-Objective Costs for a Population | compute_objectives |
| Decode a Prufer Sequence to its Spanning Tree (Linear Time) | decode_prufer |
| Generate a Complete-Graph Instance for MO-MST | generate_instance |
| Generate an Initial Prufer-Encoded Population | generate_prufer_population |
| Assign Pareto Rank and Crowding Distance | non_dominated_crowding |
| Pareto Local Search | pareto_local_search |
| Path Relinking on the Current Pareto Front | path_relinking |
| Plot the Best-Compromise Spanning Tree | plot_best_tree |
| Plot a Pareto Front (2-objective case) | plot_pareto_front |
| Random Mutation on Prufer Sequences | random_mutation |
| Run the MO-MST NSGA-II Solver | run_momst |
| Tabu Search on the Current Pareto Front | tabu_search |
| Tournament Selection | tournament_selection |
| Uniform Crossover for Prufer Sequences | uniform_crossover |
