Skip to content

Conversation

kofgokhan
Copy link
Contributor

Link for the algorithm [1]: https://doi.org/10.1016/j.ins.2021.02.074

This is an algorithm to solve multi-objective discrete optimization (MODO) problems with 2 or more objectives.

This algorithms maintains a list of regions in the outcome space similar to Kirlik & Sayın [2]. The difference is that regions are categorized according to their so-called 'directions'. For a MODO problem with p-objectives, the regions of the outcome space are represented as Boxes in p-dimensional space (Kirlik & Sayın maintained Rectangles in p-1 dimensional space).

This is an "anytime algorithm" meaning that during the solution process the decision maker can stop the process anytime and the resulting pareto set will still be a good representation of the original pareto set. For this reason, I believe SolutionLimit can be added as an attribute (and maybe a time limit but I do not know if that is already a part of JuMP. It probably is).

Test cases are the same as Kirlik & Sayın.

[1]Miguel Angel Dominguez-Rios, FranciscoChicano, and Enrique Alba. Effective anytime algorithm for multiobjective combinatorial optimization prob- lems. Information Sciences, 565:210–228, 7 2021.
[2] Gokhan Kirlik and Serpil Sayin. A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. European Journal of Operational Research, 232:479–488, 2 2014.

Copy link
Member

@odow odow left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Let's finish #22 first, and then think about which bits they have in common that we can share code between.

@codecov
Copy link

codecov bot commented Feb 12, 2023

Codecov Report

Base: 94.41% // Head: 95.53% // Increases project coverage by +1.12% 🎉

Coverage data is based on head (504435d) compared to base (256d0e2).
Patch coverage: 100.00% of modified lines in pull request are covered.

Additional details and impacted files
@@            Coverage Diff             @@
##           master      #28      +/-   ##
==========================================
+ Coverage   94.41%   95.53%   +1.12%     
==========================================
  Files           6        7       +1     
  Lines         519      650     +131     
==========================================
+ Hits          490      621     +131     
  Misses         29       29              
Impacted Files Coverage Δ
src/algorithms/DominguezRios.jl 100.00% <100.00%> (ø)

Help us with your feedback. Take ten seconds to tell us how you rate us. Have a feature suggestion? Share it here.

☔ View full report at Codecov.
📢 Do you have feedback about the report comment? Let us know in this issue.

@odow
Copy link
Member

odow commented Feb 13, 2023

Merging. We can fix the 32-bit solves (I think it's a HiGHS issue?) and add SolutionLimit in future PRs.

@odow odow merged commit a728890 into jump-dev:master Feb 13, 2023
@kofgokhan kofgokhan deleted the dr-modo branch February 14, 2023 21:19
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Development

Successfully merging this pull request may close these issues.

2 participants