English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

genetic algorithm is a common method for solving combinatorial optimization problems and the selection of crossover operators in genetic algorithm will directly affect the performance of the algorithm. In this paper, we compare the performance of three crossover operators, partially mapped crossover operator (PMX), order based crossover operator (OBX), and adaptation of the edge recombination crossover operator (aERX), under same genetic algorithm framework in solving the un-weighted single machine scheduling problem with sequence dependent setup times. It is concluded that the performance of PMX crossover operator is better than the other two crossover operators from the computational results.

The study of comparisons of three crossover operators in genetic algorithm for solving single machine scheduling problem