Results 21 to 30 of about 36,801 (217)

Metaheuristic approaches for optimal broadcasting design in metropolitan MANETs [PDF]

open access: yes, 2007
11th International Conference on Computer Aided Systems Theory. Las Palmas de Gran Canaria, Spain, February 12-16, 2007Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any
Alba, Enrique   +11 more
core   +2 more sources

Embedded Learning Approaches in the Whale Optimizer to Solve Coverage Combinatorial Problems

open access: yesMathematics, 2022
When we face real problems using computational resources, we understand that it is common to find combinatorial problems in binary domains. Moreover, we have to take into account a large number of possible candidate solutions, since these can be numerous
Marcelo Becerra-Rozas   +6 more
doaj   +1 more source

Accelerated Particle Swarm Optimization and Support Vector Machine for Business Optimization and Applications [PDF]

open access: yes, 2011
Business optimization is becoming increasingly important because all business activities aim to maximize the profit and performance of products and services, under limited resources and appropriate constraints.
A. Chatterjee   +23 more
core   +1 more source

Towards a Generalised Metaheuristic Model for Continuous Optimisation Problems

open access: yesMathematics, 2020
Metaheuristics have become a widely used approach for solving a variety of practical problems. The literature is full of diverse metaheuristics based on outstanding ideas and with proven excellent capabilities.
Jorge M. Cruz-Duarte   +5 more
doaj   +1 more source

Addressing the 5G cell switch-off problem with a multi-objective cellular genetic algorithm [PDF]

open access: yes, 2018
© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new ...
Luna, Francisco   +4 more
core   +1 more source

Trigonometric words ranking model for spam message classification

open access: yesIET Networks, EarlyView., 2022
Abstract The significant increase in the volume of fake (spam) messages has led to an urgent need to develop and implement a robust anti‐spam method. Several of the current anti‐spam systems depend mainly on the word order of the message in determining the spam message, which results in the system's inability to predict the correct type of message when
Suha Mohammed Hadi   +7 more
wiley   +1 more source

Hybrid Metaheuristics for Multi-Objective Optimization

open access: yesJournal of Algorithms & Computational Technology, 2015
Over the last two decades, interest on hybrid metaheuristics has risen considerably in the field of multi-objective optimization (MOP). The best results found for many real-life or academic multi-objective optimization problems are obtained by hybrid ...
E-G. Talbi
doaj   +1 more source

A beam-search-based constructive heuristic for the PFSP to minimise total flowtime [PDF]

open access: yes, 2017
In this paper we present a beam-search-based constructive heuristic to solve the permutation flowshop scheduling problem with total flowtime minimisation as objective.
Fernández-Viagas Escudero, Víctor   +1 more
core   +1 more source

Joint power control and user grouping mechanism for efficient uplink non‐orthogonal multiple access‐based 5G communication: Utilising the Lèvy‐flight firefly algorithm

open access: yesIET Networks, EarlyView., 2023
We utilise a metaheuristic optimisation method, inspired by nature, called the Lévy‐flight firefly algorithm (LFA), to tackle the power regulation and user grouping in the NOMA systems. Abstract The non‐orthogonal multiple access strategies have shown promise to boost fifth generation and sixth generation wireless networks' spectral efficiency and ...
Zaid Albataineh   +4 more
wiley   +1 more source

Metaheuristics for optimizing unrelated parallel machines scheduling with unreliable resources to minimize makespan

open access: yesAdvances in Mechanical Engineering, 2022
Parallel machines scheduling problems with continuous availability of machines are NP-hardness (non-deterministic polynomial-time hardness) and have become very popular for the last decade; there is still very limited literature on this problem.
Husam Kaid   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy