## GRASP with Path Relinking for the Three-Index Assignment Problem (2000)

Venue: | INFORMS Journal on Computing |

Citations: | 50 - 23 self |

### BibTeX

@TECHREPORT{Aiex00graspwith,

author = {R. M. Aiex and M. G. C. Resende and P.M. Pardalos and G. Toraldo},

title = {GRASP with Path Relinking for the Three-Index Assignment Problem},

institution = {INFORMS Journal on Computing},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

. This paper describes variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three index assignment problem (AP3). GRASP is a multi-start metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path relinking is an intensification strategy that explores trajectories that connect high quality solutions. Several variants of the heuristic are proposed and tested. Computational results show clearly that this GRASP for AP3 benefits from path relinking and that the variants considered in this paper compare well with previously proposed heuristics for this problem. GRASP with path relinking was able to improve the solution quality of heuristics proposed by Balas and Saltzman (1991), Burkard, Rudolf, and Woeginger (1996), and Crama and Spieksma (1992) on all instances proposed in those papers. We show that the random variable "time to target solution," for a...

### Citations

11605 |
Johnson: Computers and Intractability: A guide to theory of NP hardness, Feeman and
- Garey, S
- 1979
(Show Context)
Citation Context .... Apart from being simple and compact, it facilitates the implementation of a heuristic for the AP3 since the constraints can be taken care of by the objective function itself. The AP3 is NP-Complete =-=[15, 18]-=- since it is a special case of the set partitioning problem. Applications of the AP3 can be found in Pierskalla [30, 31], Frieze and Yaegar [16], and Crama et al. [8] and include scheduling ingots in ... |

672 | Tabu Search
- GLOVER, LAGUNA
- 1993
(Show Context)
Citation Context ...n line 14. The procedure ends with a solution that is locally optimal with respect to the neighborhood definition. 3. Path Relinking Path relinking was first introduced in the context of tabu search (=-=Glover and Laguna 1997-=-), as an approach to integrate intensification and diversification strategies in the search. See Glover et al. (2000) for a survey of path relinking. It consists of exploring trajectories that connect... |

537 | A greedy randomized adaptive search procedure for maximum independent set
- Feo, Resende, et al.
- 1994
(Show Context)
Citation Context ...quential and parallel implementations, are reported. Concluding remarks are made in Section 7. 2. GRASP construction and local search 2.1. GRASP. A greedy randomized adaptive search procedure (GRASP) =-=[11, 12, 13] is-=- a multi-start or iterative process, in which each GRASP iteration consists ofsGRASP WITH PATH RELINKING FOR 3-INDEX ASSIGNMENT 3 procedure CONSTRUCT(seed, n, c, S) 1 Select α ∈ [0, 1] at random; 2... |

374 |
Graphical Methods for Data Analysis
- Chambers, Cleveland, et al.
- 1983
(Show Context)
Citation Context ... GRASP to find a solution at least as good as the target fits a two-parameter exponential distribution. Standard methodology forsGRASP WITH PATH RELINKING FOR 3-INDEX ASSIGNMENT 29 graphical analysis =-=[7]-=- is used to compute the empirical and theoretical distributions and estimate the parameters of the distributions. We use the same methodology to study the time to target solution for four variants of ... |

157 |
A probabilistic heuristic for a computationally difficult set covering problem
- Feo, Resende
- 1989
(Show Context)
Citation Context ...quential and parallel implementations, are reported. Concluding remarks are made in Section 7. 2. GRASP construction and local search 2.1. GRASP. A greedy randomized adaptive search procedure (GRASP) =-=[11, 12, 13] is-=- a multi-start or iterative process, in which each GRASP iteration consists ofsGRASP WITH PATH RELINKING FOR 3-INDEX ASSIGNMENT 3 procedure CONSTRUCT(seed, n, c, S) 1 Select α ∈ [0, 1] at random; 2... |

109 | Fundamentals of scatter search and path relinking
- Glover, Laguna, et al.
(Show Context)
Citation Context ...hood definition. 3. Path relinking Path relinking was first introduced in the context of tabu search [19] as an approach to integrate intensification and diversification strategies in the search. See =-=[20]-=- for a survey of path relinking. It consists in exploring trajectories that connect high quality solutions, by starting from an initial solution and generating a path in the neighborhood of this solut... |

108 | A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem
- Li, Pardalos, et al.
- 1994
(Show Context)
Citation Context ...t solution by a better solution in the neighborhood of the current solution. It terminates when no better solution is found in the neighborhood. GRASP has been applied to numerous assignment problems =-=[1, 10, 14, 25, 27, 26, 28, 29, 32, 33, 34, 35, 36, 37]-=-. 2.2. GRASP construction for AP3. The GRASP construction phase builds a feasible solution S by selecting n triplets, one at a time. Figure 1 illustrates the construction phase in pseudo-code. A restr... |

93 | GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Laguna, Martí
- 1999
(Show Context)
Citation Context ...e guiding solution are analyzed and the move that best improves (or least deteriorates) the initial solution is chosen. Path relinking in the context of GRASP was first introduced by Laguna and Martí=-= [23]-=-. For the 3-index assignment problem, path relinking is done between an initial solution S = {(1, j S 1 , kS 1 ), (2, jS 2 , kS 2 ), . . . , (n, jS n , kS n )} and a guiding solution T = {(1, j T 1 , ... |

91 |
MPI—The Complete Reference: Volume 1, The MPI Core, 2nd edition
- Snir, Otto, et al.
- 1998
(Show Context)
Citation Context ...d 26.1). Stopping criteria: look4 = 17 and look4 = 19 for test problems 24.1 and 26.1, respectively. specification has become a common standard for message-passing libraries for parallel computations =-=[38]. -=-The parallel codes used SGI’s Message Passing Toolkit 1.4, which contains a fully compliant implementation of the MPI 1.2 specification. CPU times for the sequential implementation were measured wit... |

83 | GRASP: An annotated bibliography
- Festa, Resende
- 2002
(Show Context)
Citation Context ...quential and parallel implementations, are reported. Concluding remarks are made in Section 7. 2. GRASP construction and local search 2.1. GRASP. A greedy randomized adaptive search procedure (GRASP) =-=[11, 12, 13] is-=- a multi-start or iterative process, in which each GRASP iteration consists ofsGRASP WITH PATH RELINKING FOR 3-INDEX ASSIGNMENT 3 procedure CONSTRUCT(seed, n, c, S) 1 Select α ∈ [0, 1] at random; 2... |

62 | A more portable fortran random number generator - Schrage - 1979 |

50 |
An Algorithm for the Three-Index Assignment Problem
- Balas, Saltzman
- 1991
(Show Context)
Citation Context ...satellite coverage optimization, scheduling teaching practice, and production of printed circuit board. Exact and heuristic algorithms have been proposed for the 3-index assignment problem, including =-=[3, 4, 5, 6, 9, 17, 21, 24, 30, 31, 40]-=-. The remainder of the paper is organized as follows. In Section 2, the construction and local search phases of a GRASP for the AP3 are described. Path relinking is presented in Section 3. Section 4 s... |

49 | Probability distribution of solution time in grasp: An experimental investigation
- Aiex, Resende, et al.
- 2002
(Show Context)
Citation Context ...optimization, and fixed interval intensification. • On all but five long runs, pure GRASP found the best solution averages. 6.5. Experiments with a parallel implementation. Aiex, Resende, and Ribeir=-=o [2]-=- studied the empirical probability distributions of the random variable time to target solution in five GRASP implementations. They showed that, given a target solution value, the time it takes GRASP ... |

46 | A greedy genetic algorithm for the quadratic assignment problem
- Ahuja, Orlin, et al.
(Show Context)
Citation Context ...GRASP) [11, 12, 13] is a multi-start or iterative process, in which each GRASP iteration consists ofsGRASP WITH PATH RELINKING FOR 3-INDEX ASSIGNMENT 3 procedure CONSTRUCT(seed, n, c, S) 1 Select α �=-=�� [0, 1] at random; 2 S = ∅; 3 C = {(i,-=- j, k) ∈ I × J × K}; 4 for p = 1, . . . , n − 1� do 5 c = min{cijk � �(i, j, k) ∈ C}; 6 c = max{cijk � (i, j, k) ∈ C}; 7 C ′ = {(i, j, k) ∈ C � � cijk ≤ c + α(c − c)}; 8... |

45 |
The multi-dimensional assignment problem
- Pierskalla
- 1968
(Show Context)
Citation Context ...s can be taken care of by the objective function itself. The AP3 is NP-Complete [15, 18] since it is a special case of the set partitioning problem. Applications of the AP3 can be found in Pierskalla =-=[30, 31]-=-, Frieze and Yaegar [16], and Crama et al. [8] and include scheduling ingots in soaking pits in a rolling mill, scheduling capital investments, military troop assignment, satellite coverage optimizati... |

44 |
Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
- Fleurent, Glover
- 1999
(Show Context)
Citation Context ...t solution by a better solution in the neighborhood of the current solution. It terminates when no better solution is found in the neighborhood. GRASP has been applied to numerous assignment problems =-=[1, 10, 14, 25, 27, 26, 28, 29, 32, 33, 34, 35, 36, 37]-=-. 2.2. GRASP construction for AP3. The GRASP construction phase builds a feasible solution S by selecting n triplets, one at a time. Figure 1 illustrates the construction phase in pseudo-code. A restr... |

31 |
Semi-greedy heuristics: An empirical study
- HART, SHOGAN
- 1987
(Show Context)
Citation Context ...tion phase, a feasible solution is iteratively constructed, one element at a time. The basic GRASP construction phase is similar to the semi-greedy heuristic proposed independently by Hart and Shogan =-=[22]-=-. At each construction iteration, the choice of the next element to be added is determined by ordering all candidate elements (i.e. those that can be added to the solution) in a candidate list C with ... |

31 |
Parallel local search
- Verhoeven, Aarts
- 1995
(Show Context)
Citation Context ...2 ) is 0.968. We next present a basic parallelization scheme for GRASP with path relinking. Figure 6 shows pseudo-code for this scheme, which according to the taxonomy proposed by Verhoeven and Aarts =-=[39]-=- is a multiple independent walks parallelization. Our implementation uses message passing for communication between processors. This communication is limited to program initialization and termination.... |

