Search Results

Now showing 1 - 3 of 3

Some of the metrics are blocked by your
consent settings
Review on recent implementations of multiobjective and multilevel optimization in sustainable energy economics
(2022)
Ganesan, Timothy
;
Litvinchev, Igor
;
Marmolejo Saucedo, José Antonio
;
Thomas, J. Joshua
;
Vasant, Pandian
Rapid progress is currently being made globally in the sustainable energy industry. This trend has been seen to concentrate on specific focus areas in the global energy ecosystem. The integration of sustainability ideas into the existing energy ecosystem has given rise to various complexities, e.g., multilevel and multiobjective (MO) scenarios. This in return has generated various avenues for the implementation of mathematical optimization as well as state-of-the-art operations research methodologies on such real-world systems. This chapter aims to provide a concise review on recent implementations of MO and multilevel optimization on sustainable energy economic systems. Three key industrial areas are given emphasis—economic load/emission dispatch, bioenergy supply chains, and sustainable capacity planning. © 2022 Elsevier Inc. All rights reserved.
Scopus© Citations 1 18 1
Some of the metrics are blocked by your
consent settings
Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container
(2018)
Torres-Escobar, Rafael
;
Marmolejo Saucedo, José Antonio
;
Litvinchev, Igor
A Packing problem consists in the best arrangement of several objects inside a bounded area named as the container. This arrangement must fulfill with technological constraints, for example, objects should not be overlapping. Some packing models for circular objects are typically formulated as non-convex optimization problems; where the continuous variables are the coordinates of the objects, so they are limited to not finding optimal solutions. Due to the combinatorial nature in the arrangement of such objects, heuristic methods are being used extensively which combine methods of global search and methods of local exhaustive search of local minima or their approximations. In this paper, we will address the packing problem for non-congruent (different size) circles with the binary version of the monkey algorithm which incorporates a cooperation process and a greedy strategy. We use a rectangular grid for covering the container. Every node in the grid represent potential positions for a circle. In this sense, binary monkey algorithm for the knapsack problem, can be used to solve de 0–1 approximate packing problem for non-congruet circles. The binary monkey problem uses two additional processes of the original monkey algorithm, these two processes are a greedy process and a cooperation processes. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.
Scopus© Citations 23 12 1
Some of the metrics are blocked by your
consent settings
Quantum-behaved bat algorithm for solving the economic load dispatch problem considering a valve-point effect
(2020)
Vasant, Pandian
;
Parvez Mahdi, Fahad
;
Marmolejo Saucedo, José Antonio
;
Litvinchev, Igor
;
Quantum computing-inspired metaheuristic algorithms have emerged as a powerful computational tool to solve nonlinear optimization problems. In this paper, a quantum-behaved bat algorithm (QBA) is implemented to solve a nonlinear economic load dispatch (ELD) problem. The objective of ELD is to find an optimal combination of power generating units in order to minimize total fuel cost of the system, while satisfying all other constraints. To make the system more applicable to the real-world problem, a valve-point effect is considered here with the ELD problem. QBA is applied in 3-unit, 10-unit, and 40-unit power generation systems for different load demands. The obtained result is then presented and compared with some well-known methods from the literature such as different versions of evolutionary programming (EP) and particle swarm optimization (PSO), genetic algorithm (GA), differential evolution (DE), simulated annealing (SA) and hybrid ABC_PSO. The comparison of results shows that QBA performs better than the above-mentioned methods in terms of solution quality, convergence characteristics and computational efficiency. Thus, QBA proves to be an effective and a robust technique to solve such nonlinear optimization problem.
Scopus© Citations 7 16 2

CRIS

Browse

Filters

Settings

Sort By

Results per page

Search Results