paper-with-me

홈 › Papers

Semi-steady-state Jaya Algorithm

2020-07-13 · Uday K. Chakraborty

The Jaya algorithm is arguably one of the fastest-emerging metaheuristics amongst the newest members of the evolutionary computation family. The present paper proposes a new, improved Jaya algorithm by modifying the update strategies of the best and the worst members in the population. Simulation results on a twelve-function benchmark test-suite as well as a real-world problem of practical importance show that the proposed strategy produces results that are better and faster in the majority of cases. Statistical tests of significance are used to validate the performance improvement.

📄 PDF Abstract BibTeX arXiv:2007.06463

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Stochastic models of Jaya and semi-steady-state Jaya algorithms

2022-02-14 · Uday K. Chakraborty

We build stochastic models for analyzing Jaya and semi-steady-state Jaya algorithms. The analysis shows that for semi-steady-state Jaya (a) the maximum expected value of the number of worst-index updates per generation i…

Jaya R Package -- A Parameter-Free Solution for Advanced Single and Multi-Objective Optimization

2024-11-25 · Neeraj Dhanraj Bokde

The Jaya R package offers a robust and versatile implementation of the parameter-free Jaya optimization algorithm, suitable for solving both single-objective and multi-objective optimization problems. By integrating adva…

Computational EfficiencyManagement

Optimal scheduling of isolated microgrid with an electric vehicle battery swapping station in multi-stakeholder scenarios: a bi-level programming approach via real-time pricing

2018-09-26

In order to coordinate the scheduling problem between an isolated microgrid (IMG) and electric vehicle battery swapping stations (BSSs) in multi-stakeholder scenarios, a new bi-level optimal scheduling model is proposed …

Scheduling

A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering

2024-06-07 · Vincent Cohen-Addad, Tommaso d'Orsi, Aida Mousavifar

We consider the semi-random graph model of [Makarychev, Makarychev and Vijayaraghavan, STOC'12], where, given a random bipartite graph with $\alpha$ edges and an unknown bipartition $(A, B)$ of the vertex set, an adversa…

ClusteringGraph ClusteringStochastic Block Model

Stochastic optimal scheduling of demand response-enabled microgrids with renewable generations: An analytical-heuristic approach

2021-11-24 · Yang Li, Kang Li, Zhen Yang, Yang Yu 외

In the context of transition towards cleaner and sustainable energy production, microgrids have become an effective way for tackling environmental pollution and energy crisis issues. With the increasing penetration of re…

Scheduling