Genetic algorithm for linear and cyclic assignment problem
From MaRDI portal
Publication:2367417
DOI10.1016/0305-0548(93)90113-WzbMath0771.90061OpenAlexW1982214473MaRDI QIDQ2367417
J. Rubinovitz, Gregory Levitin
Publication date: 10 August 1993
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(93)90113-w
Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
A genetic algorithm approach to curve fitting ⋮ Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
Cites Work
- Unnamed Item
- A new heuristic for the linear placement problem
- A parallel heuristic for quadratic assignment problems
- The Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Using simulated annealing to solve routing and location problems
- P-Complete Approximation Problems
- Algorithm for tool placement in an automatic tool change magazine
- A Review of the Placement and Quadratic Assignment Problems
This page was built for publication: Genetic algorithm for linear and cyclic assignment problem