I am super happy to share the package RingStarProblems.jl.
This package aims to provide a solver to the Ring Star Problem and its variants.
You can checkout the Labbé et al. (2004) Networks - Article that formulates the first MILP for the Ring Star Problem or the RSP Wikipedia page if you would like to discover more about this NP-Hard problem, which is known to be a generalization of TSP
RingStarProblems.jl is still under development, feel free to provide any feedback
Refactoring of several datatypes and variable names to be more compliant with Julia style guide
Improving README.md, adding tags and deleted unwanted branches “master”
Applying JuliaFormatter.jl
Deleting some useless files
Compatibily issues fixed
Create target ] test for UnitTest and solutionchecker
Plan for upcomming v0.1.3
Documenter.jl deploy an extensive documentation for the solver
As mentioned in issue #11 the solver is now optimizer agnostic!
Currently supports GLPK and Gurobi
Bug fixes
RingStarProblems.jl is not “an empty” package anymore, see here.
some GitHub workflows successfully added (CI.yml, and TagBot.yml)
I was able to precompile and using the package on another computer today, plus lauching the README Usage for the first time with this patch release, let me know if this is also the case for you
julia> using GraphPlot, Compose, Colors
julia> pars.plotting = true
### then call `rspoptimize`
Number of threads and time limit parameters now handled by user instead of RSPSolver.
Several enhancement, minor bug fixes and code readability improved
Code Coverage increased to 25.98%
I am super happy that the user can now solve the Ring Star Problem with nodes coordinates, same for 1-R-RSP, and also plot the solutions to .pdf!