Suchergebnisse - "Discrete combinatorial optimization problem"

  • Treffer 1 - 10 von 10
Treffer weiter einschränken
  1. 1

    A discrete wild horse optimizer for capacitated vehicle routing problem von Fang, Chuncheng, Cai, Yanguang, Wu, Yanlin

    ISSN: 2045-2322, 2045-2322
    Veröffentlicht: London Nature Publishing Group UK 11.09.2024
    Veröffentlicht in Scientific reports (11.09.2024)
    “… The wild horse optimizer (WHO) is a novel metaheuristic algorithm, which has been successfully applied to solving continuous engineering problems. Considering …”
    Volltext
    Journal Article
  2. 2
  3. 3

    Multi-objective Discrete Combinatorial Optimization Algorithm Combining Problem-Decomposition and Adaptive Large Neighborhood Search von WEI Qian, JI Bin

    ISSN: 1673-9418
    Veröffentlicht: Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press 01.07.2024
    Veröffentlicht in Jisuanji kexue yu tansuo (01.07.2024)
    “… In order to efficiently obtain solutions for large-scale multi-objective optimization problems in reality, to achieve a balance among convergence, diversity, …”
    Volltext
    Journal Article
  4. 4

    A dynamic space reduction ant colony optimization for capacitated vehicle routing problem von Cai, Jinsi, Wang, Peng, Sun, Siqing, Dong, Huachao

    ISSN: 1432-7643, 1433-7479
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2022
    Veröffentlicht in Soft computing (Berlin, Germany) (01.09.2022)
    “… As a typical meta-heuristic algorithm, ant colony optimization (ACO) has achieved good results in solving discrete combinatorial optimization problems …”
    Volltext
    Journal Article
  5. 5

    A Survey On Graph Matching In Computer Vision von Sun, Hui, Zhou, Wenju, Fei, Minrui

    Veröffentlicht: IEEE 17.10.2020
    “… Graph matching (GM) which is the problem of finding vertex correspondence among two or multiple graphs is a fundamental problem in computer vision and pattern …”
    Volltext
    Tagungsbericht
  6. 6

    An Improved Multi-state Particle Swarm Optimization for Discrete Optimization Problems von Ibrahim, Ismail, Ibrahim, Zuwairie, Ahmad, Hamzah, Md Yusof, Zulkifli

    Veröffentlicht: IEEE 01.06.2015
    “… Particle swarm optimization (PSO) has been successfully applied to solve various optimization problems. Recently, a state-based algorithm called multi-state …”
    Volltext
    Tagungsbericht
  7. 7

    A Multi-state Gravitational Search Algorithm for Combinatorial Optimization Problems von Ibrahim, Ismail, Ibrahim, Zuwairie, Ahmad, Hamzah, Yusof, Zulkifli Md

    Veröffentlicht: IEEE 01.06.2015
    “… The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. Many improvements …”
    Volltext
    Tagungsbericht
  8. 8

    Rule-based multi-state gravitational search algorithm for discrete optimization problem von Ibrahim, Ismail, Ibrahim, Zuwairie, Ahmad, Hamzah, Yusof, Zulkifli Md

    Veröffentlicht: IEEE 01.08.2015
    “… Gravitational search algorithm swarm (GSA) is a metaheuristic optimization algorithm, which is based on the Newton's law of gravity and the law of motion, has …”
    Volltext
    Tagungsbericht
  9. 9

    An algorithm of set-based differential evolution for traveling salesman problem von Tao Liu, Maeda, Michiharu

    Veröffentlicht: IEEE 01.12.2014
    “… This paper is concerned with combinatorial optimization problems (COPs) for traveling salesman problem (TSP). Differential evolution (DE) is a population-based …”
    Volltext
    Tagungsbericht
  10. 10

    Set-Based Differential Evolution for Traveling Salesman Problem von Tao Liu, Maeda, Michiharu

    Veröffentlicht: IEEE 01.11.2013
    “… This paper is concerned with the discrete combinatorial optimization problem. A novel set-based differential evolution (SBDE) algorithm for traveling salesman …”
    Volltext
    Tagungsbericht