A greedy genetic algorithm for the quadratic assignment problem

From MaRDI portal
Publication:1577374

DOI10.1016/S0305-0548(99)00067-2zbMath0970.90067OpenAlexW1989938457WikidataQ59592586 ScholiaQ59592586MaRDI QIDQ1577374

James B. Orlin, Ravindra K. Ahuja, Ashish Kumar Tiwari

Publication date: 4 September 2000

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00067-2



Related Items

A multi-parent genetic algorithm for the quadratic assignment problem, Facility layout problem with QAP formulation under scenario-based uncertainty, An efficient algorithm for unequal area facilities layout planning with input and output points, SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration, The extended concentric tabu for the quadratic assignment problem, A survey for the quadratic assignment problem, Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems, A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem, Solving a multi-objective interval crew-scheduling problem via genetic algorithms, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Two-level modified simulated annealing based approach for solving facility layout problem, Initialization of metaheuristics: comprehensive review, critical analysis, and research directions, Program trace optimization with constructive heuristics for combinatorial problems, A parallel water flow algorithm with local search for solving the quadratic assignment problem, A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network, Hybridizations of evolutionary algorithms with large neighborhood search, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal, Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem, Constrained evolutionary computing approach to Web service compositions, Experimental analysis of crossover and mutation operators on the quadratic assignment problem, Mapping the convergence of genetic algorithms, Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm, Selected topics on assignment problems, Compounded genetic algorithms for the quadratic assignment problem, The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm, Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem, Effective formulation reductions for the quadratic assignment problem, Interactive evolutionary multi-objective optimization for quasi-concave preference functions, DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM, An ejection chain algorithm for the quadratic assignment problem, A hybrid metaheuristic for the quadratic assignment problem, Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems, A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge, Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods, Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks


Uses Software


Cites Work