Results 21 to 30 of about 7,400,710 (384)
Novel Heuristic Algorithm & its Application for Reliability Optimization
International Journal of Mathematical, Engineering and Management Sciences, 2023 Heuristic algorithms are practical, easy to implement, and work fast to provide short-term, feasible solutions for any kind of problem within economical budgets as compared to other meta-heuristic algorithms.
Tripti Dahiya +4 more
doaj +1 more source
A multilevel probabilistic beam search algorithm for the shortest common supersequence problem. [PDF]
PLoS ONE, 2012 The shortest common supersequence problem is a classical problem with many applications in different fields such as planning, Artificial Intelligence and especially in Bioinformatics.
José E Gallardo
doaj +1 more source
Silva Fennica, 2006 A new heuristic method to mitigate infeasibilities when a choice is forced into a solution was developed to solve spatially constrained forest planning problems.
Bettinger, Pete, Zhu, Jianping
doaj +1 more source
Ant Colony Optimization for Resistor Color Code Detection
Knowledge Engineering and Data Science, 2023 In the early stages of learning resistors, introducing color-based values is needed. Moreover, some combinations require a resistor trip analysis to identify.
Slamet Wibawanto +2 more
doaj +1 more source
Optimal advertising campaign generation for multiple brands using MOGA [PDF]
, 2007 The paper proposes a new modified multiobjective genetic algorithm (MOGA) for the problem of optimal television (TV) advertising campaign generation for multiple brands. This NP-hard combinatorial optimization problem with numerous constraints is one of
Fleming, P.J., Pashkevich, M.A.
core +1 more source
A Heuristic Algorithm for Resource Allocation/Reallocation Problem
Journal of Applied Mathematics, 2011 This paper presents a 1-opt heuristic approach to solve resource allocation/reallocation problem which is known as 0/1 multichoice multidimensional knapsack problem (MMKP).
S. Raja Balachandar, K. Kannan
doaj +1 more source
A PageRank-based heuristic for the minimization of open stacks problem. [PDF]
PLoS ONE, 2018 The minimization of open stacks problem (MOSP) aims to determine the ideal production sequence to optimize the occupation of physical space in manufacturing settings.
Rafael de Magalhães Dias Frinhani +2 more
doaj +1 more source
Manufacturing Review, 2014 In this paper, a hybrid flow shop scheduling problem with a new approach considering time lags and sequence-dependent setup time in realistic situations is presented.
Farahmand-Mehr Mohammad +4 more
doaj +1 more source
Heuristics and optimal solutions to the breadth–depth dilemma
Proceedings of the National Academy of Sciences, 2020 Significance From choosing among the many courses offered in graduate school to dividing budget into research programs, the breadth–depth is a commonplace dilemma that arises when finite resources (e.g., time, money, cognitive capabilities) need to be allocated among a large range of alternatives.
Rubén Moreno-Bote +3 more
openaire +3 more sources
A heuristic approach for big bucket multi-level production planning problems [PDF]
, 2009 Multi-level production planning problems in which multiple items compete for the same resources frequently occur in practice, yet remain daunting in their difficulty to solve. In this paper, we propose a heuristic framework that can generate high quality
Akartunali, Kerem, Miller, Andrew
core +3 more sources