All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A Location Gradient Induced Sorting Approach for Multi-objective Optimization

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F22%3A10252011" target="_blank" >RIV/61989100:27240/22:10252011 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007/978-981-16-8048-9_15" target="_blank" >https://link.springer.com/chapter/10.1007/978-981-16-8048-9_15</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-981-16-8048-9_15" target="_blank" >10.1007/978-981-16-8048-9_15</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Location Gradient Induced Sorting Approach for Multi-objective Optimization

  • Original language description

    In the field of population-based multi-objective optimization, a non-dominated sorting approach amounts to sort a set of candidate solutions with multiple objective function values, based on their dominance relations, and to find out solutions distributed into the first front set, second front set, and so on. A fast non-dominated sorting approach used within the framework of Non-dominated Sorting Genetic Algorithm (NSGA-II) reaches a O(MN2) time complexity (N is the population size, M is the number of the objectives). In this paper, we show an approach based on the Location Gradient (LG) number (LG sorting). Our LG sorting method is especially efficient in dealing with duplicate solutions, which only costs O(N) in front assignment process when all the solutions are duplicate. Except that, in many cases, the LG sorting method can reach O(N log N) time complexity. But in the worst case, it still costs O(MN2). We demonstrate the efficacy of the LG-based sorting method comparison against several existing non-dominated sorting procedures.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    ADVANCES IN INTELLIGENT SYSTEMS AND COMPUTING (ECC 2021)

  • ISBN

    978-981-16-8048-9

  • ISSN

    2190-3018

  • e-ISSN

    2190-3026

  • Number of pages

    10

  • Pages from-to

    157-166

  • Publisher name

    SPRINGER INTERNATIONAL PUBLISHING AG

  • Place of publication

    CHAM

  • Event location

    Commun Univ Zhejiang

  • Event date

    May 29, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000773051200015