๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new greedy algorithm for the quadratic assignment problem

โœ Scribed by Theodoros P. Gevezes, Leonidas S. Pitsoulis

Book ID
118815452
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
463 KB
Volume
7
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Greedy On-Line Algorithm for thek-Trac
A Greedy On-Line Algorithm for thek-Track Assignment Problem
โœ U Faigle; W Kern; W.M Nawijn ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 107 KB

Given a collection I I of n jobs that are represented by intervals, we seek a maximal feasible assignment of the jobs to k machines such that not more than ลฝ . c M intervals overlap pairwise on any machine M and that a job is only assigned to a machine if it fits into one of several prescribed time

An improved hybrid genetic algorithm: ne
An improved hybrid genetic algorithm: new results for the quadratic assignment problem
โœ Alfonsas Misevicius ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 229 KB

In this paper, we propose an improved hybrid genetic algorithm (IHGA). It uses a robust local improvement procedure as well as an effective restart mechanism that is based on so-called 'shift mutations'. IHGA has been applied to the well-known combinatorial optimization problem, the quadratic assign