This paper presents a novel binary bat algorithm (NBBA) to solve 0-1 knapsack problems. The proposed algorithm combines two important phases: binary bat algorithm (BBA) and local search scheme (LSS). The bat algorithm enables the bats to enhance the exploration capability while LSS aims to boost the exploitation tendencies and, therefore, it can prevent the BBA-LSS from the entrapment in the local optima. Moreover, the LSS starts its search from BBA found so far. By this methodology, the BBA-LSS enhances the diversity of bats and improves the convergence performance. The proposed algorithm is tested on different size instances from the literature. Computational experiments show that the BBA-LSS can be promise alternative for solving large-scale 0-1 knapsack problems.
In this paper, a new compromise algorithm for multi-objective transportation problem (MO-TP) is developed, which is inspired by Zimmermann's fuzzy programming and the neutrosophic set terminology. The proposed NCPA is characterized by assigning three membership functions for each objective namely, truth membership, indeterminacy membership and falsity membership. With the membership functions for all objectives, a neutrosophic compromise programming model is constructed with the aim to find best compromise solution (BCS). This model can cover a wide spectrum of BCSs by controlling the membership functions interactively. The performance of the NCPA is validated by measuring the ranking degree using TOPSIS approach. Illustrative examples are reported and compared with exists models in the literature. Based on the provided comparisons, NCPA is superior to fuzzy and different approaches.
This paper presents a new algorithm based on hybridizing the sine cosine algorithm (SCA) with a multi-orthogonal search strategy (MOSS), named multi-orthogonal sine cosine algorithm (MOSCA), for solving engineering design problems. The proposed MOSCA integrates the advantages of the SCA and MOSS to eliminate SCA's disadvantages, like unbalanced exploitation and the trapping in local optima. The proposed MOSCA works in two stages, firstly, the SCA phase starts the search process to enhance exploration capability. Secondly, the MOSS phase starts its search from SCA found so far to boost the exploitation tendencies. In this regard, MOSS phase can assist SCA phase to search based on deeper exploration/exploitation patterns as an alternative. Therefore, the MOSCA can be more robust, statistically sound, and quickly convergent. The performance of the MOSCA algorithm is investigated by applying it on eighteen benchmark problems and four engineering design problems. The experimental results indicate that MOSCA is a promising algorithm and outperforms the other algorithms in most cases.
Highlights MOSCA is presented to solve design and manufacturing optimization problems efficiently. MOSCA is based on two phases namely, sine cosine algorithm (SCA) and multi-orthogonal search strategy (MOSS). The integrated MOSCA enhances exploration tendency and exploitation capability. The MOSCA can be more robust, statistically sound, and quickly convergent. New approach produced successful results compared to the literature studies.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.