| No. Article/author | Solution approach | Problem type |
| 1 Proposed hybrid | Hybrid Genetic Algorithm and Variable Neighborhood Search | DFLP |
| 2 Rosenblatt [2] | Dynamic Programming | DFLP |
| 3 McKendall et al. [1] | Simulated Annealing Heuristics | DFLP |
| 4 McKendall and Shang [8] | Hybrid Ant Systems | DFLP |
| 5 Lacksonen and Enscore [3] | Dynamic Programming | DFLP |
| 6 Balakrishnan et al. [5] | Hybrid Genetic Algorithm | DFLP |
| 7 Baykasoglu and Gindy [4] | Simulated Annealing | DFLP |
| 8Chen [10] | Ant Colony Optimization | DFLP |
| 9 McKendall and Hakobyan [9] | Boundary Search Heuristic and Tabu Search | DFLP with unequalsize |
| 10 Dunker et al. [6] | Hybrid Genetic Algorithm and Dynamic programming | DFLP with unequal size |
| 11 Dunker et al. [7] | Genetic Algorithm | SFLP with unequal size |
| 12 Guan and Lin. [11] | Hybrid Shortest Path and Simulated Annealing | DFLP with dynamic environment |
| 13 Ulutas and Kulturel-Konak [14] | Artificial Immune System | DFLP with unequal size |
| 14 Komarudin and Wong [15] | Ant Colony Optimization | DFLP with unequal size |
| 15 Ripon et al. [16] | Adaptive Variable Neighborhood Search | Multiple objective SFLP with unequal size |
| 16 Kulturel-Konak [17] | Probabilistic Tabu Search | SFLP with unequal size |
| 17 Baykasoglu et al. [12] | Ant Colony Optimization | DFLP with budget constraint |
| 18 Hosseini et al. [18] | Hybrid imperialist competitive algorithm | DFLP |