A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems

Feng, Yanhong; Wang, Gai-Ge; Gao, Xueshan

doi:10.1080/18756891.2016.1256577

Cited by 40 publications

(16 citation statements)

References 81 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has the characteristics of fast calculation speed, excellent global optimization ability, and strong robustness. The algorithm has been successfully applied to the combinatorial optimization problem of the traveling salesman [29,30], 0/1 knapsack [31,32], timetable [33] and Shop Scheduling [34][35][36]. The algorithm has shown excellent performance.…”

Section: Literature Reviewmentioning

confidence: 99%

Asynchronous parallel disassembly sequence planning for multi-manipulator based on improved shuffled frog leaping algorithm

Zhu

et al. 2020

SN Appl. Sci.

View full text Add to dashboard Cite

To solve the problem of low disassembly efficiency of complex products, an asynchronous parallel disassembly sequence planning method of multi-manipulator based on improved shuffled frog leaping algorithm was proposed. Depending on the characteristics of this method, the disassembly manipulators are taken as the research object, and the minimum completion time of disassembly is taken as the optimization objective. Based on the basic disassembly time of parts, the disassembly preparation time caused by the change of disassembly tools and directions is considered, so that the objective function evaluation model is more realistic. Then, the mathematical model of asynchronous parallel disassembly sequence planning is constructed and the disassembly information modeling method is optimized. We proposed a new method based on the fastener constraint matrix and the part constraint matrix to build the information model of product disassembly. Based on this model, the detachable conditions are derived and the feasible disassembly sequence is obtained. In order to improve the performance of the proposed algorithm, a double-link encoding method and an efficient decoding operator is proposed. The adjustment orders which based on adjustment position and the substitution formulas are constructed to carry out the new segmental local evolution of frog individuals, and the update formula of frog position is reconstructed. Furthermore, the two-point mutation operator is added to the global information exchange strategy to enhance the search ability of the algorithm. The proposed algorithm is applied to a screw lifting mechanism and four products of varying complexity, and the results are compared with two algorithms. The results show that the proposed method can solve disassembly problems of different scales and is especially effective in solving large-scale disassembly problems.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Asynchronous parallel disassembly sequence planning for multi-manipulator based on improved shuffled frog leaping algorithm

Zhu

et al. 2020

SN Appl. Sci.

View full text Add to dashboard Cite

show abstract

“…Feng, Wang and Gao [22] have developed the hybrid approach of cuckoo search with harmony search to find the solution for 0-1 knapsack problem. This hybrid approach compared with other conventional algorithms along with the speed of convergence and search accuracy.…”

Section: Literature Surveymentioning

confidence: 99%

Hybrid Bacteria Foraging Optimization with Cuckoo Search Algorithm for Optimal Clusterhead Selection in Wireless Sensor Networks

Pitchaimanickam¹,

Murugaboopathi²

2019

IJEAT

View full text Add to dashboard Cite

Wireless Sensor Networks (WSN) are operated on a battery source. The sensor nodes are required more energy for the communication and information processing and also reduced the network lifetime. An efficient clustering scheme is designed to reduce the energy utilization and prolonged the network lifetime. In this paper, a hybrid approach of Bacteria Foraging Optimization with Cuckoo Search algorithm is proposed in the LEACH-C algorithm. This proposed methodology improves the chemotaxis behavior of Bacteria Foraging Optimization by using the Cuckoo Search algorithm. The residual energy of the node and the minimum distance among the nodes are considered for selecting the optimal cluster head. The proposed methodology has been done in Network Simulator (NS-2) and the experimental results improve the network lifetime by increasing the alive nodes and minimize the energy consumption. The proposed methodology has provided 700 seconds of life duration to the nodes, which is significantly higher than the lifetime provided by any other conventional techniques.

show abstract

“…LSHA and POHA took advantage of the merits of ACS and IIWD, and can effectively handle CVRP, where in most cases, LSHA outperformed other three algorithms in the literature. Besides, CS has been hybrided with improved shuffled frog leaping algorithm [39], global harmony search algorithm [40], simulated annealing algorithm [41], FA [42] and so on.…”

Section: Introductionmentioning

confidence: 99%

A Hybrid Ant Colony and Cuckoo Search Algorithm for Route Optimization of Heating Engineering

et al. 2018

View full text Add to dashboard Cite

The development of remote sensing and intelligent algorithms create an opportunity to include ad hoc technology in the heating route design area. In this paper, classification maps and heating route planning regulations are introduced to create the fitness function. Modifications of ant colony optimization and the cuckoo search algorithm, as well as a hybridization of the two algorithms, are proposed to solve the specific Zhuozhou–Fangshan heating route design. Compared to the fitness function value of the manual route (234.300), the best route selected by modified ant colony optimization (ACO) was 232.343, and the elapsed time for one solution was approximately 1.93 ms. Meanwhile, the best route selected by modified Cuckoo Search (CS) was 244.247, and the elapsed time for one solution was approximately 0.794 ms. The modified ant colony optimization algorithm can find the route with smaller fitness function value, while the modified cuckoo search algorithm can find the route overlapped to the manual selected route better. The modified cuckoo search algorithm runs more quickly but easily sticks into the premature convergence. Additionally, the best route selected by the hybrid ant colony and cuckoo search algorithm is the same as the modified ant colony optimization algorithm (232.343), but with higher efficiency and better stability.

show abstract

A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems

Cited by 40 publications

References 81 publications

Asynchronous parallel disassembly sequence planning for multi-manipulator based on improved shuffled frog leaping algorithm

Asynchronous parallel disassembly sequence planning for multi-manipulator based on improved shuffled frog leaping algorithm

Hybrid Bacteria Foraging Optimization with Cuckoo Search Algorithm for Optimal Clusterhead Selection in Wireless Sensor Networks

A Hybrid Ant Colony and Cuckoo Search Algorithm for Route Optimization of Heating Engineering

Contact Info

Product

Resources

About