BazTech - Yadda

1

Industry Expertise Heuristics for Dimensioning Shelf Space of Rack Storage Location in a Distribution Centre with Zone Picking

Czerniachowska Kateryna, Wichniarek Radosław, Żywicki Krzysztof

Management and Production Engineering Review

|

2023

|

Vol. 14, No. 1

43--60

EN

Appropriate product categorization in distribution centres is important for business success because of the possibility of intuitive product finding by the picker and increased product movement. Both of these factors result in the operational efficiency of the distribution centre. The goal of this paper is to explore a model of shelf space dimensioning of storage location on a rack with vertical and horizontal product categorization in a distribution centre, where the aim is to increase total product movement/profit from all shelves of the rack. This is controlled by a packer who must complete orders by getting the goods from shelves and picking them to the container. In this problem, we develop two heuristics and compare the archived results to the CPLEX solver. The average profit ratios of both heuristics are high and approximately equal to 99%. In 10 cases, optimal solutions have been found by heuristics. The total number of possible solutions to be checked for the largest instance was reduced from 1.33 ·10156 to 1.19 ·107 thanks to the heuristic rules.

2

Constraint Programming for Flexible Flow Shop Scheduling Problem with Repeated Jobs and Repeated Operations

Czerniachowska Kateryna, Wichniarek Radosław, Żywicki Krzysztof

Advances in Science and Technology. Research Journal

|

2023

|

Vol. 17, no 3

280--293

EN

The manufacturing process relies heavily on production scheduling to guarantee effective production schedules, reduce costs and product shortages, and get away from delays, interruptions, and waste products. Scheduling issues have been effectively solved via constraint programming. In this paper, we consider a constraint programming formulation of the flexible flow shop scheduling problem with repeated jobs and operations repetitions. We also implemented seven fast heuristics and compared the results with the constraint programming solution. The results from using the CPLEX solver as a solution tool were satisfactory. Computational experiments demonstrate that using constraint programming can be significantly more advantageous than using heuristics.

3

Heuristics for dimensioning the shelf space on the rack with vertical and horizontal product categorisation in the distribution centre with zone picking

Czerniachowska Kateryna, Wichniarek Radosław, Żywicki Krzysztof

Management and Production Engineering Review

|

2022

|

Vol. 13, No. 2

31--47

EN

Distribution centres are the important elements of modern supply chains. A distribution centre stores and ships products. In this paper, we investigate the model of the dimensioning of shelf space on the rack with vertical and horizontal product categorisation in a distribution centre, where the objective is to maximise the total product movement/profit from all shelves of the rack which is being managed by a packer who needs to complete orders selecting the products from the shelves and picking them to the container. We apply two newly developed heuristics to this problem and compare the results to the optimal solution found by the CPLEX solver. There are 8 steering parameters that allow for reducing the search space implemented in heuristics. Among them are parameters that decrease the number of prod- ucts on the shelves, the category width range for assigning most space for the most profitable products within the category, two versions of steering parameters for the number of generated product allocations, the step parameters for the intensity of solution diversification, and the movement/profit below which the solutions are not generated. The computational results are presented and indicate that higher-quality solutions can be obtained using the new heuristics. In 10 from 15 tests, both heuristics can find optimal solutions without exploring the whole solution space. For the rest test sets, the solutions received by heuristics are not less than 92.58%.

4

A new design approach for milkrun-based in-plant supply in manufacturing systems

Banyai Tamas, Francuz Adam

Journal of Machine Engineering

|

2022

|

Vol. 22, No. 3

91--115

EN

In manufacturing technologies milkrun and water-spider-based material handling represents up-to-date solutions, especially in the case of just-in-time and just-in-sequence in-plant supply. The objective of this research work is to show how to support the design of milkrun-based in-plant supply with heuristic optimisation in manufacturing processes. This paper proposes a new optimisation approach that can determine the optimal parameters of material handling operations of manufacturing technologies focusing on milkrun-based in-plant supply of manufacturing and assembly cells and lines. After a careful systematic literature review, this paper introduces a structural model to formulate the problem of routing of milkrun trolleys in manufacturing and assembly processes. Next, a potential mathematical model is described. Numerical results demonstrate how the proposed approach supports the decision making process in milkrun design focusing on the optimisation of the required number of milkrun trolleys and the routing of them.

