Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm
Article Abstract:
A double-loop genetic algorithm was utilized to resolve the problem of creating manufacturing cells for products with multiple routings. The algorithm works by offering a method that generate efficient solutions for the multiple route bicriterion cell formation problem. It permits the user to establish efficient set of solutions, particularly set of non-dominated solutions.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
Electronic computers, Electronic Computer Manufacturing, Research and Development in the Physical, Engineering, and Life Sciences, Mathematics, Flexible Manufacturing Systems, Research, Analysis, Algorithms, Optimization theory, Mathematical programming
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
Ensuring population diversity in genetic algorithms: a technical note with application to the cell formation problem
Article Abstract:
A study on calculation of population diversity problems, using genetic algorithms, is presented.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2007
United States, Canada, Management dynamics, Management, Usage, Measurement, Company business management, Population density, Genetic algorithms
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2007
User Contributions:
Comment about this article or add new information about this topic:
Subjects list: Manufacturing cells
Similar abstracts:
- Abstracts: Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings. Inventory rationing via drop-shipping in Internet retailing: a sensitivity analysis
- Abstracts: Scatter search for the vehicle routing problem with time windows
- Abstracts: Scatter search for the vehicle routing problem with time windows. part 2 A variable neighborhood decomposition search method for supply chain management planning problems
- Abstracts: DEA-discriminant analysis in the view of goal programming. Extended DEA-discriminant analysis. DEA-Discriminant Analysis: methodological comparison among eight discriminant analysis approaches
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.