Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison
Publication:1900271
DOI10.1016/0895-7177(95)00092-GzbMath0833.90052OpenAlexW2056095689MaRDI QIDQ1900271
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
travelling salesmangroup technologyparallel genetic algorithmssimilarity coefficientsmanufacturing cellscomponent routings
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Production models (90B30) Parallel numerical computation (65Y05)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large-scale 0-1 linear programming on distributed workstations
- A graph partitioning procedure for machine assignment and cell formation in group technology†
- An ideal seed non-hierarchical clustering algorithm for cellular manufacturing
- Machine-component cell formation in group technology: a neural network approach
- Parallel Genetic Algorithms Applied to the Traveling Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
- Problem Decomposition and Data Reorganization by a Clustering Technique
This page was built for publication: Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison