Browsing Heuristic Optimization by Title
Now showing items 1-20 of 95
-
A modeling framework for optimizing the flow-level scheduling with time-varying channels
(2010-12-31)We introduce a comprehensive modeling framework for the problem of scheduling a finite number of finite-length jobs where the available service rate is time-varying. The main motivation comes from wireless data networks ... -
A nearly-optimal index rule for scheduling of users with abandonment
(2011-12-31)We analyze a comprehensive model for multi-class job scheduling accounting for user abandonment, with the objective of minimizing the total discounted or time-average sum of linear holding costs and abandonment penalties. ... -
An ACO-based Hyper-heuristic for Sequencing Many-objective Evolutionary Algorithms that Consider Different Ways to Incorporate the DM's Preferences
Rivera, G.; Cruz-Reyes, L.; Fernández, E.; Gomez-Santillan, C.; Rangel-Valdez, N.; Coello, C.A.
(2023-02-01)
Many-objective optimization is an area of interest common to researchers, professionals, and practitioners because of its real-world implications. Preference incorporation into Multi-Objective Evolutionary Algorithms (MOEAs) ... -
AdaSwarm: Augmenting Gradient-Based Optimizers in Deep Learning with Swarm Intelligence
Mohapatra, R.; Saha, S.; Coello, C.A.; Bhattacharya, A.; Dhavala, S. S.; Saha, S. (2022-04-01)
This paper introduces AdaSwarm, a novel gradient-free optimizer which has similar or even better performance than the Adam optimizer adopted in neural networks. In order to support our proposed AdaSwarm, a novel Exponentially ... -
An Analysis of Coalition-Competition Pricing Strategies for Multi-Operator Mobile Traffic Offloading using Bi-objective Heuristics
Consul, J.; Perfecto, C.; Del Ser, J.; Bilbao, M.N. (2017)
In a competitive market relationships between telecommuni- cations operators serving simultaneously over a certain geographical area are diverse and motivated by very different business strategies and goals. Such relationships ... -
Asymptotically optimal parallel resource assignment with interference
(2010-12-31)Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous service requirement distributions. The aggregate ... -
AT-MFCGA: An Adaptive Transfer-guided Multifactorial Cellular Genetic Algorithm for Evolutionary Multitasking
Osaba, E.; Del Ser, J.; Martínez, A.D.; Lobo, J.L.; Herrera, F. (2021-09-01)
Transfer Optimization is an incipient research area dedicated to solving multiple optimization tasks simultaneously. Among the different approaches that can address this problem effectively, Evolutionary Multitasking resorts ... -
CCN interest forwarding strategy as Multi-Armed Bandit model with delays
(2012-12-31)We consider Content Centric Network (CCN) interest forwarding problem as a Multi-Armed Bandit (MAB) problem with delays. We investigate the transient behaviour of the ε-greedy, tuned ε-greedy and Upper Confidence Bound ... -
Closed queueing networks under congestion: Nonbottleneck independence and bottleneck convergence
(2013-12-31)We analyze the behavior of closed multiclass product-form queueing networks when the number of customers grows to infinity and remains proportionate on each route (or class). First, we focus on the stationary behavior and ... -
COARSE-EMOA: An indicator-based evolutionary algorithm for solving equality constrained multi-objective optimization problems
Llano García, J.L.; Monroy, R.; Sosa Hernández, V.A.; Coello, C.A. (2021-12-01)
Many real-world applications involve dealing with several conflicting objectives which need to be optimized simultaneously. Moreover, these problems may require the consideration of limitations that restrict their decision ... -
Community Detection in Networks using Bio-inspired Optimization: Latest Developments, New Results and Perspectives with a Selection of Recent Meta-Heuristics
Osaba, E.; Del Ser, J.; Camacho, D.; Nekane Bilbao, M.N.; Yange, X.-S. (2019)
Detecting groups within a set of interconnected nodes is a widely addressed prob- lem that can model a diversity of applications. Unfortunately, detecting the opti- mal partition of a network is a computationally demanding ... -
Comparative study of pheromone control heuristics in ACO algorithms for solving RCPSP problems
Gonzalez-Pardo, A.; Del Ser, J.; Camacho, D. (2017-11)
Constraint Satisfaction Problems (CSP) belong to a kind of traditional NP-hard problems with a high impact on both research and industrial domains. The goal of these problems is to find a feasible assignment for a group ... -
Competition yields efficiency in load balancing games
(2011-12-31)We study a nonatomic congestion game with N parallel links, with each link under the control of a profit maximizing provider. Within this 'load balancing game', each provider has the freedom to set a price, or toll, for ... -
Congestion control of TCP flows in Internet routers by means of index policy
(2013-12-31)In this paper we address the problem of fast and fair transmission of flows in a router, which is a fundamental issue in networks like the Internet. We model the interaction between a source using the Transmission Control ... -
A convergence and diversity guided leader selection strategy for many-objective particle swarm optimization
Li, L.; Li, Y.; Lin, Q.; Ming, Z.; Coello, C.A. (2022-10-01)
Recently, particle swarm optimizer (PSO) is extended to solve many-objective optimization problems (MaOPs) and becomes a hot research topic in the field of evolutionary computation. Particularly, the leader particle selection ... -
Convergence of trajectories and optimal buffer sizing for AIMD congestion control
(2010-12-31)We study the interaction between the AIMD (Additive Increase Multiplicative Decrease) multi-socket congestion control and a bottleneck router with Drop Tail buffer. We consider the problem in the framework of deterministic ... -
Convergence of trajectories and optimal buffer sizing for MIMD congestion control
(2010-12-31)We study the interaction between the MIMD (Multiplicative Increase Multiplicative Decrease) congestion control and a bottleneck router with Drop Tail buffer. We consider the problem in the framework of deterministic hybrid ... -
Cost-efficient deployment of multi-hop wireless networks over disaster areas using multi-objective meta-heuristics
Bilbao, M.N.; Del Ser, J.; Perfecto, C.; Salcedo-Sanz, S.; Portilla-Figueras, J.A. (2017-07)
Nowadays there is a global concern with the growing frequency and magnitude of natural disasters, many of them associated with climate change at a global scale. When tackled during a stringent economic era, the allocation ... -
Cost-efficient Selective Network Caching in Large-Area Vehicular Networks using Multi-objective Heuristics
Perfecto, C.; Bilbao, M.N.; Del Ser, J. (2017)
In the last decade the interest around network caching tech- niques has augmented notably for alleviating the ever-growing demand of resources by end users in mobile networks. This gained momentum stems from the fact that ... -
CURIE: a cellular automaton for concept drift detection
Lobo, J.L.; Del Ser, J.; Osaba, E.; Bifet, A.; Herrera, F. (2021-11-01)
Data stream mining extracts information from large quantities of data flowing fast and continuously (data streams). They are usually affected by changes in the data distribution, giving rise to a phenomenon referred to as ...