Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
case finding » cam binding (Expand Search)
element » elements (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
case finding » cam binding (Expand Search)
element » elements (Expand Search)
-
1
Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities
Published 2002“…The paper concludes with examples illustrating the strength and limitations of the proposed algorithm in the cases of ~1! loosely versus tightly constrained layouts with equal levels of interaction between facilities; ~2! …”
Get full text
Get full text
Get full text
article -
2
Salp swarm algorithm: survey, analysis, and new applications
Published 2024“…This chapter offers the sea salmon-associated polyp (SALP) swarm algorithm (SSA) and multipurpose SSA (MSSA) as new optimization algorithms for solving optimization problems with single and multiple objectives. …”
Get full text
-
3
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
4
Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem
Published 2018“…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
Get full text
Get full text
Get full text
Get full text
article -
5
An evolutionary algorithm for solving the geometrically constrained site layout problem
Published 2017“…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
6
-
7
Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
Published 1998“…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
Get full text
Get full text
article -
8
Modified clarke wright algorithms for solving the realistic vehicle routing problem
Published 2015Get full text
Get full text
Get full text
Get full text
conferenceObject -
9
A reduced model for phase-change problems with radiation using simplified PN approximations
Published 2025“…The integro-differential equation for the full radiative transfer is replaced by a set of differential equations which are independent of the angle variable and easy to solve using conventional computational methods. To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. …”
Get full text
article -
10
Natural optimization algorithms for optimal regression testing
Published 1997“…The present two natural optimization algorithms, namely simulated annealing and genetic algorithms, for solving this problem. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
11
Intelligent Rapidly-Exploring Random Tree Star Algorithm
Published 2024Get full text
doctoralThesis -
12
-
13
Fixed-parameter algorithms for hitting set problems. (c2006)
Published 2006Get full text
Get full text
masterThesis -
14
A fast exact sequential algorithm for the partial digest problem
Published 2016“…The percentage of improvement is more than 75% over the best known practical algorithm for the worst case. For large numbers of inputs, our algorithm is able to solve the problem in a suitable time, while the best known practical algorithm is unable.…”
-
15
-
16
Modified arithmetic optimization algorithm for drones measurements and tracks assignment problem
Published 2023“…The measurements and track generation are simulated using Stone Soup software. On the other hand, the optimization of the problem is implemented using several evolutionary-based metaheuristic algorithms. …”
Get full text
-
17
Evolutionary algorithms for state justification in sequential automatic test pattern generation
Published 2005“…A common search operation in sequential Automatic Test Pattern Generation is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. …”
Get full text
article -
18
-
19
-
20
Test case generation for path coverage. (c2000)
Published 2000Get full text
Get full text
masterThesis