Abstract

Tree-seed algorithm (TSA) is a nature-inspired metaheuristic optimization algorithm. TSA is proposed for solving continuous optimization problems. In this work, TSA is modified with transfer functions for solving binary optimization problems. Continuous search space is mapped to binary search space with transfer functions. Four S-shaped and four V-shaped transfer functions are used for discretization. Uncapacitated facility location problem (UFLP) is a pure binary optimization problem. In order to measure the performance, 15 different sized (small, medium, large and extra-large) UFLPs are solved with eight different binary TSA in this work. Experimental results show that S-shaped transfer functions are better than V-shaped transfer functions on these problem sets.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.