Skip to content
Research Article Open access CC BY 4.0

Improving Performance of GAs by Use of Selective Breading Evolutionary Process

Farhad Ghassemi-Tari, Sareh Meshkinfam

Journal of Advances in Mathematics and Computer Science · pp. 1–21 · Published 1 Jun 2017

10.9734/BJMCS/2017/33498

Abstract

In this paper, the use of selective breading evolutionary process for improving the performance of GAs is evaluated. To accomplish this evaluation, the generalized tardiness flow shop scheduling (GTFS) problem is designated. A natural evolutionary GA and two selective breeding Gas are developed for evaluating their performances in solving the proposed problem. An extensive numerical experiment on total of 2250 randomly generated scenarios is conducted to compare the effects of selective breeding mechanism. The effects of the varieties factors on the solution of the algorithms are analyzed by the factorial ANOVA. The computational results reveal that a significant improvement can be obtained if one employs an initial population with better genes.

Scheduling sequencing natural breading GA selective breeding GA generalized tardiness flow shop

Cited by 2

Three hybrid GAs for discounted fixed charge transportation problems

Farhad Ghassemi Tari, Zhrasadat Hashemi · Cogent Engineering · 2018

Prioritized K-mean clustering hybrid GA for discounted fixed charge transportation problems

Farhad Ghassemi Tari, Zahrasadat Hashemi · Computers & Industrial Engineering · 2018

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

2

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.