A hybrid genetic algorithm for the Three-Index Assignment Problem

AbstractThe Three-Index Assignment Problem (AP3) is well-known problem which has been shown to be NP-hard. Thisproblem has been studied extensively, and many exact and heuristic methods have been proposed to solve it. Inspiredby the classical assignment problem, we propose a new local search heuristic which solves the problem by simplifying itto the classical assignment problem. We further hybridize our heuristic with the genetic algorithm (GA). Extensiveexperimental results indicate that our hybrid method is superior to all previous heuristic methods including those pro-posed by Balas and Saltzman [Operations Research 39 (1991) 150–161], Crama and Spieksma [European Journal ofOperational Research 60 (1992) 273–279], Burkard et al. [Discrete Applied Mathematics 65 (1996) 123–169], and Aiexet al. [GRASP with path relinking for the three-index assignment problem, Technical report, INFORMS Journal onComputing, in press. Available from: ]. 2004 Elsevier B.V. All rights reserved.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Yves Crama,et al.  Approximation algorithms for three-dimensional assignment problems with triangle inequalities , 1992 .

[3]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[4]  Panos M. Pardalos,et al.  GRASP With Path Relinking For The Three-Index Assignment Problem , 2000 .

[5]  William P. Pierskalla,et al.  Letter to the Editor - The Multidimensional Assignment Problem , 1968, Oper. Res..

[6]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[7]  Kenneth C. Gilbert,et al.  MULTIDIMENSIONAL ASSIGNMENT PROBLEMS , 1988 .

[8]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[9]  Egon Balas,et al.  An Algorithm for the Three-Index Assignment Problem , 1991, Oper. Res..

[10]  R. Burkard,et al.  Computational investigations on 3-dimensional axial assignment problems , 1993 .

[11]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[12]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[13]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[14]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[15]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[16]  Gerhard J. Woeginger,et al.  Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients , 1996, Discret. Appl. Math..

[17]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .