Simulated annealing for machine layout problems in the presence of zoning constraints
Article Abstract:
Zoning constraints encountered in the quadratic assignment problem (QAP) are taken into consideration by two proposed extended formulations of the QAP based on simulated annealing (SA) heuristic algorithms.The SA algorithms presented are the Compulsion method, which takes into account zoning constraints for new layouts, and the Penalty method, which considers zoning constraints in the objective function using penalty terms. TheCompulsion method is more efficient and effective than the Penalty method. On the other hand, the Penalty method is more adaptable to problems involving additional zoning constraints.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
Experimental analysis of simulated annealing based algorithms for the layoutproblem
Article Abstract:
The 2-way and 3-way exchange algorithms, a modified penalty (MP) algorithm, the simulated annealing (SA) algorithm and a hybrid simulated annealing (HSA) algorithm are compared throughapplications on over 850 facility layout problems. Results of the computations show that the HSA algorithm produced better solutions for single-row and equal-area multi-row layout problems than the other algorithms. Solutions usingthe SA algorithm approximated the results using the HSA with increased annealing runs. However, the HSA required more computational and computer time than the SA.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
Recent models and techniques for solving the layout problem
Article Abstract:
The ABSMODEL for both single-row and multi-row layouts is presented as an alternative to traditionally used quadratic assignment problem models for manufacturing systems. Seven heuristic algorithms used to solve facility layoutmodelling problems are also presented. Analysis of the algorithms shows that solving layout problems should consider factors such as machine shapes, clearance between machines, station locations and flow network design and cellular manufacturing systems.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: The Benelux market for textile washing products. The French market for household cleaning agents. Household Cleaning Products in Belgium
- Abstracts: Not such a balanced outcome: coping with a hung parliament. The importance of being Labour
- Abstracts: New plan looks for balance. Risky business: labour activist alleges government pressure. Where has all the labour gone
- Abstracts: Dynamic layout design given a scenario tree of probable futures. Flow network design for manufacturing systems layout