An improved annealing scheme for the QAP
From MaRDI portal
Publication:752002
DOI10.1016/0377-2217(90)90301-QzbMath0715.90079MaRDI QIDQ752002
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C10: Integer programming
90C20: Quadratic programming
90C27: Combinatorial optimization
90B80: Discrete location and assignment
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Optimization of cube-per-order index warehouse layouts with zoning constraints, A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem, A mathematical model for zoning of protected natural areas, A new multi-objective optimization method for master production scheduling problems using simulated annealing, A new and practical heuristic for Master Production Scheduling creation, On the landscape ruggedness of the quadratic assignment problem, Adaptive memory programming: a unified view of metaheuristics, Selected topics on assignment problems, Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing, 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 survey for the quadratic assignment problem, Optimization of the quadratic assignment problem using an ant colony algorithm, Simulated annealing: A tool for operational research, Mapping the convergence of genetic algorithms, Effective formulation reductions for the quadratic assignment problem, The single-finger keyboard layout problem, Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge, Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem, An algorithm for quadratic assignment problems, Experimental analysis of simulated annealing based algorithms for the layout problem, Simulated annealing applied to the process allocation problem, Optimizing simulated annealing schedules with genetic programming, Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism, Some experiments with simulated annealing techniques for packing problems, Simulated annealing procedures for forming machine cells in group technology, Large-scale layout of facilities using a heuristic hybrid algorithm, Unrelated parallel machine scheduling using local search, Location and layout planning. A survey, A semi-infinite programming model for earliness/tardiness production planning with simulated annealing, An analysis of parallel heuristics for task allocation in multicomputers, Heuristics for biquadratic assignment problems and their computational comparison, A systematic procedure for setting parameters in simulated annealing algorithms, Improvement heuristics for the vehicle routing problem based on simulated annealing, Formulating and solving production planning problems, Guided local search and its application to the traveling salesman problem, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Metaheuristics: A bibliography, On the classification of NP-complete problems in terms of their correlation coefficient, The quadratic three-dimensional assignment problem: exact and approximate solution methods, Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem, Iterated local search for the quadratic assignment problem, A hybrid metaheuristic for the quadratic assignment problem, Simulated annealing and genetic algorithms for scheduling products with multi-level product structure, Fractional factorial analysis to the configuration of simulated annealing applied to the multi-objective optimization of master production scheduling problems, Two-level modified simulated annealing based approach for solving facility layout problem, Forward Backward Transformation, An improved tabu search heuristic for solving facility layout design problems
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Quadratic assignment problems
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- A Monte Carlo simulated annealing approach to optimization over continuous variables
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- The Backboard Wiring Problem: A Placement Algorithm
- An Improved Heuristic for the Quadratic Assignment Problem
- Convergence of an annealing algorithm
- The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies
- Hospital Layout as a Quadratic Assignment Problem
- Equation of State Calculations by Fast Computing Machines
