#### DMCA

## An Intensive Search Algorithm for the Quadratic Assignment Problem (2000)

### Citations

198 | QAPLIB – A quadratic assignment problem library - Burkhard, Karisch, et al. - 1991 |

119 | A greedy randomized adaptive search procedure for the quadratic assignment problem
- Li, Pardolos, et al.
- 1994
(Show Context)
Citation Context ...onemann and Boelte, 1994), tabu search (Skorin-Kapov, 1990; Taillard, 1991), genetic algorithms (Fleurent and Ferland, 1994), as well as the algorithms based on the greedy randomized adaptive search (=-=Li et al., 1993-=-), and other algorithms (Armour and Buffa, 1963; Bazaraa and Sherali, 1980; Sherali and Rajgopal, 1986; Murthy et al., 1992). In this paper, we introduce a new heuristic algorithm entitled as an inten... |

107 | Genetic hybrids for the quadratic assignment problem
- Fleurent, Ferland
- 1993
(Show Context)
Citation Context ...ignment problem, first of all, simulated annealing (Burkard and Rendl, 1984; Wilhelm and Ward, 1987; Thonemann and Boelte, 1994), tabu search (Skorin-Kapov, 1990; Taillard, 1991), genetic algorithms (=-=Fleurent and Ferland, 1994-=-), as well as the algorithms based on the greedy randomized adaptive search (Li et al., 1993), and other algorithms (Armour and Buffa, 1963; Bazaraa and Sherali, 1980; Sherali and Rajgopal, 1986; Murt... |

99 |
Tabu search applied to the quadratic assignment problem
- Skorin-Kapov
- 1990
(Show Context)
Citation Context ...ic algorithms have been widely used for the quadratic assignment problem, first of all, simulated annealing (Burkard and Rendl, 1984; Wilhelm and Ward, 1987; Thonemann and Boelte, 1994), tabu search (=-=Skorin-Kapov, 1990-=-; Taillard, 1991), genetic algorithms (Fleurent and Ferland, 1994), as well as the algorithms based on the greedy randomized adaptive search (Li et al., 1993), and other algorithms (Armour and Buffa, ... |

95 |
Optimal and suboptimal algorithms for the quadratic assignment problem
- Gilmore
- 1962
(Show Context)
Citation Context ...he initial solution is improved by the intensive search algorithm. 2.1. Construction of the Initial Solution Many constructive algorithms use a consecutive scheme of handling of the components (e.g., =-=Gilmore, 1962-=-; Hanan and Kurtzberg, 1972; Murthy and Pardalos, 1990). The components are considered successively: at each step, an unplaced component is selected, one at a time, and assigned to one of the unoccupi... |

80 |
A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities
- Armour, Buffa
- 1963
(Show Context)
Citation Context ...Skorin-Kapov, 1990; Taillard, 1991), genetic algorithms (Fleurent and Ferland, 1994), as well as the algorithms based on the greedy randomized adaptive search (Li et al., 1993), and other algorithms (=-=Armour and Buffa, 1963-=-; Bazaraa and Sherali, 1980; Sherali and Rajgopal, 1986; Murthy et al., 1992). In this paper, we introduce a new heuristic algorithm entitled as an intensive search (IS) algorithm. We describe the det... |

80 |
A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Burkard, Rendl
- 1984
(Show Context)
Citation Context ...o optimality (Mautor and Roucairol, 1994; Clausen and Perregaard, 1997). Therefore, heuristic algorithms have been widely used for the quadratic assignment problem, first of all, simulated annealing (=-=Burkard and Rendl, 1984-=-; Wilhelm and Ward, 1987; Thonemann and Boelte, 1994), tabu search (Skorin-Kapov, 1990; Taillard, 1991), genetic algorithms (Fleurent and Ferland, 1994), as well as the algorithms based on the greedy ... |

79 |
The backboard wiring problem: A placement algorithm
- Steinberg
- 1961
(Show Context)
Citation Context ...that minimizes z(p) = n� n� i=1 j=1 fijd p(i)p(j). (1) One of the applications of the quadratic assignment problem is computer aided design of electronic devices, namely, placement of the components (=-=Steinberg, 1961-=-). In this context, n denotes the number of components (blocks), which are to be placed into positions (slots) on a board (chip). Each placement corresponds to a certain permutation (p(1),p(2),...,p(n... |

43 |
Solving quadratic assignment problems by simulated annealing
- Wilhelm, Ward
- 1987
(Show Context)
Citation Context ...Roucairol, 1994; Clausen and Perregaard, 1997). Therefore, heuristic algorithms have been widely used for the quadratic assignment problem, first of all, simulated annealing (Burkard and Rendl, 1984; =-=Wilhelm and Ward, 1987-=-; Thonemann and Boelte, 1994), tabu search (Skorin-Kapov, 1990; Taillard, 1991), genetic algorithms (Fleurent and Ferland, 1994), as well as the algorithms based on the greedy randomized adaptive sear... |

31 |
A new exact algorithm for the solution of quadratic assignment problems
- Mautor, Roucairol
- 1994
(Show Context)
Citation Context ...that the quadratic assignment problem is NP-hard. There exists no polynomial-time algorithm to find an exact solution. Problems of size n>20 are not, to this date, practically solvable to optimality (=-=Mautor and Roucairol, 1994-=-; Clausen and Perregaard, 1997). Therefore, heuristic algorithms have been widely used for the quadratic assignment problem, first of all, simulated annealing (Burkard and Rendl, 1984; Wilhelm and War... |

27 | Solving large quadratic assignment problems in parallel - Clausen, Perregaard - 1997 |

20 |
An improved simulated annealing algorithm for the quadratic assignment problem,” Working paper
- Thonemann, Bijlte
- 1994
(Show Context)
Citation Context ... and Perregaard, 1997). Therefore, heuristic algorithms have been widely used for the quadratic assignment problem, first of all, simulated annealing (Burkard and Rendl, 1984; Wilhelm and Ward, 1987; =-=Thonemann and Boelte, 1994-=-), tabu search (Skorin-Kapov, 1990; Taillard, 1991), genetic algorithms (Fleurent and Ferland, 1994), as well as the algorithms based on the greedy randomized adaptive search (Li et al., 1993), and ot... |

15 |
J.M.: Placement Techniques
- Hanan, Kurtzberg
- 1972
(Show Context)
Citation Context ...tion is improved by the intensive search algorithm. 2.1. Construction of the Initial Solution Many constructive algorithms use a consecutive scheme of handling of the components (e.g., Gilmore, 1962; =-=Hanan and Kurtzberg, 1972-=-; Murthy and Pardalos, 1990). The components are considered successively: at each step, an unplaced component is selected, one at a time, and assigned to one of the unoccupied (free) positions. A posi... |

14 |
Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Bazara, Sherali
- 1980
(Show Context)
Citation Context ...lard, 1991), genetic algorithms (Fleurent and Ferland, 1994), as well as the algorithms based on the greedy randomized adaptive search (Li et al., 1993), and other algorithms (Armour and Buffa, 1963; =-=Bazaraa and Sherali, 1980-=-; Sherali and Rajgopal, 1986; Murthy et al., 1992). In this paper, we introduce a new heuristic algorithm entitled as an intensive search (IS) algorithm. We describe the details of this algorithm in S... |

12 |
A local search algorithm for the quadratic assignment problem, Informatica 3
- Murthy, Pardalos, et al.
- 1992
(Show Context)
Citation Context ...1994), as well as the algorithms based on the greedy randomized adaptive search (Li et al., 1993), and other algorithms (Armour and Buffa, 1963; Bazaraa and Sherali, 1980; Sherali and Rajgopal, 1986; =-=Murthy et al., 1992-=-). In this paper, we introduce a new heuristic algorithm entitled as an intensive search (IS) algorithm. We describe the details of this algorithm in Section 2. The results of the computational experi... |

