Machine cell formation: using genetic algorithm-based heuristic considering alternative route (Q2627620)

From MaRDI portal
Revision as of 10:22, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Machine cell formation: using genetic algorithm-based heuristic considering alternative route
scientific article

    Statements

    Machine cell formation: using genetic algorithm-based heuristic considering alternative route (English)
    0 references
    0 references
    0 references
    31 May 2017
    0 references
    Summary: In this paper, genetic algorithm-based heuristic is proposed to solve the cell formation problem. The proposed algorithm selects the optimum part route with certain set of machines before clustering the machine cell. A heuristic is applied within the genetic algorithm for assignment of parts to independent cell. Further, trade-off between part inter-cell movement and machine duplication is permitted to optimise the machine cell design. The proposed model simultaneously considers relevant production data such as production volume, alternative part process route, operation sequence and process time. Conventional optimisation method for the optimal cell formation problem requires significant amount of time and large memory space. Hence, a genetic algorithm-based heuristic method has been developed for solving the proposed model. To evaluate the computational performance of the proposed approach, the algorithm is tested on four benchmark problems collected from literature. The results approve the effectiveness of the proposed method in the manufacturing cell formation.
    0 references
    cellular manufacturing
    0 references
    operation sequences
    0 references
    alternative routing
    0 references
    genetic algorithms
    0 references
    machine cell formation
    0 references
    manufacturing cells
    0 references
    cell design
    0 references
    production volume
    0 references
    process time
    0 references
    optimisation
    0 references

    Identifiers