Results 21 to 30 of about 20,360 (272)
Satellite downlink scheduling problem: A case study [PDF]
The synthetic aperture radar (SAR) technology enables satellites to efficiently acquire high quality images of the Earth surface. This generates significant communication traffic from the satellite to the ground stations, and, thus, image downlinking ...
Abraham P. Punnen +34 more
core +2 more sources
New heuristics and meta-heuristics for the Bandpass problem
The Bandpass problem (BP), modelled by Babayev et al., is a combinatorial optimization problem arising in optical communication networks using wavelength division multiplexing technology.
Arif Gursoy +3 more
doaj +1 more source
PHH: Policy-Based Hyper-Heuristic With Reinforcement Learning
Hyper-heuristics have a high level of generality and adaptability, allowing them to effectively solve a wide range of complex optimization problems.
Orachun Udomkasemsub +2 more
doaj +1 more source
Scheduling Mandatory-Optional Real-Time Tasks in Homogeneous Multi-Core Systems with Energy Constraints Using Bio-Inspired Meta-Heuristics [PDF]
In this paper we present meta-heuristics to solve the energy aware reward based scheduling of real-time tasks with mandatory and optional parts in homogeneous multi-core processors. The problem is NP-Hard.
Matias Micheletto +2 more
doaj +3 more sources
Problem Solving in Crowd Management Using Heuristic Approach
There are many problems that procedural algorithms can solve efficiently. However, these algorithms are sometimes too slow to abide by the time available for performing the solution; other times, it is impossible to get a solution using procedural ...
Ali M. Al-Shaery +4 more
doaj +1 more source
Reconfigurable manufacturing systems (RMS) are capable of adjusting their operating point to the requirements of current customer demand with high degrees of freedom.
Behrendt, Sebastian +6 more
doaj +1 more source
Meta-heuristics and Artificial Intelligence [PDF]
Meta-heuristics are generic search methods that are used to solve challenging combinatorial problems. We describe these methods and highlight their common features and differences by grouping them in two main kinds of approaches: Perturbative meta-heuristics that build new combinations by modifying existing combinations (such as, for example, genetic ...
Hao, Jin-Kao, Solnon, Christine
openaire +2 more sources
Meta-Heuristics: An Overview [PDF]
Meta-heuristics are the most recent development in approximate search methods for solving complex optimization problems, that arise in business, commerce, engineering, industry, and many other areas. A meta-heuristic guides a subordinate heuristic using concepts derived from artificial intelligence, biological, mathematical, natural and physical ...
Ibrahim H. Osman, James P. Kelly
openaire +1 more source
An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the ...
Alexandre Silvestre FERREIRA +2 more
doaj +1 more source
Scheduling for Additive Manufacturing: a literature review
: Advancements in production technologies and materials have facilitated the use of additive manufacturing (AM) (i.e., 3D printing) in the large-scale production of finished products with high level of customization, simplification of the factory floor ...
Gabriela Dall’Agnol +2 more
doaj +1 more source

