Proposed Selection Technique of Evolutionary Algorithm and its implementation for Combinatorial Problems

The present paper proposed new selection techniques of the evolutionary algorithm. The nature of the evolutionary algorithm is probabilistic and randomized. Evolutionary algorithm work on Charles Darwin's principle of natural selection. This algorithm can be applied to various optimization prob...

Full description

Saved in:
Bibliographic Details
Main Authors: Kumar, Rajiv, Memoria, Minakshi
Format: Conference Proceeding
Language:English
Subjects:
Biological cells
Combinatorial Problems
Evolutionary algorithm
Evolutionary computation
Genetic algorithms
NP-hard
Processor scheduling
Scheduling
Sociology
Statistics
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The present paper proposed new selection techniques of the evolutionary algorithm. The nature of the evolutionary algorithm is probabilistic and randomized. Evolutionary algorithm work on Charles Darwin's principle of natural selection. This algorithm can be applied to various optimization problems, such as scheduling, traveling salesman problems, Routing problems, or combinatorial problems. Evolutionary algorithms include Genetic algorithm, Memetic algorithm. The performance of the evolutionary algorithm depends upon its operators, such as selection techniques, crossover operators, mutation operator, and its parameter setting. The main focus of this paper is selection techniques. The proposed algorithm has been successfully implemented for the CPU scheduling problem. Experimental results show better results.
ISSN:2642-7354
DOI:10.1109/ICACCM50413.2020.9213063