Wyniki wyszukiwania - BazTech

1

The solution of MRSLP with the use of heuristic algorithms

Kochańska Joanna, Burduk Anna, Łapczyńska Dagmara, Musiał Kamil

Bulletin of the Polish Academy of Sciences. Technical Sciences

|

2024

|

Vol. 72, nr 1

art. no. e146407

EN

Improving production processes includes not only activities concerning manufacturing itself, but also all the activities that are necessary to achieve the main objectives. One such activity is transport, which, although a source of waste in terms of adding value to the product, is essential to the realization of the production process. Over the years, many methods have been developed to help manage supply and transport in such a way as to reduce it to the necessary minimum. In the paper, the problem of delivering components to a production area using trains and appropriately laid-out carriages was described. It is a milk run stop locations problem (MRSLP), whose proposed solution is based on the use of heuristic algorithms. Intelligent solutions are getting more and more popular in the industry because of the possible advantages they offer, especially those that include the possibility of finding an optimum local solution in a relatively short time and the prevention of human errors. In this paper, the applicability of three algorithms – tabu search, genetic algorithm, and simulated annealing – was explored.

2

An enhanced krill herd optimization technique used for classification problem

Al-Mashhadani Firas N., Alsaffar Qusay S., Al-Jadir Ibrahim A.

Przegląd Naukowy Inżynieria i Kształtowanie Środowiska

|

2021

|

Vol. 30, No. 2

354--364

EN

In this paper, this method is intended to improve the optimization of the classification problem in machine learning. The EKH as a global search optimization method, it allocates the best representation of the solution (krill individual) whereas it uses the simulated annealing (SA) to modify the generated krill individuals (each individual represents a set of bits). The test results showed that the KH outperformed other methods using the external and internal evaluation measures.

3

Profit optimization for multi-mode repetitive construction project with cash flows using metaheuristics

Sroka Bartłomiej, Rosłon Jerzy, Podolski Michał, Bożejko Wojciech, Burduk Anna, Wodecki Mieczysław

Archives of Civil and Mechanical Engineering

|

2021

|

Vol. 21, no. 2

441--457

EN

The article presents the profit optimization model for multi-unit construction projects. Such projects constitute a special case of repetitive projects and are common in residential, commercial, and industrial construction projects. Due to the specific character of construction works, schedules of such projects should take into account many different aspects, including durations and costs of construction works, the possibility of selecting alternative execution modes, and specific restrictions (e.g., deadlines for the completion of units imposed by the investor). To solve the NP-hard problem of choosing the order of units’ construction and the best variants of works, the authors used metaheuristic algorithms (simulated annealing and genetic search). The objective function in the presented optimization model was the total profit of the contractor determined on the basis of the mathematical programming model. This model takes into account monthly cash flows subject to direct and indirect costs, penalties for missing deadlines, costs of work group discontinuities, and borrowing losses. The presented problem is very important for maintaining a good financial condition of the enterprise carrying out construction projects. In the article, an experimental analysis of the proposed method of solving the optimization task was carried out in a model that showed high efficiency in obtaining suboptimal solutions. In addition, the operation of the proposed model has been presented on a calculation example. The results obtained in it are fully satisfying.

4

Dynamic Communication Topologies for Distributed Heuristics in Energy System Optimization Algorithms

Holly Stefanie, Nieße Astrid

Annals of Computer Science and Information Systems

|

2021

|

Vol. 25

191--200

EN

The communication topology is an essential aspect in designing distributed optimization heuristics. It can influence the exploration and exploitation of the search space and thus the optimization performance in terms of solution quality, convergence speed and collaboration costs - relevant aspects for applications operating critical infrastructure in energy systems. In this work, we present an approach for adapting the communication topology during runtime, based on the principles of simulated annealing. We compare the approach to common static topologies regarding the performance of an exemplary distributed optimization heuristic. Finally, we investigate the correlations between fitness landscape properties and defined performance metrics.

5

Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study

Le Thi Diem Chau, Nguyen Duy Duc, Oláh Judit, Pakurár Miklós

Production Engineering Archives

|

2020

|

Vol. 26, Iss. 4

174--184

EN

This study describes a pickup and delivery vehicle routing problem, considering time windows in reality. The problem of tractor truck routes is formulated by a mixed integer programming model. Besides this, three algorithms - a guided local search, a tabu search, and simulated annealing - are proposed as solutions. The aims of our study are to optimize the number of internal tractor trucks used, and create optimal routes in order to minimize total logistics costs, including the fixed and variable costs of an internal vehicle group and the renting cost of external vehicles. Besides, our study also evaluates both the quality of solutions and the time to find optimal solutions to select the best suitable algorithm for the real problem mentioned above. A novel mathematical model is formulated by OR tools for Python. Compared to the current solution, our results reduced total costs by 18%, increased the proportion of orders completed by internal vehicles (84%), and the proportion of orders delivered on time (100%). Our study provides a mathematical model with time constraints and large job volumes for a complex distribution network in reality. The proposed mathematical model provides effective solutions for making decisions at logistics companies. Furthermore, our study emphasizes that simulated annealing is a more suitable algorithm than the two others for this vehicle routing problem.

6

On Finding the Optimal Tree of a Complete Weighted Graph

Hosseini Seyed Soheil, Wormald Nick, Tian Tianhai

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

271--275

EN

We want to find a tree where the path length between any two vertices on this tree is as close as possible to their corresponding distance in the complete weighted graph of vertices upon which the tree is built. We use the residual sum of squares as the optimality criterion to formulate this problem, and use the Cholesky decomposition to solve the system of linear equations to optimise weights of a given tree. We also use two metaheuristics, namely Simulated Annealing (SA) and Iterated Local Search (ILS) to optimise the tree structure. Our results suggest that SA and ILS both perform well at finding the optimal tree structure when the dispersion of distances in the complete graph is large. However, when the dispersion of distances is small, only ILS has a solid performance.

7

An Effective Integrated Metaheuristic Algorithm For Solving Engineering Problems

Alihodzic Adis, Delalic Sead, Gusic Dzenan

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

207--214

EN

To tackle a specific class of engineering problems, in this paper, we propose an effectively integrated bat algorithm with simulated annealing for solving constrained optimization problems. Our proposed method (I-BASA) involves simulated annealing, Gaussian distribution, and a new mutation operator into the simple Bat algorithm to accelerate the search performance as well as to additionally improve the diversification of the whole space. The proposed method performs balancing between the grave exploitation of the Bat algorithm and global exploration of the Simulated annealing. The standard engineering benchmark problems from the literature were considered in the competition between our integrated method and the latest swarm intelligence algorithms in the area of design optimization. The simulations results show that I-BASA produces high-quality solutions as well as a low number of function evaluations.

8

A Two-Stage Monte Carlo Approach for Optimization of Bimetallic Nanostructures

Mikhov Rossen, Myasnichenko Vladimir, Kirilov Leoneed, Sdobnyakov Nickolay, Matrenin Pavel, Sokolov Denis, Fidanova Stefka

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

285--288

EN

In this paper we propose a two-stage lattice Monte Carlo approach for optimization of bimetallic nanoalloys: simulated annealing on a larger lattice, followed by simulated diffusion. Both algorithms are fairly similar in structure, but their combination was found to give significantly better solutions than simulated annealing alone. We also discuss how to tune the parameters of the algorithms so that they work together optimally.

9

A comparison of evolutionary and simulated annealing algorithms for bi-criteria location-scheduling problem

Ławrynowicz Mirosław, Filcek Grzegorz

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

251--255

EN

A comparison of two heuristic algorithms solving a bi-criteria joint location and scheduling (ScheLoc) problem is considered. In this strongly NP-hard problem the sum of job completion times and location investment costs are used to evaluate the solution. The first solution algorithm (EV) uses an evolutionary approach, and the second more time-efficient algorithm (SA) is based on Simulated Annealing.

10

Score level and rank level fusion for KINECT-based multi-modal biometric system

Rahman Md Wasiur, Zohra Guellati Fatma, Gavrilova Marina L.

Journal of Artificial Intelligence and Soft Computing Research

|

2019

|

Vol. 9, No. 3

167--176

EN

Computational intelligence firmly made its way into the areas of consumer applications, banking, education, social networks, and security. Among all the applications, biometric systems play a significant role in ensuring an uncompromised and secure access to resources and facilities. This article presents a first multimodal biometric system that combines KINECT gait modality with KINECT face modality utilizing the rank level and the score level fusion. For the KINECT gait modality, a new approach is proposed based on the skeletal information processing. The gait cycle is calculated using three consecutive local minima computed for the distance between left and right ankles. The feature distance vectors are calculated for each person’s gait cycle, which allows extracting the biometric features such as the mean and the variance of the feature distance vector. For Kinect face recognition, a novel method based on HOG features has been developed. Then, K-nearest neighbors feature matching algorithm is applied as feature classification for both gait and face biometrics. Two fusion algorithms are implemented. The combination of Borda count and logistic regression approaches are used in the rank level fusion. The weighted sum method is used for score level fusion. The recognition accuracy obtained for multi-modal biometric recognition system tested on KINECT Gait and KINECT Eurocom Face datasets is 93.33% for Borda count rank level fusion, 96.67% for logistic regression rank-level fusion and 96.6% for score level fusion.

11

Artificial immune system in planning deliveries in a short time

Mrówczyńska B., Król A., Czech P.

Bulletin of the Polish Academy of Sciences. Technical Sciences

|

2019

|

Vol. 67, nr 5

969--980

EN

In the calculations presented in the article, an artificial immune system (AIS) was used to plan the routes of the fleet of delivery vehicles supplying food products to customers waiting for the delivery within a specified, short time, in such a manner so as to avoid delays and minimize the number of delivery vehicles. This type of task is classified as an open vehicle routing problem with time windows (OVRPWT). It comes down to the task of a traveling salesman, which belongs to NP-hard problems. The use of the AIS to solve this problem proved effective. The paper compares the results of AIS with two other varieties of artificial intelligence: genetic algorithms (GA) and simulated annealing (SA). The presented methods are controlled by sets of parameters, which were adjusted using the Taguchi method. Finally, the results were compared, which allowed for the evaluation of all these methods. The results obtained using AIS proved to be the best.

12

Best response dynamics for VLSI physical design placement

Rapoport Michael, Tamir Tami

Annals of Computer Science and Information Systems

|

2019

|

Vol. 18

147--156

EN

The physical design placement problem is one of the hardest and most important problems in micro chips production. The placement defines how to place the electrical components on the chip. We consider the problem as a combinatorial optimization problem, whose instance is defined by a set of $2$-dimensional rectangles, with various sizes and wire connectivity requirements. We focus on minimizing the placement area and the total wire length.

13

An iterative inversion of Dual Induction Tool logs from thin-bedded Sandy-shaly formations of the Carpathian Foredeep using a modified simulated annealing method

Wilkosz Michał, Wawrzyniak-Guz Kamila

Acta Geophysica

|

2019

|

Vol. 67, no. 6

1865--1873

EN

In thin-bedded sandy–shaly Miocene formations of the Carpathian Foredeep, the main source of errors in gas saturation evaluation is the underestimation of resistivity of thin, hydrocarbon-bearing beds, which is the result of the low vertical resolution of induction logging tools. This problem is especially visible in older boreholes drilled in times where the Dual Induction Tool (DIT) was the primary induction tool used for determining the formation resistivity, and in shallowest depth intervals of newer boreholes where the DIT was used instead of newer array tools for cost-saving reasons. In this paper, we show how a global inversion algorithm was used to improve the vertical resolution of DIT logs. Our implementation of an iterative inversion utilizes a one-dimensional formation model, vertical response functions of the DIT, and a modified simulated annealing algorithm to determine the true vertical distribution of the formation resistivity. The algorithm was tested on resistivity logs recorded in a borehole drilled in the Carpathian Foredeep in Poland, where the DIT and the High-Resolution Array Induction (HRAI) tool were run in the same depth interval.

