Suchergebnisse - "Discrete combinatorial optimization problem"
-
1
A discrete wild horse optimizer for capacitated vehicle routing problem
ISSN: 2045-2322, 2045-2322Veröffentlicht: London Nature Publishing Group UK 11.09.2024Verö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
Solving Multiple Discretization Portfolio Optimization Problem with Quantum-Classical Hybrid Algorithms
ISSN: 0927-7099, 1572-9974Veröffentlicht: 31.07.2025Veröffentlicht in Computational economics (31.07.2025)Volltext
Journal Article -
3
Multi-objective Discrete Combinatorial Optimization Algorithm Combining Problem-Decomposition and Adaptive Large Neighborhood Search
ISSN: 1673-9418Veröffentlicht: Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press 01.07.2024Verö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
A dynamic space reduction ant colony optimization for capacitated vehicle routing problem
ISSN: 1432-7643, 1433-7479Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2022Verö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
A Survey On Graph Matching In Computer Vision
Veröffentlicht: IEEE 17.10.2020Veröffentlicht in 2020 13th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI) (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
An Improved Multi-state Particle Swarm Optimization for Discrete Optimization Problems
Veröffentlicht: IEEE 01.06.2015Veröffentlicht in 2015 7th International Conference on Computational Intelligence, Communication Systems and Networks (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
A Multi-state Gravitational Search Algorithm for Combinatorial Optimization Problems
Veröffentlicht: IEEE 01.06.2015Veröffentlicht in 2015 7th International Conference on Computational Intelligence, Communication Systems and Networks (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
Rule-based multi-state gravitational search algorithm for discrete optimization problem
Veröffentlicht: IEEE 01.08.2015Veröffentlicht in 2015 4th International Conference on Software Engineering and Computer Systems (ICSECS) (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
An algorithm of set-based differential evolution for traveling salesman problem
Veröffentlicht: IEEE 01.12.2014Veröffentlicht in 2014 Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS) (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
Set-Based Differential Evolution for Traveling Salesman Problem
Veröffentlicht: IEEE 01.11.2013Veröffentlicht in ICINIS 2013 : proceedings : 2013 6th International Conference on Intelligent Networks and Intelligent Systems : 1-3 November 2013, Shenyang, China (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