Modified artificial bee colony algorithm for multiple-choice multidimensional knapsack problem

A Mkaouar, S Htiouech, H Chabchoub - IEEE Access, 2023 - ieeexplore.ieee.org
The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard
problem that has many real-time applications. However, owing to its complexity, finding …

Performance evaluation of a solution for composite service selection problem with multiple consumers

L Mokdad, JM Fourneau, A Abdelli… - … Modelling Practice and …, 2021 - Elsevier
In recent years, building business applications from independently developed services has
become one of the current trends in service computing. To satisfy clients' requirements …

A self-organizing wireless sensor networks based on quantum ant Colony evolutionary algorithm.

L Wang, C Wang - International Journal of Online …, 2017 - search.ebscohost.com
Aiming at the coverage problem of self-organizing wireless sensor networks, a target
coverage method for wireless sensor networks based on Quantum Ant Colony Evolutionary …

0-1 problem uzayları için kuantum tabanlı yerel arama ile güçlendirilmiş parçacık sürüsü optimizasyonu

FB Özsoydan - Pamukkale Üniversitesi Mühendislik Bilimleri …, 2018 - dergipark.org.tr
ParçacıkSürü Optimizasyonu (PSO), problem çözmede balık veya kuş
sürülerininhareketlerini taklit eden, oldukça bilinen sürü zekâsı tabanlı biralgoritmadır. İlk …