An Enhancement of Cuckoo Search Algorithm for Optimal Earthquake Evacuation Space Allocation in Intramuros, Manila City

• URL: http://arxiv.org/abs/2502.13477v1
• Date: Wed, 19 Feb 2025 07:01:23 GMT
• Title: An Enhancement of Cuckoo Search Algorithm for Optimal Earthquake Evacuation Space Allocation in Intramuros, Manila City
• Abstract summary: Enhanced Cuckoo Search Algorithm (ECSA) is proposed to solve complex optimization problems.<n>The performance of the algorithms was evaluated on 13 benchmark functions.<n>The ECSA is subsequently applied to optimize earthquake evacuation space allocation in Intramuros, Manila.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Cuckoo Search Algorithm (CSA), while effective in solving complex optimization problems, faces limitations in random population initialization and reliance on fixed parameters. Random initialization of the population often results in clustered solutions, resulting in uneven exploration of the search space and hindering effective global optimization. Furthermore, the use of fixed values for discovery rate and step size creates a trade-off between solution accuracy and convergence speed. To address these limitations, an Enhanced Cuckoo Search Algorithm (ECSA) is proposed. This algorithm utilizes the Sobol Sequence to generate a more uniformly distributed initial population and incorporates Cosine Annealing with Warm Restarts to dynamically adjust the parameters. The performance of the algorithms was evaluated on 13 benchmark functions (7 unimodal, 6 multimodal). Statistical analyses were conducted to determine the significance and consistency of the results. The ECSA outperforms the CSA in 11 out of 13 benchmark functions with a mean fitness improvement of 30% across all functions, achieving 35% for unimodal functions and 24% for multimodal functions. The enhanced algorithm demonstrated increased convergence efficiency, indicating its superiority to the CSA in solving a variety of optimization problems. The ECSA is subsequently applied to optimize earthquake evacuation space allocation in Intramuros, Manila.

Related papers

• A Dynamic Aggregation Strategy Enhanced Efficient Global Optimization Algorithm for Solving High-Dimensional Turbomachinery Design Problems [6.032951573010597]
  An efficient global optimization (EGO) algorithm with a dynamic aggregation strategy is proposed, labeled as DA-EGO.<n>Specifically, the DA-EGO decomposes the original high-dimensional design space into a set of low-dimensional subspaces for efficient surrogate-based optimization search.<n>Tests on 21 benchmark instances, comprising seven functions at 30, 60, and 90 dimensions, show that DA-EGO is effective on separable and partially separable problems under a budget of 1500 function evaluations.
  arXiv  Detail & Related papers  (2026-09-13T13:46:57Z)
• optimize_anything: A Universal API for Optimizing any Text Parameter [98.42497715725356]
  We show a single AI-based optimization system-supporting single-task search, multi-task search with cross-problem transfer, and generalization to unseen inputs.<n>We show for the first time that text optimization with LLM-based search is a general-purpose problem-solving paradigm.
  arXiv  Detail & Related papers  (2026-05-19T10:18:12Z)
• Bandits attack function optimization [30.108594392153744]
  We consider an algorithm inspired by a continuous version of a multi-armed bandit problem which attacks this optimization problem.<n>We introduce the so-called Simultaneous Optimistic Optimization (SOO), a deterministic algorithm that works by domain partitioning.<n>We present this machine learning approach to optimization, and provide the empirical assessment of SOO on the CEC'2014 competition.
  arXiv  Detail & Related papers  (2026-05-05T08:33:44Z)
• Hyperparameter Optimization of Constraint Programming Solvers [2.4915743991417547]
  We introduce probe and solve algorithm, a framework for automated hyperparameter optimization integrated into the CPMpy library.<n>We evaluate the algorithm on two different constraint solvers, ACE and Choco, across 114 problem instances.<n>Results show that using Bayesian optimization, the algorithm outperforms the solver's default configurations.
  arXiv  Detail & Related papers  (2026-01-16T16:02:36Z)
