Experimental analysis of crossover and mutation operators on the quadratic assignment problem
From MaRDI portal
Publication:513133
DOI10.1007/s10479-015-1848-yzbMath1357.90071OpenAlexW2012528241MaRDI QIDQ513133
Publication date: 3 March 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1848-y
quadratic assignment problemNP-hardgenetic algorithmadaptive mutationsequential constructive crossover
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (4)
Facility layout problem with QAP formulation under scenario-based uncertainty ⋮ Biologically inspired parent selection in genetic algorithms ⋮ Directional approach to gradual cover: the continuous case ⋮ A novel fused optimization algorithm of genetic algorithm and ant colony optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Iterative approximation of a common solution of a split generalized equilibrium problem and a fixed point problem for nonexpansive semigroup
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- The quadratic assignment problem in the context of the printed circuit board assembly process
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- The ``molecular traveling salesman
- A genetic approach to the quadratic assignment problem
- QAPLIB - a quadratic assignment problem library
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
- Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem
- A greedy genetic algorithm for the quadratic assignment problem
- Multi-parent extension of sequential constructive crossover for the travelling salesman problem
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- Applying an extended guided local search to the quadratic assignment problem
- A New Genetic Algorithm for the Quadratic Assignment Problem
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- P-Complete Approximation Problems
- Hospital Layout as a Quadratic Assignment Problem
- Comparison of iterative searches for the quadratic assignment problem
- Evolutionary Computation in Combinatorial Optimization
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
This page was built for publication: Experimental analysis of crossover and mutation operators on the quadratic assignment problem