5

AH Method: a Novel Routine for Vicinity Examination of the Optimum Found with a Genetic Algorithm

Piętak Daniel Andrzej, Bilski Piotr, Napiorkowski Paweł Jan

International Journal of Electronics and Telecommunications

|

2022

|

Vol. 68. No. 4

695--708

EN

The paper presents a novel heuristic procedure (further called the AH Method) to investigate function shape in the direct vicinity of the found optimum solution. The survey is conducted using only the space sampling collected during the optimization process with an evolutionary algorithm. For this purpose the finite model of point-set is considered. The statistical analysis of the sampling quality based upon the coverage of the points in question over the entire attraction region is exploited. The tolerance boundaries of the parameters are determined for the user-specified increase of the objective function value above the found minimum. The presented test-case data prove that the proposed approach is comparable to other optimum neighborhood examination algorithms. Also, the AH Method requires noticeably shorter computational time than its counterparts. This is achieved by a repeated, second use of points from optimization without additional objective function calls, as well as significant repository size reduction during preprocessing.

6

Deficiency-surplus transition function (DeSuTra) in semi-empirical formulas for tumbling of freely falling card

Vorohobovs Vladimirs, Kleinhofs Martins

Composites Theory and Practice

|

2022

|

R. 22, nr 2

92--98

EN

A new phenomenological method for composing analytical formulae to describe dynamic systems using the DeSuTra function as a building block is introduced. Based on heuristic considerations, it is possible to write a correct formula with several unknown coefficients. Next, these coefficients are tuned such a way that the result coincides with the experimental data. To illustrate the viability of such a method, a simple but not trivial aerodynamic system was chosen: the autorotation of a rectangular piece of paper that falls in air. Three correction coefficients (diminishers) were introduced to calculate its rotation frequency Then a simple expression for the Magnus effect and drag force was used. All the obtained formulae were experimentally proved and the coefficients calculated. The conclusions drawn confirm the usefulness of the presented calculation procedure for the design of composites with chaotically distributed reinforcements.

7

A Multi-label Transformation Framework for the Rectangular 2D Strip-Packing Problem

Neuenfeldt Júnior Alvaro, Francescatto Matheus, Stieler Gabriel, Disconzi David

Management and Production Engineering Review

|

2021

|

Vol. 14, No. 4

27--37

EN

The present paper describes a methodological framework developed to select a multi-label dataset transformation method in the context of supervised machine learning techniques. We explore the rectangular 2D strip-packing problem (2D-SPP), widely applied in industrial processes to cut sheet metals and paper rolls, where high-quality solutions can be found for more than one improvement heuristic, generating instances with multi-label behavior. To obtain single-label datasets, a total of five multi-label transformation methods are explored. 1000 instances were generated to represent different 2D-SPP variations found in real-world applications, labels for each instance represented by improvement heuristics were calculated, along with 19 predictors provided by problem characteristics. Finally, classification models were fitted to verify the accuracy of each multi-label transformation method. For the 2D-SPP, the single-label obtained using the exclusion method fit more accurate classification models compared to the other four multi-label transformation methods adopted.

8

Monitoring and management of geoengineering repositories of radioactive waste

Yeremeyev Igor, Dychko Alina, Kyselov Volodymyr, Zaichenko Stefan

Architecture Civil Engineering Environment

|

2021

|

Vol. 14, no. 3

103--109

EN

The paper provides the approach to the management of the repositories of radioactive waste, which include monitoring of contaminants migration into environment in case of natural or technogenic accidents which may influence on soil, subsoil waters and repository’ installations structures. The aim of the research is the development of system of estimation of radioactive state of the environment in the area of radioactive repository, based on the cumulative data, the knowledge base, set of rules of production, logical deduction gear and conclusion building gear by means of uncertain and incomplete input data. It is proposed the use of several models for the spectral characteristics of radioactive pollutants migration. The evaluation of possible damages of repository containment is made. The heuristics for the radioactive waste repository expert system are developed. The proposed procedure of quality definition of decision making for the radioactive waste repositories management should take into account the reliability of information about the state of the radioactive repository.

9

Production Scheduling for the Two Furnaces – One Casting Line System

Stawowy A., Duda J.

Archives of Foundry Engineering