• Local Entropy Search over Descent Sequences for Bayesian Optimization [48.7994415668802]
  A practical alternative is to iteratively refine the neighborhood of an initial design using local optimization methods such as gradient descent.<n>We propose local entropy search (LES), a Bayesian optimization paradigm that explicitly targets the solutions reachable by the descent sequences.
  arXiv  Detail & Related papers  (2025-11-24T15:52:17Z)
• A multi-strategy improved gazelle optimization algorithm for solving numerical optimization and engineering applications [0.09320657506524145]
  This paper proposes a multi-strategy improved gazelle optimization algorithm (MSIGOA)<n>Two adaptive parameter tuning strategies improve the applicability of the algorithm and promote a smoother optimization process.<n>The dominant population-based restart strategy enhances the algorithms ability to escape from local optima and avoid its premature convergence.
  arXiv  Detail & Related papers  (2025-09-08T20:44:15Z)
• Accelerating Spectral Clustering under Fairness Constraints [56.865810822418744]
  We present a new efficient method for fair spectral clustering (Fair SC) by casting the Fair SC problem within the difference of convex functions (DC) framework.<n>We show that each associated subproblem can be solved efficiently, resulting in higher computational efficiency compared to prior work.
  arXiv  Detail & Related papers  (2025-06-09T18:46:27Z)
• Adam assisted Fully informed Particle Swarm Optimization ( Adam-FIPSO ) based Parameter Prediction for the Quantum Approximate Optimization Algorithm (QAOA) [1.024113475677323]
  The Quantum Approximate Optimization Algorithm (QAOA) is a prominent variational algorithm used for solving optimization problems such as the Max-Cut problem.<n>A key challenge in QAOA lies in efficiently identifying suitable parameters that lead to high-quality solutions.
  arXiv  Detail & Related papers  (2025-06-07T13:14:41Z)
• Evaluation and Efficiency Comparison of Evolutionary Algorithms for Service Placement Optimization in Fog Architectures [1.3723120574076126]
  The study compares three evolutionary algorithms for the problem of fog service placement.<n>NSGA-II obtained the highest optimizations of the objectives and the highest diversity of the solution space.<n>The WSGA algorithm did not show any benefit with regard to the other two algorithms.
  arXiv  Detail & Related papers  (2025-01-17T05:21:00Z)
• Scattered Forest Search: Smarter Code Space Exploration with LLMs [55.71665969800222]
  We propose SCATTERED FOREST SEARCH (SFS), a novel approach that improves solution diversity and better exploits feedback during evolutionary search. Our approach scales more efficiently than existing search techniques, including tree search, line search, and repeated sampling.
  arXiv  Detail & Related papers  (2024-10-22T01:58:29Z)
• Testing the Efficacy of Hyperparameter Optimization Algorithms in Short-Term Load Forecasting [0.0]
  We use the Panama Electricity dataset to evaluate HPO algorithms' performances on a surrogate forecasting algorithm, XGBoost, in terms of accuracy (i.e., MAPE, $R2$) and runtime. Results reveal significant runtime advantages for HPO algorithms over Random Search.
  arXiv  Detail & Related papers  (2024-10-19T09:08:52Z)
• Stabilized Proximal-Point Methods for Federated Optimization [20.30761752651984]
  Best-known communication complexity among non-accelerated algorithms is achieved by DANE, a distributed proximal-point algorithm. Inspired by the hybrid-projection proximal-point method, we propose a novel distributed algorithm S-DANE. We show that S-DANE achieves the best-known communication complexity while still enjoying good local computation efficiency as S-DANE.
  arXiv  Detail & Related papers  (2024-07-09T17:56:29Z)
• Hyperparameter Adaptive Search for Surrogate Optimization: A Self-Adjusting Approach [1.6317061277457001]
  Surrogate optimization (SO) algorithms have shown promise for optimizing expensive black-box functions. Our approach identifies and modifies the most influential hyper parameters specific to each problem and SO approach. Experimental results demonstrate the effectiveness of HASSO in enhancing the performance of various SO algorithms.
  arXiv  Detail & Related papers  (2023-10-12T01:26:05Z)
