A hybrid genetic algorithm for three-index assignment problem

Abstract

Three-index assignment problem (AP3) is well-known problem which has been shown to be NP-hard. This problem has been studied extensively, and many exact and heuristic methods have been proposed to solve it. Inspired by the classical assignment problem, we propose a new iterative heuristic, called fragmental optimization (FO), which solves the problem by simplifying it to the assignment problem. We further hybridize our heuristic with the genetic algorithm (GA). Extensive experimental results indicate that our hybrid method to be superior to all previous heuristic methods including those proposed by Balas and Saltzman(1991), Crama and Spieksma(1992), Burkard et al(1996), and Aiex et al(2003).