23 |
Approximation algorithms for three-dimensional assignment problems with triangle inequalities, European
- Crama, Spieksma
- 1992
(Show Context)
Citation Context ...satellite coverage optimization, scheduling teaching practice, and production of printed circuit board. Exact and heuristic algorithms have been proposed for the 3-index assignment problem, including =-=[3, 4, 5, 6, 9, 17, 21, 24, 30, 31, 40]-=-. The remainder of the paper is organized as follows. In Section 2, the construction and local search phases of a GRASP for the AP3 are described. Path relinking is presented in Section 3. Section 4 s... |

23 | A parallel GRASP implementation for the quadratic assignment problem
- Pardalos, Pitsoulis, et al.
- 1995
(Show Context)
Citation Context ...t solution by a better solution in the neighborhood of the current solution. It terminates when no better solution is found in the neighborhood. GRASP has been applied to numerous assignment problems =-=[1, 10, 14, 25, 27, 26, 28, 29, 32, 33, 34, 35, 36, 37]-=-. 2.2. GRASP construction for AP3. The GRASP construction phase builds a feasible solution S by selecting n triplets, one at a time. Figure 1 illustrates the construction phase in pseudo-code. A restr... |

18 | Three-dimensional axial assignment problems with decomposable costs
- Burkard, Rudolf, et al.
- 1996
(Show Context)
Citation Context ...satellite coverage optimization, scheduling teaching practice, and production of printed circuit board. Exact and heuristic algorithms have been proposed for the 3-index assignment problem, including =-=[3, 4, 5, 6, 9, 17, 21, 24, 30, 31, 40]-=-. The remainder of the paper is organized as follows. In Section 2, the construction and local search phases of a GRASP for the AP3 are described. Path relinking is presented in Section 3. Section 4 s... |