10 |
Robust taboo search for the QAP
- Taillard
- 1991
(Show Context)
Citation Context ...een widely used for the quadratic assignment problem, first of all, simulated annealing (Burkard and Rendl, 1984; Wilhelm and Ward, 1987; Thonemann and Boelte, 1994), tabu search (Skorin-Kapov, 1990; =-=Taillard, 1991-=-), genetic algorithms (Fleurent and Ferland, 1994), as well as the algorithms based on the greedy randomized adaptive search (Li et al., 1993), and other algorithms (Armour and Buffa, 1963; Bazaraa an... |

5 |
A heuristic procedure for solving the quadratic assignment problem
- Murtagh, Jefferson, et al.
- 1982
(Show Context)
Citation Context ...ding on how the search of the better solutions is performed. A large number of iterative algorithms are based on the greedy descent principle (e.g., Armour and Buffa, 1963; Hanan and Kurtzberg, 1972; =-=Murtagh et al., 1982-=-). The current solution is replaced by the new one from the neighbourhood (a move to another solution is performed) if only the difference of the objective function values (∆z = z(p ′ ) − z(p)) is neg... |

3 |
A polynomial-time approximation algorithm for the quadratic assignment problem
- Murthy, Pardalos
- 1990
(Show Context)
Citation Context ...ensive search algorithm. 2.1. Construction of the Initial Solution Many constructive algorithms use a consecutive scheme of handling of the components (e.g., Gilmore, 1962; Hanan and Kurtzberg, 1972; =-=Murthy and Pardalos, 1990-=-). The components are considered successively: at each step, an unplaced component is selected, one at a time, and assigned to one of the unoccupied (free) positions. A position for the selected compo... |

3 |
A flexible polynomial time construction and improvement heuristic for the quadratic assignment problem
- Sherali, Rajgopal
- 1986
(Show Context)
Citation Context ...thms (Fleurent and Ferland, 1994), as well as the algorithms based on the greedy randomized adaptive search (Li et al., 1993), and other algorithms (Armour and Buffa, 1963; Bazaraa and Sherali, 1980; =-=Sherali and Rajgopal, 1986-=-; Murthy et al., 1992). In this paper, we introduce a new heuristic algorithm entitled as an intensive search (IS) algorithm. We describe the details of this algorithm in Section 2. The results of the... |