Diversity controlling genetic algorithm for order acceptance and scheduling problem (Q1718199)

From MaRDI portal
Revision as of 02:22, 18 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Diversity controlling genetic algorithm for order acceptance and scheduling problem
scientific article

    Statements

    Diversity controlling genetic algorithm for order acceptance and scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: Selection and scheduling are an important topic in production systems. To tackle the order acceptance and scheduling problem on a single machine with release dates, tardiness penalty, and sequence-dependent setup times, in this paper a diversity controlling genetic algorithm (DCGA) is proposed, in which a diversified population is maintained during the whole search process through survival selection considering both the fitness and the diversity of individuals. To measure the similarity between individuals, a modified Hamming distance without considering the unaccepted orders in the chromosome is adopted. The proposed DCGA was validated on 1500 benchmark instances with up to 100 orders. Compared with the state-of-the-art algorithms, the experimental results show that DCGA improves the solution quality obtained significantly, in terms of the deviation from upper bound.
    0 references

    Identifiers