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

References (25)

  1. 1 Adaptation in Natural and Artificial Systems [DOI]
  2. 2 The International Journal of Production Research
  3. 3 International Journal of Computer Integrated Manufacturing [DOI]
  4. 4 An Effective Hybrid Heuristic for Flow Shop Scheduling [DOI]
  5. 5 Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆ [DOI]
  6. 6 Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications
  7. 7 A genetic algorithm for permutation flow shop scheduling under make to stock production system [DOI]
  8. 8 A hybrid genetic algorithm for non-permutation flow shop scheduling problems with unavailability constraints [DOI]
  9. 9 Genetic algorithm for minimizing tardiness in flow-shop scheduling [DOI]
  10. 10 Permutation flowshop scheduling to minimize the total tardiness with learning effects [DOI]
  11. 11 Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect [DOI]
  12. 12 Scheduling TV commercials using genetic algorithms [DOI]
  13. 13 Determining optimal combination of genetic operators for flow shop scheduling [DOI]
  14. 14 Heuristic rules for tardiness problem in flow shop with intermediate due dates [DOI]
  15. 15 New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times [DOI]
  16. 16 Design and Application of A New Hybrid Heuristic Algorithm for Flow Shop Scheduling [DOI]
  17. 17 A hybrid heuristic algorithm for flowshop inverse scheduling problem under a dynamic environment [DOI]
  18. 18 A Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
  19. 19 On the heuristic solution of the permutation flow shop problem by path algorithms [DOI]
  20. 20 COVERT Based Algorithms for Solving the Generalized Tardiness Flow Shop Problems
  21. 21 A Modified Genetic Algorithm for the Flow-Shop Scheduling Problem
  22. 22 The International Journal of Advanced Manufacturing Technology [DOI]
  23. 23 International Journal of Engineering Science and Technology [DOI]
  24. 24 International Journal of Computer Network and Information Security [DOI]
  25. 25 Journal of Entrepreneurship, Management and Innovation [DOI]

Cited by 4

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

Showing 2 of 4 known citations — external sources report more than can currently be individually listed.

Article metrics

Real usage data collected on this platform.

9

Page views

0

PDF downloads

0

Outbound clicks

4

Citations

Views over time

Views by country

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

Traffic sources

Referring site, by host.

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.