Search Results - (( based optimization path algorithm ) OR ( discrete optimization model algorithm ))

African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

“…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
Get full text
Get full text
Get full text

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
Get full text
Get full text

Meta-Heuristic Algorithms for Learning Path Recommender at MOOC by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N.

“…We have developed Metaheuristic algorithms includes the Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), to solve the proposed model. …”
Get full text
Get full text

An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

“…Several variants of PSO have been proposed for solving discrete optimization problems like TSP. Among them, the basic algorithm is the Swap Sequence based PSO (SSPSO), however, it does not perform well in providing high quality solutions. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Improvement and application of particle swarm optimization algorithm by Deevi, Durga Praveen, Kodadi, Sharadha, Allur, Naga Sushma, Dondapati, Koteswararao, Chetlapalli, Himabindu, Perumal, Thinagaran

“…This method combines CPTD with the Genetic Algorithm and PSO (GAPSO), resulting in an effective strategy for dynamic formation reconfiguration and path optimization. …”
Get full text
Get full text

Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

“…In order to solve the camera placement problem, a crucial fundamental step is modeling the coverage of the cameras in use. Following the coverage modeling, an optimization method needs to be used to locate the optimal poses and/or camera positions. …”
Get full text
Get full text

Optimal design of low-voltage distribution networks for CO2 emission minimisation. Part II: Discrete optimisation of radial networks and comparison with alternative design strategi... by Gan, Chin Kim

“…This study extends the model for optimal environmental design of distribution systems presented in Part I to network analyses. …”
Get full text
Get full text
Get full text

A mating technique for various crossover in genetic algorithm for optimum system identification by Abd Samad @ Mahmood, Md Fahmi, Zainuddin, Farah Ayiesya

“…Such derivation is made using a mathematical model based on certain specified assumptions. To researchers who are involved in the application of Genetic Algorithm (GA) in optimization, the process of choosing the best parents in the population for mating has become of great interest. …”
Get full text
Get full text
Get full text

Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

“…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
Get full text
Get full text
Get full text

Multi-state PSO GSA for solving discrete combinatorial optimization problems by Ismail, Ibrahim

“…These four algorithms can be used to solve discrete combinatorial optimization problems (COPs). …”
Get full text
Get full text

Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems by Kek, Sie Long

“…This thesis describes the development of an efficient algorithm for solving nonlinear stochastic optimal control problems in discrete-time based on the principle of model-reality differences. …”
Get full text
Get full text

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents two algorithms that integrate new Ant Colony Optimization (ACO) variants which are Incremental Continuous Ant Colony Optimization (IACOR) and Incremental Mixed Variable Ant Colony Optimization (IACOMV) with Support Vector Machine (SVM) to enhance the performance of SVM.The first algorithm aims to solve SVM model selection problem. …”
Get full text
Get full text
Get full text

Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

“…The optimized discrete DA is then applied to a TSP problem modelling a package delivery system in the area of Kuala Lumpur and to benchmark TSP problems. …”
Get full text
Get full text

Multi-objective Binary Clonal Selection Algorithm In The Retrieval Phase Of Discrete Hopfield Neural Network With Weighted Systematic Satisfiability by Romli, Nurul Atiqah

“…The proposed algorithm in the retrieval phase showed optimal performance as compared to the baseline algorithms. …”
Get full text
Get full text

Binary Artificial Bee Colony Optimization For Weighted Random 2 Satisfiability In Discrete Hopfield Neural Network by Muhammad Sidik, Siti Syatirah

“…One of the alternatives to improve the modeling of the Discrete Hopfield Neural Network is by implementing different variants of logical rules. …”
Get full text
Get full text

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

“…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
Get full text
Get full text
Get full text

Comparison between multi-objective and single-objective optimization for the modeling of dynamic systems by Mohd Zakimi, Zakaria, Hishamuddin, Jamaluddin, Robiah, Ahmad, Sayed Mohammad Reza, Loghmanian

Get full text

Advances in Particle Swarm Algorithms in Asynchronous, Discrete and Multi-Objective Optimization by Zuwairie, Ibrahim

Get full text
Get full text
Get full text

A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

“…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text

Solving SVM model selection problem using ACOR and IACOR by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…Ant Colony Optimization (ACO) has been used to solve Support Vector Machine (SVM) model selection problem.ACO originally deals with discrete optimization problem. …”
Get full text
Get full text
Get full text