17 |
Complexity of a 3-dimensional assignment problem
- Frieze
- 1983
(Show Context)
Citation Context .... Apart from being simple and compact, it facilitates the implementation of a heuristic for the AP3 since the constraints can be taken care of by the objective function itself. The AP3 is NP-Complete =-=[15, 18]-=- since it is a special case of the set partitioning problem. Applications of the AP3 can be found in Pierskalla [30, 31], Frieze and Yaegar [16], and Crama et al. [8] and include scheduling ingots in ... |

17 |
A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment BIBLIOGRAPHY 25 problem
- Robertson
(Show Context)
Citation Context |

16 |
Algorithm 754: FortranSubroutines for Approximate Solution of Dense Quadratic Assignment Problems Using GRASP
- Resende, Pardalos
- 1996
(Show Context)
Citation Context |

15 |
An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice
- Frieze, Yadegar
- 1981
(Show Context)
Citation Context ...e objective function itself. The AP3 is NP-Complete [15, 18] since it is a special case of the set partitioning problem. Applications of the AP3 can be found in Pierskalla [30, 31], Frieze and Yaegar =-=[16]-=-, and Crama et al. [8] and include scheduling ingots in soaking pits in a rolling mill, scheduling capital investments, military troop assignment, satellite coverage optimization, scheduling teaching ... |

