-
221
A simulated annealing algorithm for the capacitated vehicle routing problem
Published 2017“…In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combination of random and deterministic operators that are based on problem knowledge information. …”
Get full text
Get full text
Get full text
conferenceObject -
222
A simulated annealing algorithm for the capacitated vehicle routing problem
Published 2011“…In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combination of random and deterministic operators that are based on problem knowledge information. …”
Get full text
Get full text
Get full text
conferenceObject -
223
Genetic Algorithm Based Simultaneous Eigenvalue Placement Of Power Systems
Published 2020“…The task of selecting the output feedback gains is converted to a simple optimization problem with an eigenvaluebased objective function, which is solved by a genetic algorithm. …”
Get full text
article -
224
A family of minimum curvature variable-methods for unconstrained optimization. (c1998)
Published 1998Get full text
Get full text
masterThesis -
225
A method for test scheduling using an evolutionary approach. (c2000)
Published 2000Get full text
Get full text
masterThesis -
226
Evolutionary Game-Based Battery Scheduling: A Comparative Study for Prosumers in Smart Grids
Published 2025Subjects: -
227
Optimizing Aircraft Pitch Control Systems: A Novel Approach Integrating Artificial Rabbits Optimizer with PID-F Controller
Published 2024“…Comparative analysis with various optimization algorithm-based controllers from the literature demonstrates the effectiveness of the proposed technique. …”
Get full text
-
228
An evolutionary algorithm for solving the geometrically constrained site layout problem
Published 2017“…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 -
229
Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm
Published 2024“…This work aims to enhance the performance of the K-means algorithm by introducing a novel method for selecting the initial centroids, thereby minimizing randomness and reducing the number of iterations needed to reach optimal results. …”
Get full text
Get full text
Get full text
masterThesis -
230
Concurrent BIST Synthesis and Test Scheduling Using Genetic Algorithms
Published 2007“…The method is based on a genetic algorithm that efficiently explores the testable design space and finds a sub-optimal test registers assignment for each k-test session. …”
Get full text
Get full text
Get full text
article -
231
Parallel scatter search algorithms for exam timetabling. (c2009)
Published 2009Get full text
Get full text
masterThesis -
232
-
233
OPTIMAL SHUNT COMPENSATORS AT NON-SINUSOIDAL BUSBARS
Published 2020“…The Direct Search Polytope algorithm is used. The solution of this model yields an optimal shunt LC compensator for the nonlinear lend. …”
Get full text
article -
234
An optimization approach for the computation of the minimumdestabilizing uncertainty volume
Published 2000“…We propose a nonlinear optimization based algorithm for the computation of the stability region for uncertain polynomials. …”
Get full text
Get full text
article -
235
-
236
An Optimal Repeat Inspection Plan With Several Classifications
Published 2020“…A mathematical model that depicts the plan is developed. An algorithm is proposed for finding the optimal number of repeat inspections and the sequence of characteristics for inspection that minimizes expected total cost per accepted component. …”
Get full text
article -
237
-
238
EVALUATION OF OPTIMIZATION METHODS FOR MACHINING ECONOMICS MODELS
Published 2020“…In machining operations it is desirable to operate under optimal machining conditions. The optimal cutting conditions are obtained by solving machining optimization models. …”
Get full text
article -
239
An enhanced binary Rat Swarm Optimizer based on local-best concepts of PSO and collaborative crossover operators for feature selection
Published 2022“…The binary enhanced RSO is built based on three successive modifications: i) an S-shape transfer function is used to develop binary RSO algorithms; ii) the local search paradigm of particle swarm optimization is used with the iterative loop of RSO to boost its local exploitation; iii) three crossover mechanisms are used and controlled by a switch probability to improve the diversity. …”
-
240
Evolutionary algorithms, simulated annealing and tabu search: a comparative study
Published 2020“…Abstract Evolutionary algorithms, simulated annealing (SA), and tabu search (TS) are general iterative algorithms for combinatorial optimization. …”
Get full text
article