The Three-Index Assignment Problem (AP3) is studied in this paper. We proposed a new local search heuristic for AP3 and hybridized it with genetic algorithm.

Inspired by the classical assignment problem, we propose a new iterative heuristic, called fragmental optimization (FO), which solves the problem by simplifying ...

The Three-Index Assignment Problem (AP3) is studied in this paper. We proposed a new local search heuristic for AP3 and hybridized it with genetic algorithm.

The %Index Assignment Problem is studied in this paper. We proposed a Fragmental Optimization heuristic for AP3 and hybridized it with Genetic Algorithm.

Inspired by the classical assignment problem, we propose a new local search heuristic which solves the problem by simplifying it to the classical assignment ...

Huang and Lim [13] constructed a hybrid genetic algorithm for solving the assignment problem; of interest is the proposed local optimization strategy, which can ...

Inspired by the classical assignment problem, we propose a new iterative heuristic, called fragmental optimization (FO), which solves the problem by simplifying ...

"A hybrid genetic algorithm for the Three-Index Assignment Problem," European Journal of Operational Research, Elsevier, vol. 172(1), pages 249-257, July.

The paper introduces the three-index assignment problem (3IAP) consists of assigning n tasks to n machines in n factories provided that a task is exactly ...

Gaofeng Huang, Andrew Lim : A hybrid genetic algorithm for the Three-Index Assignment Problem. Eur. J. Oper. Res. 172(1): 249-257 (2006).