Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

Authors:
Charles Fleurent;Fred Glover
Affiliations:
-;-
Venue:
INFORMS Journal on Computing
Year:
1999

Citing 0
Cited 23

A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem

Journal of Heuristics
GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps

Journal of Heuristics
Probability Distribution of Solution Time in GRASP: An Experimental Investigation

Journal of Heuristics
Parallel GRASP with path-relinking for job shop scheduling

Parallel Computing - Special issue: Parallel computing in numerical optimization
Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem

Journal of Heuristics
On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem

Computers and Industrial Engineering
Ant colony optimization combined with taboo search for the job shop scheduling problem

Computers and Operations Research
A constructive procedure for finding good starting solutions to the network design problem with uncertain parameters

AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem

Informatica
Global Search Method for Parallel Machine Scheduling

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
A grasp-knapsack hybrid for a nurse-scheduling problem

Journal of Heuristics
Multistart tabu search and diversification strategies for the quadratic assignment problem

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Heuristics for the bandwidth colouring problem

International Journal of Metaheuristics
Adaptive memory in multistart heuristics for multicommodity network design

Journal of Heuristics
Hybrid metaheuristics in combinatorial optimization: A survey

Applied Soft Computing
Multistart strategy using delta test for variable selection

ICANN'11 Proceedings of the 21st international conference on Artificial neural networks - Volume Part II
Seeking global edges for traveling salesman problem in multi-start search

Journal of Global Optimization
An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines

Computers and Operations Research
Incremental local search in ant colony optimization: why it fails for the quadratic assignment problem

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Hybrid Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem

Applied Soft Computing
A hybrid data mining GRASP with path-relinking

Computers and Operations Research
Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multistart constructive approaches operate by applying a local search procedure to start from different initial solutions produced by a repeated (variable) constructive process. The classical Random Restart procedure and the more recent GRASP procedure are prominent examples of such approaches. Adaptive memor y strategies that are the heart of tabu search methods give a foundation for alternative, enhanced, multistart approaches. We demonstrate this by showing that a simple implementation of adaptive memory search principles, even when restricted to the constructive phases, can provide more effective multistart methods. Computational experiments for the quadratic assignment problem disclose that these methods improve significantly over previous multistart methods that do not incorporate such memory based strategies.