An improved annealing scheme for the QAP

DOI10.1016/0377-2217(90)90301-QzbMATH Open0715.90079OpenAlexW1979142433MaRDI QIDQ752002FDOQ752002

David T. Connolly

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90301-q

zbMATH Keywords

simulated annealingheuristicsquadratic assignment

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• A Monte Carlo simulated annealing approach to optimization over continuous variables
• Optimization by Simulated Annealing
• Equation of State Calculations by Fast Computing Machines
• Convergence of an annealing algorithm
• The Backboard Wiring Problem: A Placement Algorithm
• Hospital Layout as a Quadratic Assignment Problem
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• Quadratic assignment problems
• A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
• An Improved Heuristic for the Quadratic Assignment Problem
• The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies

Cited In (73)

• Recovering the QNEC from the ANEC
• Title not available (Why is that?)
• Embedding signed graphs in the line
• Parallel hybrid genetic algorithms for solving Q3AP on computational grid
• Forward Backward Transformation
• A deep reinforcement learning assisted simulated annealing algorithm for a maintenance planning problem
• A New Neighborhood for the QAP
• Minimizing grid capacity in preemptive electric vehicle charging orchestration: complexity, exact and heuristic approaches
• A mathematical model for zoning of protected natural areas
• A landscape-based analysis of fixed temperature and simulated annealing
• On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
• A cutoff time strategy based on the coupon collector's problem
• Review on nature-inspired algorithms
• A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
• Identification of effective implementations of simulated annealing for optimizing thinning schedules for single forest stands
• A new and practical heuristic for Master Production Scheduling creation
• Hybrid Metaheuristics: An Introduction
• Selected topics on assignment problems
• Solving multi objective facility layout problem by modified simulated annealing
• Simulated annealing applied to the process allocation problem
• Revisiting simulated annealing: a component-based analysis
• On the landscape ruggedness of the quadratic assignment problem
• An analysis of parallel heuristics for task allocation in multicomputers
• A new multi-objective optimization method for master production scheduling problems using simulated annealing
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• Optimization of the quadratic assignment problem using an ant colony algorithm
• The quadratic assignment problem in the context of the printed circuit board assembly process
• A survey for the quadratic assignment problem
• Large-scale layout of facilities using a heuristic hybrid algorithm
• An improved tabu search heuristic for solving facility layout design problems
• A connectionist approach to the quadratic assignment problem
• On the classification of NP-complete problems in terms of their correlation coefficient
• An improved annealing method and its large-time behavior
• The multi-story space assignment problem
• Applied simulated annealing
• Simulated Annealing with a Temperature Dependent Penalty Function
• Formulating and solving production planning problems
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
• Guided local search and its application to the traveling salesman problem
• Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
• Optimizing simulated annealing schedules with genetic programming
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• The single-finger keyboard layout problem
• Location and layout planning. A survey
• Heuristics for biquadratic assignment problems and their computational comparison
• Variable neighborhood search for the workload balancing problem in service enterprises
• Some experiments with simulated annealing techniques for packing problems
• An algorithm for quadratic assignment problems
• A systematic procedure for setting parameters in simulated annealing algorithms
• Mapping the convergence of genetic algorithms
• Experimental analysis of simulated annealing based algorithms for the layout problem
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
• Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
• Simulated annealing procedures for forming machine cells in group technology
• Simulated annealing: A tool for operational research
• Fractional factorial analysis to the configuration of simulated annealing applied to the multi-objective optimization of master production scheduling problems
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
• Title not available (Why is that?)
• Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
• Two-level modified simulated annealing based approach for solving facility layout problem
• Unrelated parallel machine scheduling using local search
• The quadratic three-dimensional assignment problem: exact and approximate solution methods
• Adaptive memory programming: a unified view of metaheuristics
• Iterated local search for the quadratic assignment problem
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
• A hybrid metaheuristic for the quadratic assignment problem
• Metaheuristics: A bibliography
• A semi-infinite programming model for earliness/tardiness production planning with simulated annealing
• Optimization of cube-per-order index warehouse layouts with zoning constraints
• Effective formulation reductions for the quadratic assignment problem

   Recommendations

• Title not available (Why is that?) 👍 👎
• An improved annealing method and its large-time behavior 👍 👎
• The potential of quantum annealing for rapid solution structure identification 👍 👎
• Enhancing quantum annealing performance for the molecular similarity problem 👍 👎
• An improved noise quantum annealing method for TSP 👍 👎
• A renormalization approach to quantum thermal annealing 👍 👎
• Correction to: ``The potential of quantum annealing for rapid solution structure identification 👍 👎
• An improved variant of simulated annealing that converges under fast cooling 👍 👎
• Quantum annealing learning search for solving QUBO problems 👍 👎

This page was built for publication: An improved annealing scheme for the QAP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q752002)