An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

In order to solve the premature convergence and improve the optimization ability of simple genetic algorithm (SGA) in the complex function optimization, an improved differential evolution based-genetic algorithm (DGA) is proposed in this paper. On the basis of the selection and crossover operation of SGA, the adaptive differential evolution operator is used as the main optimization method to re...

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

in this study, the problem of navigation in dynamic and unknown environment is investigated and a navigation method based on force field approach is suggested. it is assumed that the robot performs navigation in unknown environment and builds the map through slam procedure. since the moving objects' location and properties are unknown, they are identified and tracked by kalman filter. kalm...

In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...

This paper addresses control design in networked control system by considering stochastic packet dropouts in the forward path of the control loop. The packet dropouts are modelled by mutually independent stochastic variables satisfying Bernoulli binary distribution. A sliding mode controller is utilized to overcome the adverse influences of stochastic packet dropouts in networked control system...

with the explosive growth in amount of information, it is highly required to utilize tools and methods in order to search, filter and manage resources. one of the major problems in text classification relates to the high dimensional feature spaces. therefore, the main goal of text classification is to reduce the dimensionality of features space. there are many feature selection methods. however...