An enhanced genetic algorithm with a new crossover operator for the traveling tournament problem

2017 ◽  
Author(s):  
Meriem Khelifa ◽  
Dalila Boughaci ◽  
Esma Aimeur
Keyword(s):  
Genetic Algorithm ◽  
Crossover Operator ◽  
Traveling Tournament Problem

scholarly journals A GENETIC APPROACH FOR LONG TERM VIRTUAL ORGANIZATION DISTRIBUTION

2011 ◽  
Vol 20 (02) ◽  
pp. 271-295 ◽  
Author(s):  
VÍCTOR SÁNCHEZ-ANGUIX ◽  
SOLEDAD VALERO ◽  
ANA GARCÍA-FORNES
Keyword(s):  
Genetic Algorithm ◽  
Virtual Organization ◽  
Genetic Material ◽  
Multi Agent System ◽  
Crossover Operator ◽  
Agent Based ◽  
Multi Agent ◽  
Global Goal ◽  
Computational Resources

An agent-based Virtual Organization is a complex entity where dynamic collections of agents agree to share resources in order to accomplish a global goal or offer a complex service. An important problem for the performance of the Virtual Organization is the distribution of the agents across the computational resources. The final distribution should provide a good load balancing for the organization. In this article, a genetic algorithm is applied to calculate a proper distribution across hosts in an agent-based Virtual Organization. Additionally, an abstract multi-agent system architecture which provides infrastructure for Virtual Organization distribution is introduced. The developed genetic solution employs an elitist crossover operator where one of the children inherits the most promising genetic material from the parents with higher probability. In order to validate the genetic proposal, the designed genetic algorithm has been successfully compared to several heuristics in different scenarios.

scholarly journals A Modified Genetic Algorithm with Local Search Strategies and Multi-Crossover Operator for Job Shop Scheduling Problem

Sensors ◽  
2020 ◽  
Vol 20 (18) ◽  
pp. 5440 ◽  
Author(s):  
Monique Simplicio Viana ◽  
Orides Morandin Junior ◽  
Rodrigo Colnago Contreras
Keyword(s):  
Genetic Algorithm ◽  
Local Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Crossover Operator ◽  
Local Optima ◽  
Shop Scheduling ◽  
Solution Methods

It is not uncommon for today’s problems to fall within the scope of the well-known class of NP-Hard problems. These problems generally do not have an analytical solution, and it is necessary to use meta-heuristics to solve them. The Job Shop Scheduling Problem (JSSP) is one of these problems, and for its solution, techniques based on Genetic Algorithm (GA) form the most common approach used in the literature. However, GAs are easily compromised by premature convergence and can be trapped in a local optima. To address these issues, researchers have been developing new methodologies based on local search schemes and improvements to standard mutation and crossover operators. In this work, we propose a new GA within this line of research. In detail, we generalize the concept of a massive local search operator; we improved the use of a local search strategy in the traditional mutation operator; and we developed a new multi-crossover operator. In this way, all operators of the proposed algorithm have local search functionality beyond their original inspirations and characteristics. Our method is evaluated in three different case studies, comprising 58 instances of literature, which prove the effectiveness of our approach compared to traditional JSSP solution methods.

scholarly journals The Crossover Operator of a Genetic Algorithm as Applied to the Task of a Production Planning

2019 ◽  
Vol 150 ◽  
pp. 603-608 ◽  
Author(s):  
S.L. Podvalny ◽  
M.I. Chizhov ◽  
P.Y. Gusev ◽  
K.Y. Gusev
Keyword(s):  
Genetic Algorithm ◽  
Production Planning ◽  
Crossover Operator

Push-n-Pop Genes Xchange (PPX)—A New Crossover Operator in Genetic Algorithm

2019 ◽  
Vol 16 (8) ◽  
pp. 3478-3482
Author(s):  
Joe G. Lagarteja
Keyword(s):  
Genetic Algorithm ◽  
Population Size ◽  
Crucial Role ◽  
Processing Time ◽  
Critical Factor ◽  
Crossover Operator ◽  
Maximum Improvement ◽  
Population Sizes

Crossover operator plays a crucial role in of Genetic Algorithm (GA). It is one of the key elements in GA which is responsible for producing offsprings usually called “solutions” by way of recombining information from two parents providing experimental mechanism of the algorithm. Crossover operator is a critical factor that affects performance of GA due to its impact on time being used in the crossover process. This paper introduces a new crossover operator named Push-n-Pop Genes Xchange Operator (PPX). Evaluation of its performance in terms of processing time is also presented in this paper. The results of PPX’s performance with all other six existing GA’s crossover operators (Half-uniform, Surrogate, Segmented, Shuffle, Two-point, and Uniform) show that PPX is in comparable using different population sizes 30, 50, and 100. Results also show that the new crossover operator performed better with a maximum improvement of 13.1% when population size was gradually increased from 30 to 100.

Solving Steel-Making and Continuous-Casting Scheduling Problem with Fuzzy Processing and Delivery Time Using Genetic Algorithm

2010 ◽  
Vol 139-141 ◽  
pp. 1679-1683 ◽  
Author(s):  
Hong Bing Wang ◽  
Ai Jun Xu ◽  
Dong Feng He
Keyword(s):  
Genetic Algorithm ◽  
Continuous Casting ◽  
Production Scheduling ◽  
Scheduling Problem ◽  
Test Results ◽  
Delivery Time ◽  
Crossover Operator ◽  
Improved Genetic Algorithm ◽  
Steel Making ◽  
Early Maturing

The real production scheduling problem between steel-making and continuous-casting can be modeled as JSSP with fuzzy processing and delivery time. An improved genetic algorithm is proposed for solving this problem and the improved aspects include the mechanism for preventing early-maturing and the job filter order-based crossover operator. The test results show that the improved genetic algorithm can find better solutions than other three algorithms. A real production scheduling problem of steel-making and continuous-casting is computed using the improved genetic algorithm and it shows the algorithm is effective.

An Improved Constrained Optimization Multi-Objective Genetic Algorithm and its Application in Engineering

2014 ◽  
Vol 962-965 ◽  
pp. 2903-2908
Author(s):  
Yun Lian Liu ◽  
Wen Li ◽  
Tie Bin Wu ◽  
Yun Cheng ◽  
Tao Yun Zhou ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Constrained Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Crossover Operator ◽  
Multi Objective Optimization ◽  
Constrained Optimization Problem ◽  
Great Ability ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm

An improved multi-objective genetic algorithm is proposed to solve constrained optimization problems. The constrained optimization problem is converted into a multi-objective optimization problem. In the evolution process, our algorithm is based on multi-objective technique, where the population is divided into dominated and non-dominated subpopulation. Arithmetic crossover operator is utilized for the randomly selected individuals from dominated and non-dominated subpopulation, respectively. The crossover operator can lead gradually the individuals to the extreme point and improve the local searching ability. Diversity mutation operator is introduced for non-dominated subpopulation. Through testing the performance of the proposed algorithm on 3 benchmark functions and 1 engineering optimization problems, and comparing with other meta-heuristics, the result of simulation shows that the proposed algorithm has great ability of global search. Keywords: multi-objective optimization;genetic algorithm;constrained optimization problem;engineering application

Sign in / Sign up

Export Citation Format

Share Document