An Improved BAT Algorithm for Solving Job Scheduling Problems in Hotels
and Restaurants
- URL: http://arxiv.org/abs/2109.14441v1
- Date: Sun, 25 Jul 2021 09:46:52 GMT
- Title: An Improved BAT Algorithm for Solving Job Scheduling Problems in Hotels
and Restaurants
- Authors: Tarik A. Rashid, Chra I. Shekho Toghramchi, Heja Sindi, Abeer
Alsadoon, Nebojsa Bacanin, Shahla U. Umar, A.S. Shamsaldin, Mokhtar Mohammadi
- Abstract summary: The Bat algorithm (BA) is a popular example of metaheuristic algorithms from the swarm intelligence family.
In this paper, an improvement on the original BA has been made to speed up convergence and make the method more practical for large applications.
The modified BA was applied to solve a real-world job scheduling problem in hotels and restaurants.
- Score: 12.641474799416772
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: One popular example of metaheuristic algorithms from the swarm intelligence
family is the Bat algorithm (BA). The algorithm was first presented in 2010 by
Yang and quickly demonstrated its efficiency in comparison with other common
algorithms. The BA is based on echolocation in bats. The BA uses automatic
zooming to strike a balance between exploration and exploitation by imitating
the deviations of the bat's pulse emission rate and loudness as it searches for
prey. The BA maintains solution diversity using the frequency-tuning technique.
In this way, the BA can quickly and efficiently switch from exploration to
exploitation. Therefore, it becomes an efficient optimizer for any application
when a quick solution is needed. In this paper, an improvement on the original
BA has been made to speed up convergence and make the method more practical for
large applications. To conduct a comprehensive comparative analysis between the
original BA, the modified BA proposed in this paper, and other state-of-the-art
bio-inspired metaheuristics, the performance of both approaches is evaluated on
a standard set of 23 (unimodal, multimodal, and fixed-dimension multimodal)
benchmark functions. Afterward, the modified BA was applied to solve a
real-world job scheduling problem in hotels and restaurants. Based on the
achieved performance metrics, the proposed MBA establishes better global search
ability and convergence than the original BA and other approaches.
Related papers
- A Performance Analysis of Basin Hopping Compared to Established
Metaheuristics for Global Optimization [2.209921757303168]
We perform numerical experiments using the IOH profiler environment with the BBOB test function set and two difficult real-world problems.
Results show that Basin Hopping can be considered a good candidate for global numerical optimization problems along with the more established metaheuristics.
arXiv Detail & Related papers (2024-03-09T11:02:47Z) - Surpassing legacy approaches to PWR core reload optimization with single-objective Reinforcement learning [0.0]
We have developed methods based on Deep Reinforcement Learning (DRL) for both single- and multi-objective optimization.
In this paper, we demonstrate the advantage of our RL-based approach, specifically using Proximal Policy Optimization (PPO)
PPO adapts its search capability via a policy with learnable weights, allowing it to function as both a global and local search method.
arXiv Detail & Related papers (2024-02-16T19:35:58Z) - Poisson Process for Bayesian Optimization [126.51200593377739]
We propose a ranking-based surrogate model based on the Poisson process and introduce an efficient BO framework, namely Poisson Process Bayesian Optimization (PoPBO)
Compared to the classic GP-BO method, our PoPBO has lower costs and better robustness to noise, which is verified by abundant experiments.
arXiv Detail & Related papers (2024-02-05T02:54:50Z) - A Stable, Fast, and Fully Automatic Learning Algorithm for Predictive
Coding Networks [65.34977803841007]
Predictive coding networks are neuroscience-inspired models with roots in both Bayesian statistics and neuroscience.
We show how by simply changing the temporal scheduling of the update rule for the synaptic weights leads to an algorithm that is much more efficient and stable than the original one.
arXiv Detail & Related papers (2022-11-16T00:11:04Z) - HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection [75.84584400866254]
We propose a new algorithm selector leveraging special forests, combining the strengths of both approaches while alleviating their weaknesses.
HARRIS' decisions are based on a forest model, whose trees are created based on optimized on a hybrid ranking and regression loss function.
arXiv Detail & Related papers (2022-10-31T14:06:11Z) - A Parallel Technique for Multi-objective Bayesian Global Optimization:
Using a Batch Selection of Probability of Improvement [2.1055643409860743]
This paper proposes five alternatives of emphProbability of Improvement (PoI) with multiple points in a batch.
Two experiments on different variety of benchmarks are conducted to demonstrate the effectiveness of two greedy q-PoIs.
arXiv Detail & Related papers (2022-08-07T09:28:44Z) - Efficient Few-Shot Object Detection via Knowledge Inheritance [62.36414544915032]
Few-shot object detection (FSOD) aims at learning a generic detector that can adapt to unseen tasks with scarce training samples.
We present an efficient pretrain-transfer framework (PTF) baseline with no computational increment.
We also propose an adaptive length re-scaling (ALR) strategy to alleviate the vector length inconsistency between the predicted novel weights and the pretrained base weights.
arXiv Detail & Related papers (2022-03-23T06:24:31Z) - Improved Branch and Bound for Neural Network Verification via Lagrangian
Decomposition [161.09660864941603]
We improve the scalability of Branch and Bound (BaB) algorithms for formally proving input-output properties of neural networks.
We present a novel activation-based branching strategy and a BaB framework, named Branch and Dual Network Bound (BaDNB)
BaDNB outperforms previous complete verification systems by a large margin, cutting average verification times by factors up to 50 on adversarial properties.
arXiv Detail & Related papers (2021-04-14T09:22:42Z) - Critical Analysis: Bat Algorithm based Investigation and Application on
Several Domains [1.1802674324027231]
The idea of the algorithm was taken from the echolocation ability of bats.
Bat Algorithm is given in-depth in terms of backgrounds, characteristics, limitations.
arXiv Detail & Related papers (2021-01-18T19:25:12Z) - Time Efficiency in Optimization with a Bayesian-Evolutionary Algorithm [13.66850118870667]
We show that not all generate-and-test search algorithms are created equal.
We propose a new algorithm, a combination of Bayesian optimization and an Evolutionary Algorithm, BEA for short, that starts with BO, then transfers knowledge to an EA, and subsequently runs the EA.
The results show that BEA outperforms both BO and the EA in terms of time efficiency, and ultimately leads to better performance on well-known benchmark objective functions with many local optima.
arXiv Detail & Related papers (2020-05-04T15:29:22Z) - Near-linear Time Gaussian Process Optimization with Adaptive Batching
and Resparsification [119.41129787351092]
We introduce BBKB, the first no-regret GP optimization algorithm that provably runs in near-linear time and selects candidates in batches.
We show that the same bound can be used to adaptively delay costly updates to the sparse GP approximation, achieving a near-constant per-step amortized cost.
arXiv Detail & Related papers (2020-02-23T17:43:29Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.