Journal ArticleDOI
Numerical investigations on quadratic assignment problems
Reads0
Chats0
TLDR
In this article, a comparative study of the numerical behavior of different algorithms for solving quadratic assignment problems is presented, where branch and bound algorithms are briefly discussed and starting procedures are described and compared by means of numerical results.Abstract:
This paper contains a comparative study of the numerical behavior of different algorithms for solving quadratic assignment problems. After the formulation of the problem, branch and bound algorithms are briefly discussed. Then, starting procedures are described and compared by means of numerical results. Modifications of branch and bound procedures for obtaining good suboptimal solutions are treated in the next section. Subsequently, numerical results with the Gaschutz-Ahrens algorithm are reported. In the last section, exchange algorithms are discussed, and it is pointed out how they can be combined efficiently with the Gaschutz-Ahrens procedure and the perturbation method. All suboptimal solutions found in the literature could be improved by these combined methods. In the appendix, test examples and the best known solutions are listed.read more
Citations
More filters
Journal ArticleDOI
A survey for the quadratic assignment problem
Eliane Maria Loiola,Nair Maria Maia de Abreu,Paulo Oswaldo Boaventura-Netto,Peter M. Hahn,Tania Maia Querido +4 more
TL;DR: This paper presents some of the most important QAP formulations and classify them according to their mathematical sources and gives a detailed discussion of the progress made in both exact and heuristic solution methods, including those formulated according to metaheuristic strategies.
Journal ArticleDOI
The facility layout problem
TL;DR: Various formulations of the facility layout problem and the algorithms for solving this problem are presented and Twelve heuristic algorithms are compared on the basis of their performance with respect to eight test problems commonly used in the literature.
Journal ArticleDOI
Quadratic Assignment Problems
TL;DR: The quadratic assignment problem (QAP) as discussed by the authors is a generalization of the problem of finding the minimum walking distance of a person from a building to another building for a given set of possible sites.
Journal ArticleDOI
Solving Quadratic Assignment Problems by ‘Simulated Annealing’
TL;DR: An application of the simulated annealing method to solve the quadratic assignment problem (QAP) is presented, which uses Monte Carlo sampling to occasionally accept solutions to discrete optimization problems which increase rather than decrease the objective function value.
Journal ArticleDOI
Simulated annealing heuristics for the dynamic facility layout problem
TL;DR: This paper considers the problem of arranging and rearranging manufacturing facilities such that the sum of the material handling and rearrangement costs is minimized and develops two simulated annealing heuristics for the dynamic facility layout problem.
References
More filters
Journal ArticleDOI
The Quadratic Assignment Problem
TL;DR: In this article, the equivalence of the Koopmans-beckmann problem to a linear assignment problem with certain additional constraints is demonstrated, and a method for calculating a lower bound on the cost function is presented, and this forms the basis for an algorithm to determine optimal solutions.
Journal ArticleDOI
A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities
Gordon C. Armour,Elwood S. Buffa +1 more
TL;DR: A computer program governed by an algorithm which determines how relative location patterns should be altered to obtain sequentially the most improved pattern with each change, commands their alteration, evaluates the results of alterations, and identifies the sub-optimumrelative location patterns.
Journal ArticleDOI
An Experimental Comparison of Techniques for the Assignment of Facilities to Locations
TL;DR: The new Biased Sampling procedure is seen to produce the best solutions but at relatively high computational cost, and the Hillier-Connors procedure is especially interesting because it is considerably faster than craft and BiASED Sampling and its solutions are only 2–6 per cent worse than BiasedSampling and only slightly worse than craft.
Journal ArticleDOI
Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
TL;DR: A recent article by Steinberg as discussed by the authors describes a suboptimal procedure for solving the backboard wiring problem, which is a generalization of the quadratic assignment problem in the more general form in which it was discussed by Koopmans and Beckmann [2].