Putting continuous metaheuristics to work in binary search spaces
In the real world, there are a number of optimization problems whose search space is
restricted to take binary values; however, there are many continuous metaheuristics with …
restricted to take binary values; however, there are many continuous metaheuristics with …
Low-latency and energy-efficient scheduling in fog-based IoT applications
In today's world, the internet of things (IoT) is developing rapidly. Wireless sensor network
(WSN) as an infrastructure of IoT has limitations in the processing power, storage, and delay …
(WSN) as an infrastructure of IoT has limitations in the processing power, storage, and delay …
A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem
M Abdel-Basset, D El-Shahat, AK Sangaiah - International Journal of …, 2019 - Springer
The Whale optimization algorithm (WOA) is one of the most recent nature-inspired meta-
heuristic optimization algorithms, which simulates the social character of the humpback …
heuristic optimization algorithms, which simulates the social character of the humpback …
Scheduling of fog networks with optimized knapsack by symbiotic organisms search
Internet of things as a concept uses wireless sensor networks that have limitations in power,
storage, and delay when processing and sending data to the cloud. Fog computing as an …
storage, and delay when processing and sending data to the cloud. Fog computing as an …
Diversity-driven automated web API recommendation based on implicit requirements
H Kou, J Xu, L Qi - Applied Soft Computing, 2023 - Elsevier
With the rapid growth of the web API sharing community, Mashup development has become
a popular way for software developers to quickly create Mashup applications. Mashup …
a popular way for software developers to quickly create Mashup applications. Mashup …
A modified artificial bee colony approach for the 0-1 knapsack problem
J Cao, B Yin, X Lu, Y Kang, X Chen - Applied Intelligence, 2018 - Springer
Abstract The 0-1 knapsack problem (KP01) is one of the classical NP-hard problems in
operation research and has a number of engineering applications. In this paper, the BABC …
operation research and has a number of engineering applications. In this paper, the BABC …
Solving 0–1 knapsack problem by binary flower pollination algorithm
M Abdel-Basset, D El-Shahat, I El-Henawy - Neural Computing and …, 2019 - Springer
In this paper, we propose a new binary version of the flower pollination algorithm (BFPA) for
solving 0–1 knapsack problem. The standard flower pollination algorithm (FPA) is used for …
solving 0–1 knapsack problem. The standard flower pollination algorithm (FPA) is used for …
A feature-independent hyper-heuristic approach for solving the knapsack problem
Recent years have witnessed a growing interest in automatic learning mechanisms and
applications. The concept of hyper-heuristics, algorithms that either select among existing …
applications. The concept of hyper-heuristics, algorithms that either select among existing …
Data-driven resilient fleet management for cloud asset-enabled urban flood control
Emergency fleet management has become one of the determinant success factors for post-
disaster responses in urban flood control. However, it is challenging as multiple types of …
disaster responses in urban flood control. However, it is challenging as multiple types of …
Heuristics-based influence maximization for opinion formation in social networks
Influence maximization for opinion formation (IMOF) is a significant issue in social networks.
In general, the main goal of the IMOF is to determine a set of optimal nodes in an effective …
In general, the main goal of the IMOF is to determine a set of optimal nodes in an effective …