17 papers · ranked by Valyu relevance
Yaoyao Liu, Ping Guo, Yi Zeng
The capacitated clustering problem (CCP) divides the vertices of the undirected graph into several disjoint clusters so that the sum of the node weights in each cluster meets the capacity limit while maximizing the sum of the weight of the edges between nodes in the same cluster. CCP is a typical NP-hard problem with a…
Esteban Arias-Méndez, Diego Barquero-Morera, Francisco J. Torres-Rojas, Bernhard Schuster
'Francisco J. Torres-Rojas' 'Bernhard Schuster'] Metabolic pathways provide key information for achieving a better understanding of life and all its processes; this is useful information for the improvement of medicine, agronomy, pharmacy, and other similar areas. The main analysis tool used to study these pathways is…
Sarah Eljack, Mahdi Jemmali, Mohsen Denden, Sadok Turki + 4 more
'Wael M. Khedr' 'Abdullah M. Algashami' 'Mutasim ALsadig' 'Ahyoung Lee'] The problem treated in this article is the storage of sensitive data in the cloud environment and how to choose regions and zones to minimize the number of transfer file events. Handling sensitive data in the global internet network many times can…
Szilárd Kovács, Csaba Budai, János Botzheim
In this paper, we present the Colonial Bacterial Memetic Algorithm (CBMA), an advanced evolutionary optimization approach for robotic applications. CBMA extends the Bacterial Memetic Algorithm by integrating Cultural Algorithms and co-evolutionary dynamics inspired by bacterial group behavior. This combination of…
Jialing Yan, Gang Hu, Jiulong Zhang, Heming Jia + 2 more
'Xuewen Xia'] To address the shortcomings of the recently proposed Fick’s Law Algorithm, which is prone to local convergence and poor convergence efficiency, we propose a multi-strategy improved Fick’s Law Algorithm (FLAS). The method combines multiple effective strategies, including differential mutation strategy…
Qihang Yuan, Yongde Zhang, Xuesong Dai, Shu Zhang
The reptile search algorithm (RSA) is a swarm-based metaheuristic algorithm inspired by the encirclement and hunt mechanisms of crocodiles. Compared with other algorithms, RSA is competitive but still suffers from low population diversity, unbalanced exploitation and exploration, and the tendency to fall into local…
Ran Wang, Weiquan Huang, Junyu Wu, Chen Chen + 3 more
To address the rapid population diversity loss and premature convergence of the Artificial Lemming Algorithm (ALA) in complex optimization problems, this paper proposes an Improved Artificial Lemming Algorithm (IALA) with multi-strategy enhancements inspired by lemming behavior. First, a non-uniform mutation operator…
Ali Asghari, Mohammadhossein Mohammadi, Heming Jia
Metaheuristic algorithms are widely used to find optimal or near-optimal solutions for complex problems by taking inspiration from natural behaviors and processes. Although many different methods have been developed, a common problem in many of them is maintaining a good balance between exploration and exploitation and…
Bilal Khurshid, Shahid Maqsood, Yahya Khurshid, Khawar Naeem + 1 more
This study investigates the no-wait flow shop scheduling problem and proposes a hybrid (HES-IG) algorithm that utilizes makespan as the objective function. To address the complexity of this NP-hard problem, the HES-IG algorithm combines evolution strategies (ES) and iterated greedy (IG) algorithm, as hybridizing…
Hannah P. Cowley, Mandy Natter, Karla Gray-Roncal, Rebecca E. Rhodes + 6 more
Rigorous comparisons of human and machine learning algorithm performance on the same task help to support accurate claims about algorithm success rates and advances understanding of their performance relative to that of human performers. In turn, these comparisons are critical for supporting advances in artificial…
Li Zhang, XiaoBo Chen
Feature selection is a critical component of machine learning and data mining to remove redundant and irrelevant features from a dataset. The Chimp Optimization Algorithm (CHoA) is widely applicable to various optimization problems due to its low number of parameters and fast convergence rate. However, CHoA has a weak…
You-hang Liu, Zai-dong Qi, Qiang Liu
Comparing the similarity between digital images is an important subroutine in various image processing algorithms. In this study, we present three quantum algorithms for comparing the similarity between two quantum images. These algorithms are applied to binary, grey and color images for the first time. Without…
Siyi Xu, Wenwen Liu, Chengpei Wu, Junli Li + 1 more
The No Free Lunch Theorem tells us that no algorithm can beat other algorithms on all types of problems. The algorithm selection structure is proposed to select the most suitable algorithm from a set of algorithms for an unknown optimization problem. This paper introduces an innovative algorithm selection approach…
Mohammad Abdur Rob, Md. Zakir Hossen, Md. Kamal Hossen, Md. Mithun Ali + 2 more
Sorting algorithms play a crucial role in computing, but most are designed with rigid structure that are only efficient under certain conditions. Although some sorting algorithms perform well in some circumstances, they do not perform well on some resistant platforms. This study introduces Wall-L Merge Sort, which…
Mohammed Alaa Ala’anzy, Nurdaulet Tolendi, Baizhan Baubek, Abdulmohsen Algarni + 1 more
Sorting can be approached in two main ways: sequentially and in parallel. In sequential sorting, data is processed in a single-threaded manner, which can be slow for large datasets. However, parallel sorting divides the task across multiple processing units, enabling faster results by processing data simultaneously.…
Yidi Hao, Baodong Qin, Yitian Sun, Jose Manuel Molina López
Due to the rapid development of machine-learning technology, companies can build complex models to provide prediction or classification services for customers without resources. A large number of related solutions exist to protect the privacy of models and user data. However, these efforts require costly communication…
Zhen Shang, Jin-Kao Hao, Fei Ma, Daniele D’Agostino
Product development projects usually contain many interrelated activities with complex information dependences, which induce activity rework, project delay and cost overrun. To reduce negative impacts, scheduling interrelated activities in an appropriate sequence is an important issue for project managers. This study…