Search Results - (( solution construction based algorithm ) OR ( evolution optimization path algorithm ))
Search alternatives:
- evolution optimization »
- solution construction »
- construction based »
- optimization path »
- path algorithm »
-
1
Differential evolution optimization for constrained routing in Wireless Mesh Networks
Published 2014“…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
Get full text
Get full text
Get full text
Proceeding Paper -
2
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
Get full text
Get full text
Thesis -
3
Development of an improved GWO algorithm for solving optimal paths in complex vertical farms with multi-robot multi-tasking
Published 2024“…The EPDE-GWO algorithm is compared with Genetic Algorithm (GA), Simulated Annealing (SA), Dung Beetle Optimizer (DBO), and Particle Swarm Optimization (PSO). …”
Get full text
Get full text
Get full text
Article -
4
-
5
Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
Published 2007“…Roadways and telephone systems are the examples of them. Genetic Algorithms (GA), pioneered by John Holland, applies the principle of evolution found in nature to the problem of finding an optimal solution. …”
Get full text
Get full text
Thesis -
6
Literature Review of Optimization Techniques for Chatter Suppression In Machining
Published 2011“…Various algorithms can be applied in the optimization of machining problems; however, Differential Evolution is the most appropriate for use in chatter suppression, being less time consuming, locally optimal, and more robust than both Genetic Algorithms, despite their wide applications, and Sequential Quadratic Programming, which is a famous conventional algorithm.…”
Get full text
Get full text
Get full text
Article -
7
Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators
Published 2024“…By integrating the ABC algorithm into the manipulator's control system, the goal is to enhance its ability to plan paths and optimize trajectories. …”
Get full text
Get full text
Get full text
Article -
8
Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem
Published 2017“…This paper investigates the construction phase approach in which the sequential order of the courses/lectures applied several combination of graph heuristics to generate a population of initial solutions in curriculum-based course timetabling (CBCTT).The construction of population of initial solution is a prerequisite in a population-based metaheuristic implementation. …”
Get full text
Get full text
Conference or Workshop Item -
9
Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin
Published 2013“…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
Get full text
Get full text
Get full text
Thesis -
10
Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms
Published 2020“…The IEM algorithm uses the attraction-repulsion mechanism to change the positions of solutions towards the optimality. …”
Get full text
Get full text
Thesis -
11
Utilizing the roulette wheel based social network search algorithm for substitution box construction and optimization
Published 2023“…This paper introduces a new variant of a recent metaheuristic algorithm based on the Social Network Search algorithm (SNS), which is called the Roulette Wheel Social Network Search algorithm (SNS). …”
Get full text
Get full text
Get full text
Get full text
Article -
12
A secure trust aware ACO-Based WSN routing protocol for IoT
Published 2022“…The performance of the proposed routing algorithm is demonstrated through MATLAB. Based on the proposed system, to find the secure and optimal path while aiming at providing trust in IoT environment, the average energy consumption is minimized by nearly 50% even as the number of nodes has increased, as compared with the conventional ACO algorithm, a current ant-based routing algorithm for IoT-communication, and a present routing protocol RPL for IoT.…”
Get full text
Get full text
Get full text
Article -
13
Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems
Published 2024“…(iii) It is a constructive-based meta-heuristic algorithm which means, the solution is incrementally constructed (step by step) until the complete solution is obtained (Noferesti and Shah-Hosseini, 2012). …”
thesis::doctoral thesis -
14
Dealing with Routing Hole Problem in Multi-hop Hierarchical Routing Protocol in Wireless Sensor Network
Published 2019“…The challenging issue of routing protocols is to reduce the communication overhead for data transmission by determining an optimal path. The hierarchical routing technique is one of the energy efficient routing protocols in WSN. …”
Get full text
Get full text
Thesis -
15
Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem
Published 2020“…Sequential constructive algorithm is one of the popular methods for solving timetabling problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
16
Harmony annealing algorithm for curriculum-based course timetabling problem
Published 2012“…An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics
Published 2016“…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
Get full text
Get full text
Get full text
Article -
18
Enhancing the Sorting Layers in the Initial Stage of High School Timetabling
Published 2020“…KHE is an algorithm that generates initial solution of HSTP. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
-
20
Sequential Constructive Algorithm incorporate with Fuzzy Logic for Solving Real World Course Timetabling Problem
Published 2020“…Sequential constructive algorithm is one of the popular methods for solving timetabling problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Book
