Preferred Language
Articles
/
ijs-4036
A Multi-Objective Task Offloading Optimization for Vehicular Fog Computing
...Show More Authors

      Internet of Vehicle (IoV) is one of the most basic branches of the Internet of Things (IoT), which provides many advantages for drivers and passengers to ensure safety and traffic efficiency. Most IoV applications are delay-sensitive and require resources for data storage and computation that cannot be afforded by vehicles. Thus, such tasks are always offloaded to more powerful nodes, like cloud or fog. Vehicular Fog Computing (VFC), which extends cloud computing and brings resources closer to the edge of the network, has the potential to reduce both traffic congestion and load on the cloud. Resources management and allocation process is very critical for satisfying both user and provider needs. However, the strategy of task offloading to fog node in constraints of energy and latency is still an open issue. Several research works have tackled the resource scheduling problem in the field of VFC; however, the recent studies have not carefully addressed the transmission path to the destination node, nor has it considered the energy consumption of vehicles. This paper aims to optimize the task offloading process in the VFC system in terms of latency and energy objectives while taking the deadline constraint into considerations by adopting a Multi-Objective Evolutionary Algorithm (MOEA). Four different execution/transmission models are proposed where vehicle resources are utilized for tasks execution and transmission, and the well-known Dijkstra's algorithm is adopted to find the minimum path between each two nodes. The simulation results show that the models which involve the vehicles in the transmission process have reduced the latency and the total energy for the VFC system significantly in comparison with other models and the current state of the art methods.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Wed Jul 29 2020
Journal Name
Iraqi Journal Of Science
Fog-based Spider Web Algorithm to Overcome Latency in Cloud Computing
...Show More Authors

The cloud-users are getting impatient by experiencing the delays in loading the content of the web applications over the internet, which is usually caused by the complex latency while accessing the cloud datacenters distant from the cloud-users. It is becoming a catastrophic situation in availing the services and applications over the cloud-centric network. In cloud, workload is distributed across the multiple layers which also increases the latency. Time-sensitive Internet of Things (IoT) applications and services, usually in a cloud platform, are running over various virtual machines (VM’s) and possess high complexities while interacting. They face difficulties in the consolidations of the various applications containing heterog

... Show More
View Publication Preview PDF
Scopus (6)
Crossref (3)
Scopus Crossref
Publication Date
Sun Jan 16 2022
Journal Name
Iraqi Journal Of Science
A Multi-Objective Evolutionary Algorithm based Feature Selection for Intrusion Detection
...Show More Authors

Nowad ays, with the development of internet communication that provides many facilities to the user leads in turn to growing unauthorized access. As a result, intrusion detection system (IDS) becomes necessary to provide a high level of security for huge amount of information transferred in the network to protect them from threats. One of the main challenges for IDS is the high dimensionality of the feature space and how the relevant features to distinguish the normal network traffic from attack network are selected. In this paper, multi-objective evolutionary algorithm with decomposition (MOEA/D) and MOEA/D with the injection of a proposed local search operator are adopted to solve the Multi-objective optimization (MOO) followed by Naï

... Show More
View Publication Preview PDF
Publication Date
Sun Dec 01 2019
Journal Name
Applied Soft Computing
A new evolutionary multi-objective community mining algorithm for signed networks
...Show More Authors

View Publication
Scopus (7)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Tue Oct 16 2018
Journal Name
Springer Science And Business Media Llc
MOGSABAT: a metaheuristic hybrid algorithm for solving multi-objective optimisation problems
...Show More Authors

Scopus (58)
Crossref (40)
Scopus Clarivate Crossref
Publication Date
Sat Sep 01 2012
Journal Name
Journal Of Economics And Administrative Sciences
New Approach for Solving Multi – Objective Problems
...Show More Authors

  There are many researches deals with constructing an efficient solutions for real problem having Multi - objective confronted with each others. In this paper we construct a decision for Multi – objectives based on building a mathematical model formulating a unique objective function by combining the confronted objectives functions. Also we are presented some theories concerning this problem. Areal application problem has been presented to show the efficiency of the performance of our model and the method. Finally we obtained some results by randomly generating some problems.

View Publication Preview PDF
Crossref
Publication Date
Mon Feb 14 2022
Journal Name
Iraqi Journal Of Science
A New Method for Solving Fully Fuzzy Multi-Objective Linear Programming Problems
...Show More Authors

In this paper we present a new method for solving fully fuzzy multi-objective linear programming problems and find the fuzzy optimal solution of it. Numerical examples are provided to illustrate the method.

View Publication Preview PDF
Publication Date
Mon Jan 01 2024
Journal Name
Fusion: Practice And Applications
Optimizing Task Scheduling and Resource Allocation in Computing Environments using Metaheuristic Methods
...Show More Authors

Optimizing system performance in dynamic and heterogeneous environments and the efficient management of computational tasks are crucial. This paper therefore looks at task scheduling and resource allocation algorithms in some depth. The work evaluates five algorithms: Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Firefly Algorithm (FA) and Simulated Annealing (SA) across various workloads achieved by varying the task-to-node ratio. The paper identifies Finish Time and Deadline as two key performance metrics for gauging the efficacy of an algorithm, and a comprehensive investigation of the behaviors of these algorithms across different workloads was carried out. Results from the experiment

... Show More
View Publication
Scopus Crossref
Publication Date
Thu Dec 01 2016
Journal Name
Swarm And Evolutionary Computation
A new multi-objective evolutionary framework for community mining in dynamic social networks
...Show More Authors

View Publication
Scopus (23)
Crossref (22)
Scopus Clarivate Crossref
Publication Date
Mon Aug 26 2019
Journal Name
Iraqi Journal Of Science
Exact Methods for Solving Multi-Objective Problem on Single Machine Scheduling
...Show More Authors

     In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr

... Show More
View Publication Preview PDF
Scopus (10)
Crossref (7)
Scopus Crossref
Publication Date
Sun Aug 01 2021
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Novel Heuristic Approach for Solving Multi-objective Scheduling Problems
...Show More Authors

    In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi

... Show More
View Publication Preview PDF
Crossref