A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems
IEEE Access, 2020 Hyper-heuristics aim at interchanging different solvers while solving a problem. The idea is to determine the best approach for solving a problem at its current state. This way, every time we make a move it gets us closer to a solution.
Melissa Sanchez +5 more
doaj +3 more sources
The inverse k-max combinatorial optimization problem [PDF]
Yugoslav Journal of Operations Research, 2023 Classical combinatorial optimization concerns finding a feasible subset of a ground set in order to optimize an objective function. We address in this article the inverse optimization problem with the k-max function. In other words, we attempt to perturb
Nhan Tran Hoai Ngoc +3 more
doaj +1 more source
A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems
Frontiers in Physics, 2022 Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems.
Tianyi Hao +5 more
doaj +1 more source
Review of Reinforcement Learning for Combinatorial Optimization Problem [PDF]
Jisuanji kexue yu tansuo, 2022 The solution methods for combinatorial optimization problem (COP) have permeated to the fields of artificial intelligence, operations research, etc. With the scale of data increasing and the speed of problem updating being faster, the traditional method ...
WANG Yang, CHEN Zhibin, WU Zhaorui, GAO Yuan
doaj +1 more source
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
IEEE Access, 2021 The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated.
Kensuke Tamura +4 more
doaj +1 more source
Conflict Resolution as a Combinatorial Optimization Problem
Information, 2023 Within the framework of the mathematical theory of conflicts, we consider a multi-criterial conflict situation using the example of a child–parent conflict.
Ekaterina Antipova, Sergey Rashkovskiy
doaj +1 more source
A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems [PDF]
International Journal of Computational Intelligence Systems, 2014 This paper introduces a new self-tuning mechanism to the local search heuristic for solving of combinatorial optimization problems. Parameter tuning of heuristics makes them difficult to apply, as parameter tuning itself is an optimization problem.
Cigdem Alabas-Uslu, Berna Dengiz
doaj +1 more source
An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries
Applied Sciences, 2022 In combinatorial optimization, the more complex a problem is, the more challenging it becomes, usually causing most research to focus on creating solvers for larger cases.
Jose Torres-Jimenez +3 more
doaj +1 more source
Analysis of cutting stock problem metaheuristic algorithms
Lietuvos Matematikos Rinkinys, 2021 The analysis of cutting stock problem and heuristic and metaheuristic algorithms for solving it are presented in this paper.
Jonas Pokštas, Narimantas Listopadskis
doaj +1 more source
Binary Cockroach Swarm Optimization for Combinatorial Optimization Problem
Algorithms, 2016 The Cockroach Swarm Optimization (CSO) algorithm is inspired by cockroach social behavior. It is a simple and efficient meta-heuristic algorithm and has been applied to solve global optimization problems successfully.
Ibidun Christiana Obagbuwa +1 more
doaj +1 more source