• Efficient Convex Algorithms for Universal Kernel Learning [46.573275307034336]
  An ideal set of kernels should: admit a linear parameterization (for tractability); dense in the set of all kernels (for accuracy) Previous algorithms for optimization of kernels were limited to classification and relied on computationally complex Semidefinite Programming (SDP) algorithms. We propose a SVD-QCQPQP algorithm which dramatically reduces the computational complexity as compared with previous SDP-based approaches.
  arXiv  Detail & Related papers  (2023-04-15T04:57:37Z)
• Massively Parallel Genetic Optimization through Asynchronous Propagation of Populations [50.591267188664666]
  Propulate is an evolutionary optimization algorithm and software package for global optimization. We provide an MPI-based implementation of our algorithm, which features variants of selection, mutation, crossover, and migration. We find that Propulate is up to three orders of magnitude faster without sacrificing solution accuracy.
  arXiv  Detail & Related papers  (2023-01-20T18:17:34Z)
• Exploring the Algorithm-Dependent Generalization of AUPRC Optimization with List Stability [107.65337427333064]
  optimization of the Area Under the Precision-Recall Curve (AUPRC) is a crucial problem for machine learning. In this work, we present the first trial in the single-dependent generalization of AUPRC optimization. Experiments on three image retrieval datasets on speak to the effectiveness and soundness of our framework.
  arXiv  Detail & Related papers  (2022-09-27T09:06:37Z)
• Tree ensemble kernels for Bayesian optimization with known constraints over mixed-feature spaces [54.58348769621782]
  Tree ensembles can be well-suited for black-box optimization tasks such as algorithm tuning and neural architecture search. Two well-known challenges in using tree ensembles for black-box optimization are (i) effectively quantifying model uncertainty for exploration and (ii) optimizing over the piece-wise constant acquisition function. Our framework performs as well as state-of-the-art methods for unconstrained black-box optimization over continuous/discrete features and outperforms competing methods for problems combining mixed-variable feature spaces and known input constraints.
  arXiv  Detail & Related papers  (2022-07-02T16:59:37Z)
• Large-scale Optimization of Partial AUC in a Range of False Positive Rates [51.12047280149546]
  The area under the ROC curve (AUC) is one of the most widely used performance measures for classification models in machine learning. We develop an efficient approximated gradient descent method based on recent practical envelope smoothing technique. Our proposed algorithm can also be used to minimize the sum of some ranked range loss, which also lacks efficient solvers.
  arXiv  Detail & Related papers  (2022-03-03T03:46:18Z)
• Duck swarm algorithm: theory, numerical optimization, and applications [6.244015536594532]
  A swarm intelligence-based optimization algorithm, named Duck Swarm Algorithm (DSA), is proposed in this study. Two rules are modeled from the finding food and foraging of the duck, which corresponds to the exploration and exploitation phases of the proposed DSA. Results show that DSA is a high-performance optimization method in terms of convergence speed and exploration-exploitation balance.
  arXiv  Detail & Related papers  (2021-12-27T04:53:36Z)
• An Accelerated Variance-Reduced Conditional Gradient Sliding Algorithm for First-order and Zeroth-order Optimization [111.24899593052851]
  Conditional gradient algorithm (also known as the Frank-Wolfe algorithm) has recently regained popularity in the machine learning community. ARCS is the first zeroth-order conditional gradient sliding type algorithms solving convex problems in zeroth-order optimization. In first-order optimization, the convergence results of ARCS substantially outperform previous algorithms in terms of the number of gradient query oracle.
  arXiv  Detail & Related papers  (2021-09-18T07:08:11Z)
• A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance [16.0251555430107]
  This is the first GP-based algorithm with an order-optimal regret guarantee. Compared with the prevailing GP-UCB family of algorithms, the proposed algorithm reduces computational complexity by a factor of $O(T2d-1)$.
  arXiv  Detail & Related papers  (2020-10-27T02:15:15Z)

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.