Jaya: An Advanced Optimization Algorithm and its Engineering Applications
DOI10.1007/978-3-319-78922-4zbMATH Open1401.90276OpenAlexW2810488531MaRDI QIDQ3174850FDOQ3174850
Publication date: 18 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78922-4
metaheuristicsconstrained optimizationunconstrained optimizationmulti-objective optimizationpopulation-based algorithmsparameter-free algorithmsingle-optimization
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Algorithms in computer science (68W99)
Cited In (6)
- Generalisation of a quadrilateral duality theorem
- Uncertain multi-objective multi-route shortest path problem by robust enhanced non-dominated sorting genetic algorithms: application to emergency medical services
- Joint optimization of production scheduling and group preventive maintenance planning in multi-machine systems
- Enhanced non-dominated sorting genetic algorithms for uncertain multi-objective shortest path problem: application to fire prevention services
- Solution of uncertain constrained multi-objective travelling salesman problem with aspiration level based multi objective quasi oppositional Jaya algorithm
- Title not available (Why is that?)
Recommendations
- Efficiency of Jaya algorithm for solving the optimization-based structural damage identification problem based on a hybrid objective function 👍 👎
- A hybrid Jaya algorithm for reliability–redundancy allocation problems 👍 👎
- An algorithm for computationally expensive engineering optimization problems 👍 👎
- A novel hybrid algorithm for solving multiobjective optimization problems with engineering applications 👍 👎
- An enhanced hybrid arithmetic optimization algorithm for engineering applications 👍 👎
This page was built for publication: Jaya: An Advanced Optimization Algorithm and its Engineering Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174850)