Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison

DOI10.1016/0895-7177(95)00092-GMaRDI QIDQ1900271zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 18 March 1996

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0895-7177(95)00092-g

zbMATH Keywords

travelling salesmangroup technologyparallel genetic algorithmssimilarity coefficientsmanufacturing cellscomponent routings

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Production models (90B30)

Recommendations

• A parallel genetic algorithm for dynamic cell formation in cellular manufacturing systems
• A new branch and bound-enhanced genetic algorithm for the manufacturing cell formation problem
• A genetic algorithm for manufacturing cell formation with multiple routes and multiple objectives
• A genetic algorithm for cellular manufacturing design and layout
• Genetic algorithm approach for integrating cell formation with machine layout and cell layout
• Cell formation in manufacturing systems through simulated annealing: An experimental evaluation
• Improved similarity coefficient and clustering algorithm for cell formation in cellular manufacturing systems
• Tabu search approach based on a similarity coefficient for cell formation in generalized group technology
• Tabu search‐based approach to multi‐objective machine‐part cell formation

Cites work

• scientific article; zbMATH DE number 4104744 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A graph partitioning procedure for machine assignment and cell formation in group technology†
• An ideal seed non-hierarchical clustering algorithm for cellular manufacturing
• Computer Solutions of the Traveling Salesman Problem
• Large-scale 0-1 linear programming on distributed workstations
• Machine-component cell formation in group technology: a neural network approach
• Parallel Genetic Algorithms Applied to the Traveling Salesman Problem
• Problem Decomposition and Data Reorganization by a Clustering Technique

Cited in

(7)

• Solving a two-agent single-machine scheduling problem considering learning effect
• Seriation and matrix reordering methods: An historical overview
• Cell formation problem with consideration of both intracellular and intercellular movements
• Metaheuristics: A bibliography
• Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm
• Risk transportation via a clique number problem formulation.
• A parallel genetic algorithm for dynamic cell formation in cellular manufacturing systems

This page was built for publication: Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900271)