|

2020

|

Vol. 20, iss. 1

43--48

EN

The paper presents a production scheduling problem in a foundry equipped with two furnaces and one casting line, where the line is a bottleneck and furnaces, of the same capacity, work in parallel. The amount of produced castings may not exceed the capacity of the line and the furnaces, and their loads determine metal type from which the products are manufactured on the casting line. The purpose of planning is to create the processing order of metal production to prevent delays in the delivery of the ordered products to the customers. The problem is a mix of a lot-sizing and scheduling problems on two machines (the furnaces) run in parallel. The article gives a mathematical model that defines the optimization problem, and its relaxed version based on the concept of a rolling-horizon planning. The proposed approaches, i.e. commercial solver and Iterated Local Search (ILS) heuristic, were tested on a sample data and different problem sizes. The tests have shown that rolling horizon approach gives the best results for most problems, however, developed ILS algorithm gives better results for the largest problem instances with tight furnace capacity.

10

Exact and approximation algorithms for sensor placement against DDoS attacks

Junosza-Szaniawski Konstanty, Nogalski Dariusz, Wójcik Agnieszka

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

295--301

EN

In DDoS attack (Distributed Denial of Service), an attacker gains control of many network users by a virus. Then the controlled users send many requests to a victim, leading to lack of its resources. DDoS attacks are hard to defend because of distributed nature, large scale and various attack techniques. One of possible ways of defense is to place sensors in the network that can detect and stop an unwanted request. However, such sensors are expensive so there is a natural question about a minimum number of sensors and their optimal placement to get the required level of safety. We present two mixed integer models for optimal sensor placement against DDoS attacks. Both models lead to a trade-off between the number of deployed sensors and the volume of uncontrolled flow. Since above placement problems are NP-hard, two efficient heuristics are designed, implemented and compared experimentally with exact linear programming solvers.

11

Application of Heuristic Optimization for the Selection of Parameters of the Generation System and Reactive Power Consumption of Wind Farms

Gryniewicz-Jaworska Michalina

Advances in Science and Technology. Research Journal

|

2020

|

Vol. 14, no 3

9--14

EN

The cooperation of wind farms with the power system requires that they meet the requirements related to reactive power management. In practice, it concerns both generation and production of this power in accordance with the requirements of network operators and EU Regulation 2016/631. The regulatory capacity of wind turbine generators is not sufficient to meet these requirements, in particular for farms connected to the power system via a 110 kV cable line with a length of several dozen kilometers. It is required to use various additional devices – fixed or variable shunt reactor, capacitor batteries, static VAR compensators (SVC). In the article, a compensation quality indicator was defined, by means of which it is possible to assess and select the optimal set of devices supporting the farm’s generation and reactive power consumption capabilities. Due to the application of multicriteria optimization, this indicator unifies both the technical effectiveness of individual systems and the economies of their use.

12

Exploring heuristic techniques for flow shop scheduling

Soltysova Zuzana, Semanco Pavol, Modrak Jan

Management and Production Engineering Review

|

2019

|

Vol. 10, No. 3

54–-60

EN

This paper explores selected heuristics methods, namely CDS, Palmer’s slope index, Gupta’s algorithm, and concurrent heuristic algorithm for minimizing the makespan in permutation ﬂow shop scheduling problem. Its main scope is to explore how diﬀerent instances sizes impact on performance variability. The computational experiment includes 12 of available benchmark data sets of 10 problems proposed by Taillard. The results are computed and presented in the form of relative percentage deviation, while outputs of the NEH algorithm were used as reference solutions for comparison purposes. Finally, pertinent ﬁndings are commented.

13

Forecasting and predicting in engineering tasks

Afanasyeva Olesya, Korostil Olga

Journal of KONBiN

|

2019

|

Vol. 49, iss. 3

421--431

EN

The work analyzes the tasks of solving problems, which consist in determining the events that may occur through some time after the completion of the process of solving the problem. One of the possible classifications of such tasks is proposed. The analysis of differences between different types of tasks is carried out, features of implementing the processes of their resolution are revealed. The paper considers in detail such types of tasks as prognosis and prediction. Differences are described between these processes with each other and the characteristics that determine each of the processes. The comparison of various types of processes in the overall forecasting process is presented.

PL

Tematem publikacji jest rozwiązywanie problemów polegających na określaniu zdarzeń, które mogą mieć miejsce po zakończeniu procesu rozwiązywania problemu. W artykule zaproponowano jedną z możliwych klasyfikacji takich zadań. Ponadto, przeprowadzono analizę różnic rozmaitych zadań. Przedstawiono także cechy wdrażania procesów ich rozwiązywania. W artykule szczegółowo rozważano takie rodzaje zadań, jak prognozowanie i przewidywanie. Opisano różnice między tymi procesami oraz cechy charakterystyczne, które określają każdy z wymienionych procesów. Przedstawiono porównanie różnych rodzajów procesów w całościowym procesie prognozowania.

14

Problem losowego przydziału pracowników do miejsc pracy z uwzględnieniem rotacji stanowisk

Klimek M.

Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska

|

2018

|

z. 117

227--244

PL

W artykule opisany jest rzeczywisty problem przydziału pracowników do stanowisk pracy występujący w jednostkach administracji celnej. Zakłada się, że alokacja pracowników do stanowisk powinna być losowa, niemożliwa do przewidzenia dla pracowników. W poszukiwanej alokacji zalecane jest również unikanie przydziału pracowników do stanowisk, na których w ostatnim czasie pracowali najczęściej. Proponowany jest model matematyczny przydziału pracowników do stanowisk, który bierze pod uwagę rotację stanowisk. Dla tego modelu opracowany jest algorytm heurystyczny, który tworzy losową alokację pracowników.

EN

The article describes the real problem of assignment of workers to workplaces occurring in customs administrations. This problem assumes that the allocation of employees to stations should be random, unpredictable for workers. It is also advisable to avoid assigning staff to workplaces where they have worked most recently. A mathematical model of the allocation of staff is proposed to the position, which takes into account the job rotation. For this model a heuristic algorithm, which creates random allocation of employees, is developed.

15

Collaborative paradigm for single-machine scheduling under just-in-time principles: total holding-tardiness cost problem

Varela M. L. R., Madureira A. M., Dantas J. D., Santos A. S., Putnik G. D., Trojanowska J., Machado J.

Management and Production Engineering Review

|

2018

|

Vol. 9, No. 1

90--103

EN

The problem of sequencing jobs on a single machine to minimize total cost (earliness and tardiness) is nowadays not just important due to traditional concerns but also due to its importance in the context of Collaborative Networked Organizations and Virtual Enterprises, where precision about promptly responses to customers’ requests, along with other important requirements, assume a crucial role. In order to provide a contribution in this direction, in this paper the authors contribute with an applied constructive heuristics that tries to find appropriate solutions for single machine scheduling problems under different processing times and due dates, and without preemption allowed. In this paper, two different approaches for single-machine scheduling problems, based on external and internal performance measures are applied to the problem and a comparative analysis is performed. Computational results are presented for the problem under Just-in-Time and agile conditions on which each job has a due date, and the objective is to minimize the sum of holding costs for jobs completed before their due date and tardiness costs for jobs completed after their due date. Additional computational tests were developed based on different customer and enterprise oriented performance criteria, although preference is given to customer-oriented measures, namely the total number of tardy jobs and the maximum tardiness.

16

Zastosowanie algorytmów sztucznej inteligencji do rozwiązania problemu komiwojażera

Ficoń K., Krasnodębski A.

Gospodarka Materiałowa i Logistyka

|

2018

|

nr 12

286--307, CD

PL

W pracy omówiono heurystyczne metody rozwiązania problemu komiwojażera za pomocą algorytmów sztucznej inteligencji. Oprócz niemal klasycznych algorytmów opartych na sztucznych sieciach neuronowych i algorytmach genetycznych (ewolucyjnych) zostały przeanalizowane nowoczesne algorytmy korzystające z tzw. inteligencji roju (stada). W tej grupie zostały przeanalizowane algorytmy kolonii pszczół i stada ptaków. Szerzej zostały przedyskutowane algorytmy mrówkowe, bardzo ściśle związane z suboptymalizacją tras komunikacyjnych.

EN

