A modification of threshold accepting and its application to the quadratic assignment problem

DOI10.1007/BF01719267zbMath0842.90092MaRDI QIDQ1909011

Henrik Paul, Volker Nissen

Publication date: 29 April 1996

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

simulated annealingthreshold accepting heuristictrade-off between solution quality and convergence speed

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (5)

A survey for the quadratic assignment problem ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue ⋮ Metaheuristics: A bibliography ⋮ A tabu search algorithm with controlled randomization for constructing feasible university course timetables

Uses Software

• QAPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• Efficient models for the facility layout problem
• QAPLIB-A quadratic assignment problem library
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• The facility layout problem
• Experimental analysis of simulated annealing based algorithms for the layout problem
• The Backboard Wiring Problem: A Placement Algorithm
• Assignment Problems and the Location of Economic Activities
• Tabu Search Applied to the Quadratic Assignment Problem
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• P-Complete Approximation Problems
• Hospital Layout as a Quadratic Assignment Problem

This page was built for publication: A modification of threshold accepting and its application to the quadratic assignment problem