14

An Improved Method of Busbar Voltage Reconstruction from Signals of Electric Field Sensors Installed in an Indoor MV Substation

Borkowski D.

Metrology and Measurement Systems

|

2018

|

Vol. 25, nr 1

71--86

EN

This paper presents an improved method for the reconstruction of busbar voltage waveforms from signals acquired by a system of electric field (EF) sensors located in an indoor medium voltage substation. In the previous work [8], the authors proposed the use of black-box models in the form of artificial neural networks (ANNs) for this task. In this paper it is shown that a parametric model of the system of EF sensors can reconstruct voltages with much lower errors, provided that it is accurately identified. The model identification is done by minimization of a nonlinear goal function, i.e. mean squared error (MSE) of voltage reconstruction. As a result of examining several optimization techniques, the method based on simulated annealing extended with a simplex search, is proposed. The performance of the model identified with this method is at least 8 times better in terms of MSE and at least 12 times better in terms of frequency domain errors than the best one of concurrent ANNs.

15

Divisibility attribute tasks in the process of scheduling

Dorota D.

Elektronika : konstrukcje, technologie, zastosowania

|

2018

|

Vol. 59, nr 1

24--28

EN

The article presents an approach to scheduling tasks in embedded systems by considering the attribute of task dividing. The approach presented in this paper presents the generation of a target system based on NoC network architecture using the simulated annealing algorithm. Research activities are an extension of previous scheduling work. Previous research has shown promising results, so their continuation is outlined in the current article. It is a continuation and expansion of research using publicly available TGFF graphs. The proposal of these graphs challenges the improvement of the scheduling process. This article illustrates the effective way of generating a system and scheduling tasks. As in previous author’s work, in researches the same algorithms was used for each considered case.

PL

W artykule przedstawiono podejście do szeregowania zadań w systemach wbudowanych, rozpatrując atrybut podzielności zadań. Podejście przedstawione w niniejszym artykule przedstawia generowanie docelowego systemu opartego na architekturze sieciowej NoC przy użyciu algorytmu symulowanego wyżarzania. Badania są rozwinięciem i rozszerzeniem podejścia zaprezentowanego we wcześniejszych pracach związanych z szeregowaniem. Dotychczas przeprowadzone badania wykazywały obiecujące wyniki, więc ich kontynuacja zostałą opisna w poniższym atykule. W prezentowanym podejściu wykorzystane zostały ogólnodostępne grafy TGFF. Zaproponowane grafy stanowią wyzwanie dla procesu szeregowania. Analogicznie jak w poprzednich pracach autora, wykorzystane zostały identyczne algorytmy w każdym przypadku.

16

Reverse Logistics Network Problem using simulated annealing with and without priority-algorithm

Benaissa M., Slama I., Dhiaf M. M.

Archives of Transport

|

2018

|

Vol. 47, iss. 3

7--17

EN

In recent years, Reverse Logistics (RL) has become a field of importance for all organizations due to growing environmental concerns, legislation, corporate social responsibility and sustainable competitiveness. In Reverse logistics, the used or returned products are collected after their acquisition and inspected for sorting into the different categories. The next step is to disposition them for repair, remanufacturing, recycling, reuse or final disposal. Manufacturers may adopt reverse logistics by choice or by force, but they have to decide whether performing the activities themselves or outsourcing to a third party (Martin et al., 2010). Lourenço et al., (2003) described three main areas of improvement within the RL process. Firstly, companies can reduce the level of returns through the analysis of their causes. Secondly, they can work on the improvement of the return’s process and, thirdly, they can create value from the returns. This paper considers the multistage reverse Logistics Network Problem (mrLNP) proposed by Lee et al., (2008). With minimizing the total of costs to reverse logistics shipping cost. We will demonstrate the mrLNP model will be formulated as a three-stage logistics network model. Since such network design problems belong to the class of NP-hard problems we propose a Simulated Annealing (SA) and simulated annealing with priority (priSA) with special neighborhood search mechanisms to find the near optimal solution consisting of two stages. Computer simulations show the several numerical examples by using, SA, priSA and priGA(Genetic algorithm with priority-based encoding method) and effectiveness of the proposed method.

