Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
GA-based discrete dynamic programming approach for scheduling inFMS environments
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An adaptive local search based genetic algorithm for solving multi-objective facility layout problem
ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
| Hi-index | 0.00 |
The optimal design of supply chain (SC) is a difficult task, if it is composed of the complicated multistage structures with component plants, assembly plants, distribution centers, retail stores and so on. It is mainly because that the multistage-based SC with complicated routes may not be solved using conventional optimization methods. In this study, we propose a genetic algorithm (GA) approach with adaptive local search scheme to effectively solve the multistage-based SC problems. The proposed algorithm has an adaptive local search scheme which automatically determines whether local search technique is used in GA loop or not. In numerical example, two multistage-based SC problems are suggested and tested using the proposed algorithm and other competing algorithms. The results obtained show that the proposed algorithm outperforms the other competing algorithms.