scispace - formally typeset
Journal ArticleDOI

Efficient implementation of heuristic algorithms for the quadratic assignment problem

Marc Los
- 01 May 1980 - 
- Vol. 20, Iss: 2, pp 247-260
About
This article is published in Journal of Regional Science.The article was published on 1980-05-01. It has received 5 citations till now. The article focuses on the topics: Generalized assignment problem & Weapon target assignment problem.

read more

Citations
More filters
Journal ArticleDOI

Heuristic methods and applications: A categorized survey

TL;DR: An extensive search of journal publications on heuristic methods and applications produced 442 articles published in 37 journals during the last sixteen years, with some interesting historical patterns and directions for future work revealed.
Journal ArticleDOI

Spatial allocation on a network with congestion

TL;DR: In this article, the authors formalized the land use design problem as a discrete-convex programming problem integrating within a quadratic assignment framework a realistic representation of transportation behavior (automobile congestion and variable demand for travel) as modelled by a combined trip distribution trip assignment model.
Posted Content

Spatial Allocation on a Network with Congestion

TL;DR: In this article, the authors formalized the land use design problem as a discrete-convex programming problem integrating within a quadratic assignment framework a realistic representation of transportation behavior (automobile congestion and variable demand for travel) as modelled by a combined trip distribution trip assignment model.
Journal ArticleDOI

Inférence Statistique Et Problémes D’Optimisation Combinatoire De Grande Taille*

Christian Lardinois
- 01 May 1982 - 
TL;DR: In this paper, an iterative stopping rule is proposed to rationally determine the size of successive samples of local optima that a hill-climbing procedure must generate until some stopping conditions are met.
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

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.