The paper discusses the heuristic methods of solving the traveling salesman problem using artificial intelligence algorithms. In addition to almost classic algorithms based on artificial neural networks and genetic (evolutionary) algorithms, modern algorithms using the so-called swarm intelligence (herd). In this group, the algorithms for colonies of bees and flocks of birds have been analyzed. The formic algorithms, very closely related to the suboptimization of communication routes, have been discussed in more detail.

17

Fast truck-packing of 3D boxes

Józefowska J., Pawlak G., Pesch E., Morze M., Kowalski D.

Engineering Management in Production and Services

|

2018

|

Vol. 10, no. 2

29--40

EN

We present formulation and heuristic solution of a container packing problem observed in a household equipment factory’s sales and logistics department. The main feature of the presented MIP model is combining several types of constraints following from the considered application field. The developed best-fit heuristic is tested on the basis of a computational experiment. The obtained results show that the heuristic is capable of constructing good solutions in a very short time. Moreover, the approach allows easy adjustment to additional loading constraints.

18

Policy-based sla storagemanagement model fordistributeddata storage services

Nikolow D., Słota R., Polak S., Pogoda M., Kitowski J.

Computer Science

|

2018

|

Vol. 19 (4)

403--429

EN

There is high demand for storage related services supporting scientists in their research activities. Those services are expected to provide not only capacity but also features allowing for more exible and cost ecient usage. Such features include easy multiplatform data access, long term data retention, support for performance and cost dierentiating of SLA restricted data access. The paper presents a policy-based SLA storage management model for distributed data storage services. The model allows for automated management of distributed data aimed at QoS provisioning with no strict resource reservation. The problem of providing users with the required QoS requirements is complex, and therefore the model implements heuristic approach for solving it. The corresponding system architecture, metrics and methods for SLA focused storage management are developed and tested in a real, nationwide environment. Keywords distributed storage systems, quality of service, service level agreement, management model, heuristics.

19

Znajdowanie najkrótszej drogi z wykorzystaniem algorytmów mrówkowych

Świątnicki Z.

Autobusy : technika, eksploatacja, systemy transportowe

|

2018

|

R. 19, nr 12

998--1001

PL

Praca poświęcona jest problemowi znajdowania najkrótszej drogi w grafie poszukiwań. Zastosowano do tego celu algorytmy mrówkowe. Zbudowano model optymalizacyjny. Wybrano 8 różnych algorytmów mrówkowych. Przedstawiono i omówiono uzyskane wyniki optymalizacji długości drogi.

EN

The presented research results indicate the usefulness of ant algorithms in the optimization of the road length. Admittedly, ant algorithms do not guarantee an optimal solution, but they provide a suboptimal (rational) solution. In a situation where we have limited time to solve the optimization problem, the guarantee of terminating the algorithm and obtaining a rational, acceptable solution is an attractive alternative for conducting long-term calculations and finding a little better solution.

20

Renesans strategii – czyli o niemożliwości uprawiania „evidence based policy”

Malinowski G.

Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska

|

2017

|

z. 113

265--283

PL

W artykule postawiona zostaje teza, że polityka gospodarcza, wbrew popularnym opiniom nie może opierać się na wiedzy naukowej. Teza zostaje poparta szeregiem argumentów wskazujących problematyczność stosowania twierdzeń naukowych w praktycznym działaniu. Nie oznacza to jednak, że decydent skazany jest na działanie nieracjonalne. W tym kontekście wykazane zostaje, że właściwym narzędziem umożliwiającym podejmowanie lepszych decyzji jest strategia. Strategia pojmowana jako pewien system reguł decyzyjnych a nie jako plan działania. Egzemplifikacją tego rozumowania staje się zaprezentowanie zasady ostrożności, która jest jedną z najbardziej fundamentalnych i uniwersalnych reguł decyzyjnych, na których może opierać się polityka gospodarcza państwa.

EN

The article puts forward a hypothesis according to which economic policy, contrary to popular opinion, cannot be based on scientific knowledge. This thesis is supported by a series of arguments indicating how problematic is to apply scientific theories in practical action. Especially in the field of economic policy. This doesn’t mean however, that a decision maker must be irrational. In this context, it is demonstrated, that strategy is a right tool to make better decisions. A strategy, understood as a system of decision rules, not as an action plan. This reasoning is being exemplified by the introduction of precaussionary principle, which is one of the most fundamental and universal decision rules on which economic policy of the state can be based.