English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Dominance move (DoM) is a binary quality indicator to compare solution setsin multiobjective optimization. The indicator allows a more natural andintuitive relation when comparing solution sets. It is Pareto compliant anddoes not demand any parameters or reference sets. In spite of its advantages,the combinatorial calculation nature is a limitation. The original formulationpresents an efficient method to calculate it in a biobjective case only. Thiswork presents an assignment formulation to calculate DoM in problems with threeobjectives or more. Some initial experiments, in the biobjective space, weredone to present the model correctness. Next, other experiments, using threedimensions, were also done to show how DoM could be compared with otherindicators: inverted generational distance (IGD) and hypervolume (HV). Resultsshow the assignment formulation for DoM is valid for more than threeobjectives. However, there are some strengths and weaknesses, which arediscussed and detailed. Some notes, considerations, and future research pathsconclude this work.

An Assignment Problem Formulation for Dominance Move Indicator