A genetic approach to the quadratic assignment problem
From MaRDI portal
Publication:1342320
DOI10.1016/0305-0548(93)E0020-TzbMath0812.90099MaRDI QIDQ1342320
Publication date: 11 January 1995
Published in: Computers \& Operations Research (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Genetics and epigenetics (92D10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Facility layout problem with QAP formulation under scenario-based uncertainty, An extreme point algorithm for a local minimum solution to the quadratic assignment problem, Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art, PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID, A survey for the quadratic assignment problem, Variable neighborhood search for the workload balancing problem in service enterprises, Location and layout planning. A survey, Solving the redundancy allocation problem using a combined neural network/genetic algorithm approach, Genetic and hybrid algorithms for graph coloring, Metaheuristics: A bibliography, A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem, Two-level modified simulated annealing based approach for solving facility layout problem, Global optimality conditions and optimization methods for quadratic assignment problems, Hope: A genetic algorithm for the unequal area facility layout problem., A survey of repair methods used as constraint handling techniques in evolutionary algorithms, Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem, Genetic search and the dynamic layout problem, Experimental analysis of crossover and mutation operators on the quadratic assignment problem, Mapping the convergence of genetic algorithms, A genetic algorithm for facility layout, Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing, Adaptive memory programming: a unified view of metaheuristics, A hybrid metaheuristic for the quadratic assignment problem, A new algorithm for solving a special matching problem with a general form value function under constraints, A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge, Solving an assignment-selection problem with verbal information and using genetic algorithms, Combinatorial optimization in system configuration design, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, Relative Position Indexing Approach, A greedy genetic algorithm for the quadratic assignment problem, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods, A genetic algorithm approach for regrouping service sites
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- A hybrid heuristic for the facilities layout problem
- A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- Deux problèmes d'affectation non linéaires
- A Review of the Placement and Quadratic Assignment Problems
