Preferred Language
Articles
/
joe-195
An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In order to evaluate the proposed algorithm in term of finding the best solution, six benchmark test functions are used to make a comparison between AMOPSO and the standard MOPSO. The results show that the AMOPSO has a better ability to get away from local optimums with a quickest convergence than the MOPSO. The simulation results using Matlab 2014a, indicate that this methodology is extremely valuable for every robot in multi-robot framework to discover its own particular proper pa‌th from the start to the destination position with minimum distance and time.

 

 

View Publication Preview PDF
Quick Preview PDF
Publication Date
Fri Jan 01 2016
Journal Name
Aip Conference Proceedings
Application of simulated annealing to solve multi-objectives for aggregate production planning

Aggregate production planning (APP) is one of the most significant and complicated problems in production planning and aim to set overall production levels for each product category to meet fluctuating or uncertain demand in future. and to set decision concerning hiring, firing, overtime, subcontract, carrying inventory level. In this paper, we present a simulated annealing (SA) for multi-objective linear programming to solve APP. SA is considered to be a good tool for imprecise optimization problems. The proposed model minimizes total production and workforce costs. In this study, the proposed SA is compared with particle swarm optimization (PSO). The results show that the proposed SA is effective in reducing total production costs and req

... Show More
View Publication Preview PDF
Scopus (12)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Sat Sep 30 2017
Journal Name
Al-khwarizmi Engineering Journal
A Cognitive Hybrid Tuning Control Algorithm Design for Nonlinear Path-Tracking Controller for Wheeled Mobile Robot

Abstract

This research presents a on-line cognitive tuning control algorithm for the nonlinear controller of path-tracking for dynamic wheeled mobile robot to stabilize and follow a continuous reference path with minimum tracking pose error. The goal of the proposed structure of a hybrid (Bees-PSO) algorithm is to find and tune the values of the control gains of the nonlinear (neural and back-stepping method) controllers as a simple on-line with fast tuning techniques in order to obtain the best torques actions of the wheels for the cart mobile robot from the proposed two controllers. Simulation results (Matlab Package 2012a) show that the nonlinear neural controller with hybrid Bees-PSO cognitive algorithm is m

... Show More
View Publication Preview PDF
Publication Date
Sat Feb 01 2014
Journal Name
Journal Of Economics And Administrative Sciences
Solve travelling sales man problem by using fuzzy multi-objective linear programming

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Oct 29 2023
Journal Name
Journal Of Al-qadisiyah For Computer Science And Mathematics
Optimization Techniques for Human Multi-Biometric Recognition System

Researchers are increasingly using multimodal biometrics to strengthen the security of biometric applications. In this study, a strong multimodal human identification model was developed to address the growing problem of spoofing attacks in biometric security systems. Through the use of metaheuristic optimization methods, such as the Genetic Algorithm(GA), Ant Colony Optimization(ACO), and Particle Swarm Optimization (PSO) for feature selection, this unique model incorporates three biometric modalities: face, iris, and fingerprint. Image pre-processing, feature extraction, critical image feature selection, and multibiometric recognition are the four main steps in the workflow of the system. To determine its performance, the model wa

... Show More
View Publication
Crossref
Publication Date
Thu Aug 01 2019
Journal Name
Journal Of Economics And Administrative Sciences
Building the optimal portfolio for stock using multi-objective genetic algorithm - comparative analytical research in the Iraqi stock market

Abstract:

The main objective of the research is to build an optimal investment portfolio of stocks’ listed at the Iraqi Stock Exchange after employing the multi-objective genetic algorithm within the period of time between 1/1/2006 and 1/6/2018 in the light of closing prices (43) companies after the completion of their data and met the conditions of the inspection, as the literature review has supported the diagnosis of the knowledge gap and the identification of deficiencies in the level of experimentation was the current direction of research was to reflect the aspects of the unseen and untreated by other researchers in particular, the missing data and non-reversed pieces the reality of trading at the level of compani

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat Apr 01 2017
Journal Name
Journal Of Economics And Administrative Sciences
The Use of Particle Swarm Algorithm to Solve Queuing Models with Practical Application

This paper includes the application of Queuing theory with of Particle swarm algorithm or is called (Intelligence swarm) to solve the problem of The queues and developed for General commission for taxes /branch Karkh center in the service stage of the Department of calculators composed of six  employees , and it was chosen queuing model is a single-service channel  M / M / 1 according to the nature of the circuit work mentioned above and it will be divided according to the letters system for each employee, and  it was composed of data collection times (arrival time , service time, departure time)

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Apr 30 2021
Journal Name
International Journal Of Intelligent Engineering And Systems
SMS Spam Detection Based on Fuzzy Rules and Binary Particle Swarm Optimization

View Publication
Scopus (8)
Crossref (2)
Scopus Crossref
Publication Date
Sat Sep 27 2014
Journal Name
Soft Computing
Multi-objective evolutionary routing protocol for efficient coverage in mobile sensor networks

View Publication
Scopus (30)
Crossref (23)
Scopus Clarivate Crossref
Publication Date
Wed Feb 01 2023
Journal Name
International Journal Of Engineering, Ije Transactions B: Applications
Adaptive Polynomial Coding of Multi-Base Hybrid Compression

Scopus (4)
Scopus
Publication Date
Fri Apr 01 2022
Journal Name
Telkomnika (telecommunication Computing Electronics And Control)
An adaptive neural control methodology design for dynamics mobile robot

View Publication
Scopus (9)
Crossref (6)
Scopus Crossref