Tabu Search Applied to the Quadratic Assignment Problem

From MaRDI portal
Revision as of 02:02, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4021363

DOI10.1287/IJOC.2.1.33zbMath0752.90054OpenAlexW2016688797MaRDI QIDQ4021363

Jadranka Skorin-Kapov

Publication date: 16 January 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2.1.33




Related Items (99)

Taking advantage of symmetry in some quadratic assignment problemsAn extreme point algorithm for a local minimum solution to the quadratic assignment problemA user's guide to tabu searchAn introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu searchHashing vectors for tabu searchPart type selection problem in flexible manufacturing systems: Tabu search algorithmsMassively parallel tabu search for the quadratic assignment problemA tabu search procedure for multicommodity location/allocation with balancing requirementsLarge-scale layout of facilities using a heuristic hybrid algorithmLower bounds for the quadratic assignment problemCombinatorial optimization techniques for spacecraft scheduling automationA tabu search procedure for the resource constrained project scheduling problem with discounted cash flowsExtensions of a tabu search adaptation to the quadratic assignment problemApplying tabu search with influential diversification to multiprocessor schedulingA study of diversification strategies for the quadratic assignment problemGenetic algorithms and tabu search: Hybrids for optimizationA new exact algorithm for the solution of quadratic assignment problemsFITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLESFast local search for single row facility layoutA survey for the quadratic assignment problemTabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systemsComparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing RatesA molecular structure matching problemTabu search vs. simulated annealing as a function of the size of quadratic assignment problem instancesVariable neighborhood search for the workload balancing problem in service enterprisesA nonmonotone GRASPHeuristics for the generalised assignment problem: Simulated annealing and tabu search approachesSolving the damper placement problem via local search heuristicsA modification of threshold accepting and its application to the quadratic assignment problemFast simulated annealing for single-row equidistant facility layoutLocation and layout planning. A surveyParallel genetic algorithms with local searchDiversification strategies in tabu search algorithms for the maximum clique problemTabu search for graph partitioningA tabu search algorithm for frequency assignmentMetaheuristics: A bibliographyBacktracking of jobs in one-dimensional machine location problemsA hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problemModelling constant weight codes using tabu searchAlgodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problemTabu search for the BWC problemHeuristics for biquadratic assignment problems and their computational comparisonComparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problemFlexible job-shop scheduling with transportation resourcesA branch-and-bound algorithm for the single-row equidistant facility layout problemHope: A genetic algorithm for the unequal area facility layout problem.Unnamed ItemAn improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminalExtensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problemTabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup timesDiscrete-continuous project scheduling with discounted cash flows - a tabu search approachTabu search for discrete-continuous scheduling problems with heuristic continuous resource allocationRecent models and techniques for solving the layout problemExperimental analysis of simulated annealing based algorithms for the layout problemSimulated annealing for machine layout problems in the presence of zoning constraintsMapping the convergence of genetic algorithmsA connectionist approach to the quadratic assignment problemGood solutions to discrete noxious location problems via metaheuristicsAvoiding local optima in the \(p\)-hub location problem using tabu search and GRASPComparison of the performance of modern heuristics for combinatorial optimization on real dataGenerating quadratic assignment test problems with known optimal permutationsEmbedding signed graphs in the lineImproved tabu search heuristics for the dynamic space allocation problemSelected topics on assignment problemsOptimization of cube-per-order index warehouse layouts with zoning constraintsSimulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment modelsA combined global and local search method to deal with constrained optimization for continuous tabu searchA genetic algorithm and queuing theory based methodology for facilities layout problemIterated local search for the quadratic assignment problemQuadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu searchUnnamed ItemA linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matricesLower bounds based on linear programming for the quadratic assignment problemSolving the failure-to-fit problem for plant layout: By changing department shapes and sizesA neural network approach to facility layout problemsMassively parallel analog tabu search using neural networks applied to simple plant location problemsOptimizing simulated annealing schedules with genetic programmingThe single-finger keyboard layout problemThe life span method -- a new variant of local searchCombinatorial optimization in system configuration designA low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problemAn efficient tabu search procedure for the \(p\)-median problemDriving tabu search with case-based reasoningSimulated annealing and tabu search for multi-mode project payment schedulingA greedy genetic algorithm for the quadratic assignment problemHeuristics for the dynamic facility layout problem with unequal-area departmentsA tabu search heuristic for the dynamic space allocation problemUsing tabu search to schedule activities of stochastic resource-constrained projectsDigital data networks design using genetic algorithmsAn improved tabu search heuristic for solving facility layout design problemsA novel chaotic search for quadratic assignment problemsA heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespanTabu list management methods for a discrete-continuous scheduling problemQAPLIB-A quadratic assignment problem libraryA new global approach for \(0\)-\(1\) polynomial programsIntelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulationGlobal optimization for artificial neural networks: A tabu search applicationRecent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methodsA tabu search algorithm for assigning teachers to courses.







This page was built for publication: Tabu Search Applied to the Quadratic Assignment Problem