Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "metaheuristic optimization" wg kryterium: Temat


Wyświetlanie 1-10 z 10
Tytuł:
The application of different optimization techniques and Artificial Neural Networks (ANN) for coal-consumption forecasting: a case study
Zastosowanie różnych technik optymalizacji i sztucznych sieci neuronowych (SSN) do prognozowania zużycia węgla: studium przypadku
Autorzy:
Seker, Mustafa
Unal Kartal, Neslihan
Karadirek, Selin
Gulludag, Cevdet Bertan
Powiązania:
https://bibliotekanauki.pl/articles/2173847.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Instytut Gospodarki Surowcami Mineralnymi i Energią PAN
Tematy:
coal consumption
metaheuristic optimization
grey wolf optimization
particle swarm optimization
whale optimization
zużycie węgla
optymalizacja metaheurystyczna
optymalizacja szarego wilka
optymalizacja roju cząstek
optymalizacja wielorybów
Opis:
The demand for energy on a global scale increases day by day. Unlike renewable energy sources, fossil fuels have limited reserves and meet most of the world’s energy needs despite their adverse environmental effects. This study presents a new forecast strategy, including an optimization-based S-curve approach for coal consumption in Turkey. For this approach, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), Grey Wolf Optimization (GWO), and Whale Optimization Algorithm (WOA) are among the meta-heuristic optimization techniques used to determine the optimum parameters of the S-curve. In addition, these algorithms and Artificial Neural Network (ANN) have also been used to estimate coal consumption. In evaluating coal consumption with ANN, energy and economic parameters such as installed capacity, gross generation, net electric consumption, import, export, and population energy are used for input parameters. In ANN modeling, the Feed Forward Multilayer Perceptron Network structure was used, and Levenberg-Marquardt Back Propagation has used to perform network training. S-curves have been calculated using optimization, and their performance in predicting coal consumption has been evaluated statistically. The findings reveal that the optimization-based S-curve approach gives higher accuracy than ANN in solving the presented problem. The statistical results calculated by the GWO have higher accuracy than the PSO, WOA, and GA with R2 = 0.9881, RE = 0.011, RMSE = 1.079, MAE = 1.3584, and STD = 1.5187. The novelty of this study, the presented methodology does not need more input parameters for analysis. Therefore, it can be easily used with high accuracy to estimate coal consumption within other countries with an increasing trend in coal consumption, such as Turkey.
Zapotrzebowanie na energię w skali globalnej rośnie z dnia na dzień. W przeciwieństwie do odnawialnych źródeł energii, paliwa kopalne mają ograniczone rezerwy i zaspokajają większość światowego zapotrzebowania na energię pomimo ich niekorzystnego wpływu na środowisko. Niniejsze opracowanie przedstawia nową strategię prognozowania, w tym oparte na optymalizacji podejście oparte na krzywej S dla zużycia węgla w Turcji. W tym podejściu algorytmy optymalizacji genetycznej (GA) i optymalizacji roju cząstek (PSO), optymalizacja Gray Wolf (GWO) i algorytm optymalizacji wielorybów (WOA) należą do metaheurystycznych technik optymalizacji stosowanych do określenia optymalnych parametrów krzywej S. Ponadto algorytmy te oraz sztuczna sieć neuronowa (SSN) zostały również wykorzystane do oszacowania zużycia węgla. Przy ocenie zużycia węgla za pomocą SSN jako parametry wejściowe wykorzystuje się parametry energetyczne i ekonomiczne, takie jak moc zainstalowana, produkcja brutto, zużycie energii elektrycznej netto, import, eksport i energia ludności. W modelowaniu SSN wykorzystano strukturę Feed Forward Multilayer Perceptron Network, a do uczenia sieci wykorzystano propagację wsteczną Levenberg-Marquardt. Krzywe S zostały obliczone za pomocą optymalizacji, a ich skuteczność w przewidywaniu zużycia węgla została oceniona statystycznie. Wyniki pokazują, że podejście oparte na optymalizacji opartej na krzywej S zapewnia większą dokładność niż SSN w rozwiązaniu przedstawionego problemu. Wyniki statystyczne obliczone przez GWO mają wyższą dokładność niż PSO, WOA i GA z R2 = 0,9881, RE = 0,011, RMSE = 1,079, MAE = 1,3584 i STD = 1,5187. Nowość tego badania, prezentowana metodyka nie wymaga dodatkowych parametrów wejściowych do analizy. Dzięki temu może być z łatwością wykorzystany z dużą dokładnością do oszacowania zużycia węgla w innych krajach o tendencji wzrostowej zużycia węgla, takich jak Turcja.
Źródło:
Gospodarka Surowcami Mineralnymi; 2022, 38, 2; 77--112
0860-0953
Pojawia się w:
Gospodarka Surowcami Mineralnymi
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Collectively intelligent prediction in evolutionary multi-agent system
Autorzy:
Kijak, J.
Martyna, P.
Byrski, A.
Faber, Ł.
Piętak, K.
Kisiel-Dorohinicki, M.
Powiązania:
https://bibliotekanauki.pl/articles/397728.pdf
Data publikacji:
2017
Wydawca:
Politechnika Łódzka. Wydział Mikroelektroniki i Informatyki
Tematy:
evolutionary neural networks
agent-based computing
time series prediction
collective intelligence
metaheuristic optimization
ewolucyjne sieci neuronowe
obliczenia agentowe
predykcja szeregów czasowych
inteligencja zbiorowa
optymalizacja metaheurystyczna
Opis:
In the paper a summary of our previously realized and published work connected with constructing collective intelligent evolutionary multi-agent systems for time series prediction, based on multi-layered perceptrons is shown. Besides recalling our past papers, we describe the whole concept, present an implementation in a contemporary, componentoriented software framework AgE 3.0 and we conduct a number of experiments, finding different optimal parametrization for the considered instances of the problems (popular Mackey-Glass chaotic time series). The paper may be useful for a practitioner willing to use our meatheuristic algorithm (EMAS) along with the idea of collective agent-based system in order to realize prediction tasks.
Źródło:
International Journal of Microelectronics and Computer Science; 2017, 8, 3; 85-96
2080-8755
2353-9607
Pojawia się w:
International Journal of Microelectronics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improving security performance of healthcare data in the Internet of medical things using a hybrid metaheuristic model
Autorzy:
Ashok, Kanneboina
Gopikrishnan, Sundaram
Powiązania:
https://bibliotekanauki.pl/articles/24866906.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
medical information system
Internet of things
electronic medical record
information security
metaheuristic optimization
quality of service
system informacji medycznej
Internet rzeczy
elektroniczna dokumentacja medyczna
bezpieczeństwo informacji
optymalizacja metaheurystyczna
jakość usługi
Opis:
Internet of medical things (IoMT) network design integrates multiple healthcare devices to improve patient monitoring and real-time care operations. These networks use a wide range of devices to make critical patient care decisions. Thus, researchers have deployed multiple high-security frameworks with encryption, hashing, privacy preservation, attribute based access control, and more to secure these devices and networks. However, real-time monitoring security models are either complex or unreconfigurable. The existing models’ security depends on their internal configuration, which is rarely extensible for new attacks. This paper introduces a hybrid metaheuristic model to improve healthcare IoT security performance. The blockchain based model can be dynamically reconfigured by changing its encryption and hashing standards. The proposed model then continuously optimizes blockchain based IoMT deployment security and QoS performance using elephant herding optimization (EHO) and grey wolf optimization (GWO). Dual fitness functions improve security and QoS for multiple attack types in the proposed model. These fitness functions help reconfigure encryption and hashing parameters to improve performance under different attack configurations. The hybrid integration of EH and GW optimization models can tune blockchain based deployment for dynamic attack scenarios, making it scalable and useful for real-time scenarios. The model is tested under masquerading, Sybil, man-in-the-middle, and DDoS attacks and is compared with state-of-the-art models. The proposed model has 8.3% faster attack detection and mitigation, 5.9% better throughput, a 6.5% higher packet delivery ratio, and 10.3% better network consistency under attack scenarios. This performance enables real-time healthcare use cases for the proposed model.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 4; 623--636
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Gold rush optimizer : a new population-based metaheuristic algorithm
Autorzy:
Zolf, Kamran
Powiązania:
https://bibliotekanauki.pl/articles/2204102.pdf
Data publikacji:
2023
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
gold rush optimizer
metaheuristic
global optimization
population-based algorithm
Opis:
Today’s world is characterised by competitive environments, optimal resource utilization, and cost reduction, which has resulted in an increasing role for metaheuristic algorithms in solving complex modern problems. As a result, this paper introduces the gold rush optimizer (GRO), a population-based metaheuristic algorithm that simulates how gold-seekers prospected for gold during the Gold Rush Era using three key concepts of gold prospecting: migration, collaboration, and panning. The GRO algorithm is compared to twelve well-known metaheuristic algorithms on 29 benchmark test cases to assess the proposed approach’s performance. For scientific evaluation, the Friedman and Wilcoxon signed-rank tests are used. In addition to these test cases, the GRO algorithm is evaluated using three real-world engineering problems. The results indicated that the proposed algorithm was more capable than other algorithms in proposing qualitative and competitive solutions.
Źródło:
Operations Research and Decisions; 2023, 33, 1; 113--150
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimal cycle time determination and golf neighborhood generation for the cyclic flexible job shop problem
Autorzy:
Bożejko, W.
Pempera, J.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/201984.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
cyclic scheduling
metaheuristic
discrete optimization
planowanie cykliczne
metaheurystyka
dyskretna optymalizacja
Opis:
In the paper, a problem of scheduling operations in the cyclic flexible job shop system is considered. A new, very fast method of determining the cycle time for any order of tasks on machines is also presented. It is based on the analysis of the paths in the graph representing the examined problem. The theorems concerning specific properties of the graph are proven and used in the construction of the heuristic algorithm searching the solutions space by using the so-called golf neighborhood, which is generated in a way similar to the game of golf, which helps to intensify and diversify calculations. The conducted computational experiments fully confirmed the effectiveness of the proposed method. The proposed methods and properties can be adapted and used in the construction of local search algorithms for solving many other optimization problems.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 3; 333-344
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Metaheuristic optimization of marginal risk constrained long - short portfolios
Autorzy:
Vijayalakshmi Pai, G. A.
Michel, T.
Powiązania:
https://bibliotekanauki.pl/articles/91858.pdf
Data publikacji:
2012
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
metaheuristic
optimization
portfolio optimization
marginal risk
quadratic programming
meta heuristic method
data envelopment analysis
Opis:
The problem of portfolio optimization with its twin objectives of maximizing expected portfolio return and minimizing portfolio risk renders itself difficult for direct solving using traditional methods when constraints reflective of investor preferences, risk management and market conditions are imposed on the underlying mathematical model. Marginal risk that represents the risk contributed by an asset to the total portfolio risk is an important criterion during portfolio selection and risk management. However, the inclusion of the constraint turns the problem model into a notorious non-convex quadratic constrained quadratic programming problem that seeks acceptable solutions using metaheuristic methods. In this work, two metaheuristic methods, viz., Evolution Strategy with Hall of Fame and Differential Evolution (rand/1/bin) with Hall of Fame have been evolved to solve the complex problem and compare the quality of the solutions obtained. The experimental studies have been undertaken on the Bombay Stock Exchange (BSE200) data set for the period March 1999-March 2009. The efficiency of the portfolios obtained by the two metaheuristic methods have been analyzed using Data Envelopment Analysis.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 3; 259-274
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Metaheuristic approach to optimal power flow using mixed integer distributed ant colony optimization
Autorzy:
Suresh, Vishnu
Janik, Przemyslaw
Jasinski, Michal
Powiązania:
https://bibliotekanauki.pl/articles/141692.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
ant colony optimization
IEEE 30 bus
IEEE 57 bus
metaheuristic algorithm
mixed integer distributed ant colony optimization
optimal power flow
Opis:
This paper presents the application of an improved ant colony optimization algorithm called mixed integer distributed ant colony optimization to optimize the power flow solution in power grids. The results provided indicate an improvement in the reduction of operational costs in comparison with other optimization algorithms used in optimal power flow studies. The application was realized to optimize power flow in the IEEE 30 and the IEEE 57 bus test cases with the objective of operational cost minimization. The optimal power flow problem described is a non-linear, non-convex, complex and heavily constrained problem.
Źródło:
Archives of Electrical Engineering; 2020, 69, 2; 335-348
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A logistic optimization for the vehicle routing problem through a case study in the food industry
Autorzy:
Akpinar, Muhammet Enes
Powiązania:
https://bibliotekanauki.pl/articles/1835487.pdf
Data publikacji:
2021
Wydawca:
Wyższa Szkoła Logistyki
Tematy:
vehicle routing problem
time windows
optimization
metaheuristic algorithm
genetic algorithm
trasa pojazdu
okna czasowe
optymalizacja
algorytm metaheurystyczny
algorytm genetyczny
Opis:
In this study, the food delivery problem faced by a food company is discussed. There are seven different regions where the company serves food and a certain number of customers in each region. The time of requesting food for each customer varies according to the shift situation. This type of problem is referred to as a vehicle routing problem with time windows in the literature and the main aim of the study is to minimize the total travel distance of the vehicles. The second aim is to determine which vehicle will follow which route in the region by using the least amount of vehicle according to the desired mealtime. Methods: In this study, genetic algorithm methodology is used for the solution of the problem. Metaheuristic algorithms are used for problems that contain multiple combinations and cannot be solved in a reasonable time. Thus in this study, a solution to this problem in a reasonable time is obtained by using the genetic algorithm method. The advantage of this method is to find the most appropriate solution by trying possible solutions with a certain number of populations. Results: Different population sizes are considered in the study. 1000 iterations are made for each population. According to the genetic algorithm results, the best result is obtained in the lowest population size. The total distance has been shortened by about 14% with this method. Besides, the number of vehicles in each region and which vehicle will serve to whom has also been determined. This study, which is a real-life application, has provided serious profitability to the food company even from this region alone. Besides, there have been improvements at different rates in each of the seven regions. Customers' ability to receive service at any time has maximized customer satisfaction and increased the ability to work in the long term. Conclusions: The method and results used in the study were positive for the food company. However, the metaheuristic algorithm used in this study does not guarantee an optimal result. Therefore, mathematical models or simulation models can be considered in terms of future studies. Besides, in addition to the time windows problem, the pickup problem can also be taken into account and different solution proposals can be developed.
Źródło:
LogForum; 2021, 17, 3; 387-397
1734-459X
Pojawia się w:
LogForum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithms for joint optimization of unicast and anycast traffic in elastic optical network-based large-scale computing systems
Autorzy:
Markowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/330713.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
elastic optical network
joint optimization
distributed data center
metaheuristic algorithm
tabu search
elastyczna sieć optyczna
optymalizacja wspólna
baza danych rozproszona
algorytm heurystyczny
metoda tabu search
Opis:
In recent years elastic optical networks have been perceived as a prospective choice for future optical networks due to better adjustment and utilization of optical resources than is the case with traditional wavelength division multiplexing networks. In the paper we investigate the elastic architecture as the communication network for distributed data centers. We address the problems of optimization of routing and spectrum assignment for large-scale computing systems based on an elastic optical architecture; particularly, we concentrate on anycast user to data center traffic optimization. We assume that computational resources of data centers are limited. For this offline problems we formulate the integer linear programming model and propose a few heuristics, including a meta-heuristic algorithm based on a tabu search method. We report computational results, presenting the quality of approximate solutions and efficiency of the proposed heuristics, and we also analyze and compare some data center allocation scenarios.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 3; 605-622
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Artificial Neural Network Optimized by Modified Particle Swarm Optimization for Predicting Peak Particle Velocity Induced by Blasting Operations in Open Pit Mines
Autorzy:
Bui, Xuan‑Nam
Nguyen, Hoang
Nguyen, Truc Anh
Powiązania:
https://bibliotekanauki.pl/articles/2020892.pdf
Data publikacji:
2021
Wydawca:
Polskie Towarzystwo Przeróbki Kopalin
Tematy:
blast-induced ground vibration
peak particle velocity
open pit mine
artificial neural network
modified particle swarm optimization
metaheuristic algorithms
wibracje gruntu wywołane podmuchami
drgania górotworu
górnictwo odkrywkowe
sztuczne sieci neuronowe
Opis:
Blasting is an indispensable part of the open pit mining operations. It plays a vital role in preparing the rock mass for subsequent operations, such as loading/unloading, transporting, crushing, and dumping. However, adverse effects, especially blast-induced ground vibrations, are considered one of the most dangerous problems. In this study, artificial intelligence was supposed to predict the intensity of blast-induced ground vibration, which is represented by the peak particle velocity (PPV). Accordingly, an artificial neural network was designed to predict PPV at the Coc Sau open pit coal mine with 137 blasting events were collected. Aiming to optimize the ANN model, the modified version of the particle swarm optimization (MPSO) algorithm was applied to optimize the ANN model for predicting PPV, called the MPSO-ANN model. For the comparison purposes, two forms of empirical equations, namely United States Bureau of Mining (USBM) and U Langefors - Kihlstrom, were also developed to predict PPV and compared with the proposed MPSO-ANN model. The results showed that the proposed MPSO-ANN model provided a better performance with a mean absolute error (MAE) of 1.217, root-mean-squared error (RMSE) of 1.456, and coefficient of determination (R2) of 0.956. Meanwhile, the empirical models only provided poorer performances with an MAE of 1.830 and 2.012, RMSE of 2.268 and 2.464, and R2 of 0.874 and 0.852 for the USBM and U Langefors – Kihlstrom empirical models, respectively.
Źródło:
Inżynieria Mineralna; 2021, 2; 79--90
1640-4920
Pojawia się w:
Inżynieria Mineralna
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-10 z 10

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies