Nonlinear optimization and parallel computing
Parallel Computing - Special issue: Parallel computing in numerical optimization
A Hybrid Heuristic for the p-Median Problem
Journal of Heuristics
A GRASP and Path Relinking Heuristic for Rural Road Network Development
Journal of Heuristics
Path relinking for the vehicle routing problem
Journal of Heuristics
GRASP with path relinking for the weighted MAXSAT problem
Journal of Experimental Algorithmics (JEA)
Efficient parallel cooperative implementations of GRASP heuristics
Parallel Computing
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Local Search Heuristics for the Multidimensional Assignment Problem
Graph Theory, Computational Intelligence and Thought
A decision support approach for assigning reviewers to proposals
Expert Systems with Applications: An International Journal
Local search heuristics for the multidimensional assignment problem
Journal of Heuristics
GRASP with path-relinking for data clustering: a case study for biological data
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
GRASP with path-relinking for the generalized quadratic assignment problem
Journal of Heuristics
GRASP with path-relinking for the weighted maximum satisfiability problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Parametrized GRASP heuristics for three-index assignment
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Path-relinking intensification methods for stochastic local search algorithms
Journal of Heuristics
Journal of Global Optimization
Randomized heuristics for handover minimization in mobility networks
Journal of Heuristics
Solving the Multidimensional Assignment Problem by a Cross-Entropy method
Journal of Combinatorial Optimization
Hi-index | 0.00 |
This paper proposes and tests variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three-index assignment problem (AP3). GRASP is a multistart 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 et al. (1996), and Crama and Spieksma (1992) on all instances proposed in those papers. We show that the random variable "time to target solution," for all proposed GRASP with path-relinking variants, fits a two-parameter exponential distribution. To illustrate the consequence of this, one of the variants of GRASP with path relinking is shown to benefit from parallelization.