Development and Comparison of Hybrid Genetic Algorithms for Network Design Problem in Closed Loop Supply Chain

HTML  XML Download Download as PDF (Size: 2128KB)  PP. 313-338  
DOI: 10.4236/iim.2015.76025    5,427 Downloads   7,007 Views  Citations

ABSTRACT

This paper presents four different hybrid genetic algorithms for network design problem in closed loop supply chain. They are compared using a complete factorial experiment with two factors, viz. problem size and algorithm. Based on the significance of the factor “algorithm”, the best algorithm is identified using Duncan’s multiple range test. Then it is compared with a mathematical model in terms of total cost. It is found that the best hybrid genetic algorithm identified gives results on par with the mathematical model in statistical terms. So, the best algorithm out of four algorithm proposed in this paper is proved to be superior to all other algorithms for all sizes of problems and its performance is equal to that of the mathematical model for small size and medium size problems.

Share and Cite:

Aravendan, M. and Panneerselvam, R. (2015) Development and Comparison of Hybrid Genetic Algorithms for Network Design Problem in Closed Loop Supply Chain. Intelligent Information Management, 7, 313-338. doi: 10.4236/iim.2015.76025.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.