17

A smart amalgamation of spectral neural algorithm for nonlinear Lane-Emden equations with simulated annealing

Khan N. A., Shaikh A.

Journal of Artificial Intelligence and Soft Computing Research

|

2017

|

Vol. 7, No. 3

215--224

EN

The actual motivation of this paper is to develop a functional link between artificial neural network (ANN) with Legendre polynomials and simulated annealing termed as Legendre simulated annealing neural network (LSANN). To demonstrate the applicability, it is employed to study the nonlinear Lane-Emden singular initial value problem that governs the polytropic and isothermal gas spheres. In LSANN, minimization of error is performed by simulated annealing method while Legendre polynomials are used in hidden layer to control the singularity problem. Many illustrative examples of Lane-Emden type are discussed and results are compared with the formerly used algorithms. As well as with accuracy of results and tranquil implementation it provides the numerical solution over the entire finite domain.

18

System for vehicle routing problem algorithms analysis

Sztajerowski W., Ochelska-Mierzejewska J., Kucharski J.

Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska

|

2017

|

T. 7, nr 2

28--31

EN

Paper concerns the software system supporting the analysis of different cases of solving VRP by various algorithms. VRP has been characterised and application structure has been presented. Illustrative experimental results show the usefulness of the system.

PL

Artykuł przedstawia oprogramowanie wspomagające analizę różnych przypadków rozwiązywania planowania dostaw (ang. Vehicle Routing Problem, VRP) przez różne algorytmy. Zaprezentowano w artykule problem VRP oraz strukturę omawianego systemu. Pokazano również wyniki eksperymentów, które pokazują użyteczność systemu.

19

Financial optimisation of the scheduling for the multi-stage project

Klimek M., Łebkowski P.

Bulletin of the Polish Academy of Sciences. Technical Sciences

|

2017

|

Vol. 65, nr 6

899--908

EN

The paper analyses the problem of discounted cash flow maximising for the resource-constrained project scheduling from the project contractor’s perspective. Financial optimisation for the multi-stage project is considered. Cash outflows are the contactor’s expenses related to activity execution. Cash inflows are the client’s payments for the completed milestones. To solve the problem, the procedure of backward scheduling taking into account contractual milestones is proposed. The effectiveness of this procedure, as used to generate solutions for the simulated annealing algorithm, is verified with use of standard test instances with additionally defined cash flows and contractual milestones.

20

Symulowane wyżarzanie dla problemu harmonogramowania projektu z ograniczonymi zasobami

Klimek M.

Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki

|

2016

|

nr 15

53--65

PL

W artykule przedstawiony jest problem harmonogramowania projektu z ograniczonymi zasobami z kryterium minimalizacji czasu trwania przedsięwzięcia. Do rozwiązania zagadnienia stosowany jest algorytm symulowanego wyżarzania, którego skuteczność testowana jest przy wykorzystaniu standardowych zadań testowych. Eksperymenty przeprowadzane są przy różnych konfiguracjach algorytmu w celu ustalenia najlepszych parametrów: schematu chłodzenia, technik przeszukiwania (ruchów), schematów generowania rozwiązań.

EN

In this paper resource-constrained project scheduling problem with optimisation criterion of minimising makespan is presented. To solve the problem is applied simulated annealing algorithm, whose effectiveness is tested using standard test instances. Experiments are performed with different configurations algorithm to determine the best parameters: cooling schemes, search techniques (moves), schedule generation schemes.