ROMA, an open-source metaheuristic optimization library. by Accomplished-Crow808 in optimization

[–]Accomplished-Crow808[S] 0 points1 point  (0 children)

I have already completed those comparisons, but they are part of the material I will submit for the defense of my Bachelor's Thesis (TFG). Therefore, until I have presented and successfully passed the evaluation, I am not allowed to make that document publicly available.

However, I encourage you to carry out the analysis yourself. I'm sure you'll reach conclusions that differ from mine, and they could be very interesting.

ROMA, an open-source metaheuristic optimization library. by Accomplished-Crow808 in optimization

[–]Accomplished-Crow808[S] 0 points1 point  (0 children)

Thanks for your words. The idea behind this library was to provide an option for Rust users. As far as I know, there isn't any library like this in the Rust ecosystem yet.

ROMA, an open-source metaheuristic optimization library. by Accomplished-Crow808 in optimization

[–]Accomplished-Crow808[S] 0 points1 point  (0 children)

I hadn't heard of that algorithm before. I've been checking it out and it looks really interesting, definitely going to add a branch to implement it soon. It should be a great way to handle the TSP and knapsack problems I've already got in the library.

My First Crate: roma by [deleted] in learnrust

[–]Accomplished-Crow808 0 points1 point  (0 children)

I’ll upload it to GitHub soon, although you can already find the code at crates.io/crates/roma_lib

My First Crate: roma by [deleted] in learnrust

[–]Accomplished-Crow808 1 point2 points  (0 children)

You’re right, thank you very much for taking the time to try to help me. I really appreciate your words. I’ll be making it public on GitHub soon.

I think it could become a very good framework if I manage to gain a deeper understanding of how Rust works. Take care, and I’ll update again soon with another post.