Results 21 to 30 of about 16,552 (267)
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
Multimode extensions of Combinatorial Optimization problems [PDF]
Electronic Notes in Discrete Mathematics, 2016 We review some complexity results and present a viable heuristic approach based on the Variable Neighborhood Search (VNS) framework for multimode extension of combinatorial optimization problems, such as the the Set Covering Problem (SCP) and the Covering Location Problem (CLP).
Cordone, R., Lulli, G.
openaire +4 more sources
Hysteresis in Combinatorial Optimization Problems
The International FLAIRS Conference Proceedings, 2021 Hysteresis is a physical phenomenon reflected in macroscopic observables of materials that are subjected to external perturbations. For example, magnetic hysteresis is observed in ferromagnetic metals such as iron, nickel and cobalt in the presence of a changing external magnetic field.
Yuling Guan +4 more
openaire +3 more sources
Complexity, 2022 The article is devoted to the problem of optimization of search request ranking algorithms in the digital information retrieval system. The algorithm of functioning of the neural network ranking unit based on Hopfield neural network is built. The ability
Viera Bartosova +4 more
doaj +1 more source
Multi-objective Discrete Combinatorial Optimization Algorithm Combining Problem-Decomposition and Adaptive Large Neighborhood Search [PDF]
Jisuanji kexue yu tansuoIn order to efficiently obtain solutions for large-scale multi-objective optimization problems in reality, to achieve a balance among convergence, diversity, and uniformity has gradually become one of the important goals in multi-objective optimization ...
WEI Qian, JI Bin
doaj +1 more source
Multi-Objective ABC-NM Algorithm for Multi-Dimensional Combinatorial Optimization Problem
Axioms, 2023 This article addresses the problem of converting a single-objective combinatorial problem into a multi-objective one using the Pareto front approach. Although existing algorithms can identify the optimal solution in a multi-objective space, they fail to ...
Muniyan Rajeswari +5 more
doaj +1 more source
An improved approach to resolve a combinatorial optimization problem based CoronaVirus Optimization Algorithm [PDF]
E3S Web of Conferences, 2022 Combinatorial optimization problems refer to intractable problems that can’t be performed using exact methods. The resolution of combinatorial problems geared towards the application of heuristics, metaheuristics also matheuristics, in order to provide ...
El Majdoubi Omayma +2 more
doaj +1 more source
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 +1 more source
Algorithms, 2018 We consider one approach to formalize the Resource-Constrained Project Scheduling Problem (RCPSP) in terms of combinatorial optimization theory. The transformation of the original problem into combinatorial setting is based on interpreting each operation
Alexander A. Lazarev +2 more
doaj +1 more source
Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems
Proceedings of the AAAI Conference on Artificial Intelligence, 2020 Combinatorial optimization assumes that all parameters of the optimization problem, e.g. the weights in the objective function, are fixed. Often, these weights are mere estimates and increasingly machine learning techniques are used to for their estimation.
Mandi, Jayanta +3 more
openaire +5 more sources