An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem (Q1736634)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem
scientific article

    Statements

    An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 March 2019
    0 references
    Summary: The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence to design the strategy of local searching and an extremal optimization in information exchange. The computational result shows that the proposed algorithm has a powerful search capability in solving the flexible job shop scheduling problem compared with other heuristic algorithms, such as the genetic algorithm, tabu search and ant colony optimization. Moreover, the results also show that the improved strategies could improve the performance of the algorithm effectively.
    0 references
    shuffled frog-leaping algorithm
    0 references
    flexible job shop scheduling problem
    0 references
    local search
    0 references
    extremal optimization
    0 references

    Identifiers