15 |
A parallel GRASP for the data association multidimensional assignment problem
- Murphey, Pardalos, et al.
- 1998
(Show Context)
Citation Context |

14 |
Throughput rate optimization in the automated assembly of printed circuit boards
- Crama, Kolen, et al.
- 1990
(Show Context)
Citation Context ...self. The AP3 is NP-Complete [15, 18] since it is a special case of the set partitioning problem. Applications of the AP3 can be found in Pierskalla [30, 31], Frieze and Yaegar [16], and Crama et al. =-=[8]-=- and include scheduling ingots in soaking pits in a rolling mill, scheduling capital investments, military troop assignment, satellite coverage optimization, scheduling teaching practice, and producti... |

11 |
A primal-dual algorithm for the three-dimensional assignment problem", Cahiers du CERO
- Hansen, Kaufman
- 1973
(Show Context)
Citation Context |

10 | Computational investigations on 3-dimensional axial assignment problems
- Burkard, Rudolf
- 1993
(Show Context)
Citation Context |

10 |
Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
- Pardalos, Pitsoulis, et al.
- 1997
(Show Context)
Citation Context |

9 | Some remarks on 3-dimensional assignment problems - Burkard, Fröhlich - 1980 |

9 | eds) (2002) Handbook of Applied Optimization - Pardalos, Resende |

7 | A GRASP for the biquadratic assignment problem
- Mavridou, Pardalos, et al.
- 1998
(Show Context)
Citation Context |

7 | Nonlinear Assignment Problems: Algorithms and Applications - Pardalos, Pitsoulis - 2000 |

6 | The intermodal trailer assignment problem: Models, algorithms, and heuristics - Feo, González-Velarde - 1995 |

6 | Branch and bound method for the threeindex assignment problem - Vlach - 1967 |

4 |
Dreidimensionale Zuordnungsprobleme
- Fröhlich
- 1978
(Show Context)
Citation Context |

4 |
Methoden zur Losung dreidimensionaler Zuordnungsprobleme
- Leue
- 1972
(Show Context)
Citation Context |

4 |
The tri-substitution method for the threemultidimensional assignment problem
- Pierskalla
- 1967
(Show Context)
Citation Context ...consequence of this, one of the variants of GRASP with path relinking is shown to benefit from parallelization. 1. Introduction The three-index assignment problem (AP3) was first stated by Pierskalla =-=[31] as a stra-=-ightforward extension of the classical two-dimensional assignment problem. It can be viewed as an optimization problem on a complete tripartite graph Kn,n,n = (I ∪ J ∪ K, (I × J) ∪ (I × K) ∪... |

4 |
MPI: The Complete Reference, volume 1-The MPI Core
- Snir, Otto, et al.
- 1998
(Show Context)
Citation Context ...iled with the SGI MIPSpro F77 compiler using flags -O3 -r4 -64. The Message-Passing Interface (MPI) specification has become a common standard for message-passing libraries for parallel computations (=-=Snir et al. 1998-=-). The parallel codes used SGI’s Message Passing Toolkit 1.4, which contains a fully compliant implementation of the MPI 1.2 specification. CPU times for the sequential implementation were measured wi... |

3 |
GRASP in the QAP: An acceptance bound for initial solution
- Rangel, Abreu, et al.
- 1999
(Show Context)
Citation Context |

3 |
A modified local search for GRASP in the quadratic assignment problem
- Rangel, Abreu, et al.
- 1998
(Show Context)
Citation Context |

3 | Semi-greedy Heuristics: An Empirical - Hart, Shogan - 1987 |

2 |
Algorithms for nonlinear assignment problems
- Pitsoulis
- 1999
(Show Context)
Citation Context |

2 |
Approximate solutions to the turbine balancing problem
- Pitsoulis, Pardalos, et al.
(Show Context)
Citation Context |

2 |
and bound method for the three index assignment problem. EkonomickoMathematick´y Obzor, 3:181–191
- Vlach, Branch
- 1967
(Show Context)
Citation Context |