Search alternatives:
modeling algorithm » scheduling algorithm (Expand Search)
4_using algorithm » cosine algorithm (Expand Search)
could algorithm » mould algorithm (Expand Search), carlo algorithm (Expand Search), colony algorithm (Expand Search)
element » elements (Expand Search)
modeling algorithm » scheduling algorithm (Expand Search)
4_using algorithm » cosine algorithm (Expand Search)
could algorithm » mould algorithm (Expand Search), carlo algorithm (Expand Search), colony algorithm (Expand Search)
element » elements (Expand Search)
-
1
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 -
2
Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities
Published 2002“…In most problems considered where the total-objects-to-site-area ratio did not exceed 60%, the algorithm returned close to optimal solutions in a reasonable time.…”
Get full text
Get full text
Get full text
article -
3
-
4
A New Parallel Genetic Algorithm Model
Published 2020“…This paper presents an implementation of three Genetic Algorithm models for solving a reliability optimization problem for a redundancy system with several failure modes, a modification on a parallel a genetic algorithm model and a new parallel genetic algorithm model. …”
Get full text
article -
5
A hybrid of clustering and meta-heuristic algorithms to solve a p-mobile hub location–allocation problem with the depreciation cost of hub facilities
Published 2021“…A multi-objective mixed-integer non-linear programming (MINLP) model is developed. To solve the proposed model, four meta-heuristic algorithms, namely multi-objective particle swarm optimization (MOPSO), a non-dominated sorting genetic algorithm (NSGA-II), a hybrid of k-medoids as a famous clustering algorithm and NSGA-II (KNSGA-II), and a hybrid of K-medoids and MOPSO (KMOPSO) are implemented. …”
-
6
Parameter Estimation Of Wiener-Hammerstein Models Via Genetic Algorithms
Published 2020“…In this paper, a modified genetic algorithm is used as a procedure to solve the parameter identification problem of the nonlinear Wiener-Hammerstein models. …”
Get full text
article -
7
A genetic-based algorithm for fuzzy unit commitment model
Published 2000“…The genetic algorithm (GA) approach is then used to solve the proposed fuzzy UCP model. …”
Get full text
Get full text
article -
8
A GRASP Approach for Solving Large-Scale Electric Bus Scheduling Problems
Published 2021“…To be able to solve large problem instances corresponding to real-world applications of the model, a metaheuristic approach is investigated. …”
-
9
Fuzzy genetic algorithm for floorplanning
Published 2020“…Genetic algorithms (GAs) have been found to be very effective in solving numerous optimization problems, especially those with many (possibly) conflicting and noisy objectives. …”
Get full text
article -
10
An Uncertainty Based Genetic Algorithm Approach for Project Resource Scheduling
Published 2016“…Genetic algorithm was chosen as the main methodology to build resource scheduler. …”
Get full text
-
11
An L2 Gap Metric Identification Algorithm
Published 2020“…In this paper, an L2-gap metric identification algorithm is proposed. The algorithm uses a set of frequency response samples to come up with rational models so that the L2-gap between the observations and the identified model is minimized. …”
Get full text
article -
12
-
13
Capturing outline of fonts using genetic algorithm and splines
Published 2001“…We present a method to convert the original problem into a discrete combinatorial optimization problem and solve it by a genetic algorithm. We also incorporate a corner detection algorithm to detect significant points which are necessary to capture a pleasant looking spline fitting for shapes such as fonts. …”
Get full text
Get full text
article -
14
A neural networks algorithm for data path synthesis
Published 2003“…This paper presents a deterministic parallel algorithm to solve the data path allocation problem in high-level synthesis. …”
Get full text
Get full text
Get full text
article -
15
An Algorithm For Computing The Distance Between Two Circular Disks
Published 2020Get full text
article -
16
A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units
Published 2020“…The algorithm was developed, implemented and tested on an integrated model for the MS problem. …”
Get full text
article -
17
A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units
Published 2020“…The algorithm was developed, implemented and tested on an integrated model for the MS problem. …”
Get full text
article -
18
Multiclass feature selection with metaheuristic optimization algorithms: a review
Published 2022“…Nevertheless, metaheuristic algorithms attract substantial attention to solving different problems in optimization. …”
Get full text
-
19
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
Get full text
Get full text
article -
20
A method for the minimum coloring problem using genetic algorithms
Published 2006Get full text
Get full text
Get full text
conferenceObject