Results 21 to 30 of about 167,714 (331)
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
Minimum Entropy Combinatorial Optimization Problems [PDF]
Theory of Computing Systems, 2009 We survey recent results on combinatorial optimization problems in which the objective function is the entropy of a discrete distribution. These include the minimum entropy set cover, minimum entropy orientation, and minimum entropy coloring problems.
Cardinal, Jean +2 more
openaire +5 more sources
Convex Combinatorial Optimization [PDF]
, 2003 We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and discuss several
Onn, Shmuel, Rothblum, Uriel G.
core +4 more sources
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 +3 more sources
Optimization heuristics for the combinatorial auction problem [PDF]
The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2004 This work presents and compares three heuristics for the combinatorial auction problem. Besides a simple greedy (SG) mechanism, two metaheuristics, a simulated annealing (SA), and a genetic algorithm (GA) approach are developed which use the combinatorial auction process to find an allocation with maximal revenue for the auctioneer.
Michael Schwind +2 more
openaire +3 more sources
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
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 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