Wyniki wyszukiwania - BazTech

1

Time minimization delivery planning with the time-quantity dependence

Kowalik Przemysław, Stopka Ondrej

Zeszyty Naukowe. Transport / Politechnika Śląska

|

2025

|

z. 128

95--114

EN

One of the classical problems in transportation planning is represented minimizing the maximal delivery time of a uniform commodity between sources and destinations, known as the Bottleneck Transportation Problem (BTP). It assumes that a fixed transportation time – independent of the quantity of the transported commodity – is assigned to each source-to-destination route. In some cases, however, the quantity of the transported commodity may affect the transportation time, e.g., because of the duration of loading/unloading the commodity to/from the vehicle. Extensions of the BTP as well as the closely related Total Time Minimization Transportation Problem (TTMTP) which include the linear time-quantity dependence of the delivery time are considered. Whereas similar optimization problems known in the literature are nonlinear, linear programming is used in this research. Linear optimization provides better performance of the optimization software in comparison with nonlinear optimization. The above fact is illustrated by improving solutions to the problems known in the literature. A detailed insight into the issue of the existence of integer optimal solutions and interpretations of optimal solutions is also provided.

2

Optimization of road transport within the supply network - a case study from Poland

Ziółkowski Jarosław, Hošková-Mayerová Sarka, Hutsaylyuk Volodymyr, Łukasiak Daniel

Transport Problems

|

2025

|

T. 20, z. 1

193--206

EN

Optimization in the area of road transport is the subject of numerous scientific publications. Its analysis uses programming languages (including linear) and tools enabling not only a detailed analysis of the examined process but also including data dynamics (demand variability) and the availability of resources (means of transport) diversified in terms of permissible total mass (GVW). Such tools are useful because they support decision-making processes. This paper uses the example of a military supply network to present a multi-criteria methodology enabling minimization of total transport costs, number and type (due to load capacity) of vehicles used, distance traveled, fuel used, and CO2 emissions into the atmosphere. Moreover, additional restrictions on existing transport resources were included, considering the number and type of vehicles available at the base. This is of great importance, especially when there is a need to provide emergency deliveries, for example, in the event of a war threat. The proposed method is universal and was developed using an MS Excel spreadsheet with the Solver add-in.

3

Leveraging the transportation algorithm for energy flow optimization in smart households

Powroźnik Piotr

Metrology and Measurement Systems

|

2025

|

Vol. 32, nr 2

1--16

EN

This paper presents the application of a transportation algorithm to optimize energy flow within a smart grid context. By leveraging this well-established optimization technique, it is demonstrated that energy efficiency can be enhanced and costs lowered in individual households equipped with smart appliances and connected to both traditional and renewable energy sources. Simulation studies have shown that the algorithm can effectively determine optimal energy consumption patterns, leading to significant energy savings. Additionally, the algorithm can provide valuable insights into network congestion and energy demand forecasting, enabling distribution system operators to make informed decisions. The proposed solution aligns well with the concept of smart homes. By integrating with smart devices, such as smart sockets and thermostats, energy consumption can be optimized based on real-time pricing and renewable energy availability, ultimately leading to lower energy bills and increased user comfort. Extending this approach to the distribution network level, by applying the transportation algorithm to optimize energy flow at the medium and low voltage levels, could further enhance grid stability and facilitate the integration of renewable energy sources.

4

Expert method to support sustainable renovation decisions

Bucoń Robert

Materiały Budowlane

|

2025

|

nr 11

143--151

EN

The purpose of this article is to present a practical application of an expert method for setting renovation priorities for residential building maintenance when setting sustainability goals. The proposed method is based on an innovative approach that provides the techno-economic data necessary to perform a multi-stage optimization to achieve a long-term building renovation strategy. To conduct the study, a mixed-integer linear programming MILP was used that takes into account constraints and boundary conditions that are updated for each year of the time schedule horizon. The developed methodology makes it possible both to identify future renovation activities and to develop a program for their optimal combination, in which the activities are scheduled at the appropriate optimal stage of the time horizon.

PL

W artykule przedstawiono praktyczne zastosowanie eksperckiej metody ustalania decyzji renowacyjnych dotyczących utrzymania budynków mieszkalnych przy wyznaczaniu celów zrównoważonego rozwoju. Proponowana metoda bazuje na nowatorskim podejściu dostarczającym techniczno-ekonomicznych danych niezbędnych do przeprowadzenia wieloetapowej optymalizacji w celu uzyskania długoterminowej strategii renowacji budynków. Do badań zastosowano programowanie liniowe o strukturze mieszanej MILP, uwzględniające ograniczenia i warunki brzegowe, które są aktualizowane w przypadku każdego roku horyzontu czasowego harmonogramu. Opracowana metoda umożliwia zidentyfikowanie przyszłych działań renowacyjnych oraz opracowanie programu optymalnej ich kombinacji, w którym działania te zaplanowane są w odpowiednim optymalnym etapie horyzontu czasowego.

5

Sustainable energy development strategies for Poland – critical

Ligus Magdalena

Economics and Environment

|

2025

|

No. 3

art. no. 1306

EN

The aim of the paper and research method is the critical review of the energy development strategies for Poland proposed in strategic government documents, as well as proposals of research institutes. The strategies are confronted with the sustainable development paradigm. Certain conclusions are consistent across all studies: there is no doubt that the future belongs to renewable energy sources. However, the crucial difference concerns whether or not system costs are recognised, or recognised to a different extent, and whether they are assigned to specific energy technologies. Energy strategies presented in the literature are typically based on linear programming, where, subject to certain constraints, only one goal of minimum cost of energy in the power system is achieved. Such a one-dimensional goal definition appears to be a significant simplification of the problem, as costs are only one component of a multidimensional criterion that is the highest level of sustainable energy development.

PL

Celem artykułu jest krytyczny przegląd strategii zrównoważonego rozwoju energetycznego dla Polski, proponowanych w strategicznych dokumentach rządowych oraz propozycjach instytutów badawczych. Strategie te konfrontowane są z paradygmatem zrównoważonego rozwoju. Pewne wnioski są spójne we wszystkich badaniach: nie ma wątpliwości, że przyszłość należy do odnawialnych źródeł energii. Zasadnicza różnica dotyczy jednak tego, czy koszty systemowe są uwzględniane, czy też uwzględniane w różnym stopniu, a także tego, czy są przypisane konkretnym technologiom energetycznym. Strategie energetyczne prezentowane w literaturze opierają się zazwyczaj na programowaniu liniowym, gdzie, przy pewnych ograniczeniach, osiągany jest tylko jeden cel, jakim jest minimalny koszt energii w systemie elektroenergetycznym. Takie jedno-wymiarowe określenie celu wydaje się znacznym uproszczeniem problemu, ponieważ koszty są tylko jednym ze składników wielowymiarowego kryterium, jakim jest najwyższy poziom zrównoważonego rozwoju energetycznego.

6

Optimizing urban transportation network reliability by analyzing road traffic accidents

Pemberthy-R J. Isaac, Gañan-Cardenas Eduard

Archives of Transport

|

2025

|

Vol. 73, iss. 1

155--177

EN

Urbanization has led to increased traffic congestion and road traffic accidents (RTAs), significantly impacting public health, urban mobility, and the efficiency of transportation systems. RTAs disrupt road transport networks, reducing their reliability and performance metrics, which are critical for economic and social activities. This study addresses these challenges by integrating statistical analysis and optimization modeling to enhance the reliability of urban transportation networks through targeted interventions. The proposed methodology builds upon the reliability model by Jovanović Dragan et al. (2011), utilizing statistical analysis of historical RTA data to evaluate transport network reliability. This assessment informs of a linear programming (LP) optimization framework designed to allocate intervention budgets effectively. The LP model incorporates road importance, defined by traffic volume, prioritizing investments on high-impact roads to mitigate RTAs and improve overall network performance. The methodology is demonstrated through a case study in Medellín, Colombia, a city facing significant congestion and high RTA rates (average 100 daily). Using geolocated accident data (2017–2019) and vehicle usage metrics, two model variations were tested: one including road importance and another without. Both models yielded efficient solutions using standard optimization solvers with minimal computational time. Findings demonstrate that the model incorporating road importance provides more targeted budget allocations, aligning better with practical priorities by focusing interventions on the busiest and least reliable road segments. This study highlights the value of combining RTA analysis and network reliability perspectives for data-driven strategic transportation planning. The approach offers actionable insights for policymakers and urban planners seeking to reduce accidents and enhance urban mobility through optimized resource allocation. Future research could expand this framework to include other disruption types (e.g., natural disasters) or validate intervention effectiveness through detailed simulation modeling.

7

A steepest feasible direction method for linear programming : derivation and embedding in the simplex method

Wolde Biressaw C., Larsson Torbjörn

Operations Research and Decisions

|

2024

|

Vol. 34, No. 2

163--182

EN

A feasible direction method for linear programming has been proposed. The method is embedded in the framework of the simplex method, even though it works with non-edge feasible directions. The direction used is the steepest in the space of all variables or an approximation thereof, and it is found by solving a strictly convex quadratic program in the space of the nonbasic variables. Further, this program guarantees the feasibility of the direction even in the case of degeneracy. To remain within the simplex framework, the direction is represented by an auxiliary, or external, nonbasic column, which is a nonnegative linear combination of original nonbasic columns. We have made an experimental evaluation of the suggested method on both nondegenerate and highly degenerate problem instances. The overall results are very promising for continued research along this line, especially concerning various computational strategies that can be applied when the method is implemented.

8

Efficiency and Fairness Optimization in Energy Management

Zalewski Grzegorz, Granat Janusz, Makowski Marek

Journal of Telecommunications and Information Technology

|

2024

|

nr 4

86--92

EN

The paper proposes a solution to the problem of distributing electricity originating from various sources. In the proposed model, each source has a different cost of acquisition and is characterized by varying energy efficiency factors. Additionally, in the case of renewable sources, the costs of storing energy are taken into consideration as well. This work presents a fair and cost-efficient approach to distributing the demands of energy providers. A model has been developed and verified for the purpose of corroborating the process.

9

Modeling environmental and economic factors in regional energy optimization

Coban Hasan Huseyin, Lewicki Wojciech, Brelik Agnieszka

Economics and Environment

|

2024

|

No. 2

art. no. 748

EN

This article addresses the contemporary environmental challenges stemming from rapid economic growth, surging energy consumption, urban expansion, and mounting waste issues. The study explores the optimisation of a regional energy system, considering not only the electric energy sector but also the fuel and thermal energy sectors for the selected geographical destination. In this study, the application of the Linprog optimisation function in MATLAB programming tool to solve Regional Energy System Optimization with renewable resources is explained. The primary objective is to develop a mathematical model that identifies the optimal energy balance structure, allowing for the partial replacement of hydrocarbon sources with bioresources and waste in heat and electricity generation, as well as in vehicle fuel consumption. The modelling approach involves linear programming and integrates two key criteria: economic (cost of energy for consumers) and environmental (carbon footprint). The novelty of this approach lies in applying life cycle analysis to assess potential environmental consequences. Results reveal optimal generation volumes based on economic and environmental considerations. When optimising solely for economic criteria, municipal solid waste, along with wind energy, emerges as the preferred source. In contrast, the simultaneous optimisation of economic and environmental parameters aligns with the economic calculation, demonstrating a balanced approach to sustainable development.

PL

W artykule omówiono współczesne wyzwania środowiskowe wynikające z szybkiego wzrostu gospodarczego, rosnącego zużycia energii, ekspansji miast i narastających problemów z odpadami. W opracowaniu podjęto próbę optymalizacji regionalnego systemu energetycznego, uwzględniając nie tylko sektor energii elektrycznej, ale także sektor paliwowy i energetyki cieplnej dla wybranej lokalizacji geograficznej. W tym opracowaniu wyjaśniono zastosowanie funkcji optymalizacyjnej Linprog w narzędziu programistycznym MATLAB do rozwiązywania problemów z optymalizacją regionalnego systemu energetycznego przy użyciu zasobów odnawialnych. Podstawowym celem jest opracowanie modelu matematycznego identyfikującego optymalną strukturę bilansu energetycznego, pozwalającą na częściowe zastąpienie źródeł węglowodorów biosurowcami i odpadami w procesie wytwarzania ciepła i energii elektrycznej, a także w zużyciu paliwa przez pojazdy. Podejście modelowe obejmuje programowanie liniowe i integruje dwa kluczowe kryteria: ekonomiczne (koszt energii dla konsumentów) i środowiskowe (ślad węglowy). Nowatorstwo tego podejścia polega na zastosowaniu analizy cyklu życia do oceny potencjalnych konsekwencji dla środowiska. Wyniki ujawniają optymalne wielkości produkcji w oparciu o względy ekonomiczne i środowiskowe. W przypadku optymalizacji wyłącznie pod kątem kryteriów ekonomicznych, preferowanym źródłem są stałe odpady komunalne oraz energia wiatrowa. Natomiast jednoczesna optymalizacja parametrów ekonomicznych i środowiskowych pokrywa się z kalkulacją ekonomiczną, wykazując zrównoważone podejście do zrównoważonego rozwoju.

10

An Improved Genetic Algorithm for Set Cover using Rosenthal Potential

Tayebi Dena, Ray Saurabh, Ajwani Deepak

Annals of Computer Science and Information Systems

|

2024

|

Vol. 39

689--694

EN

A major issue with heuristics for set-cover problem is that they tend to get stuck in a local optimum typically because a large local move is necessary to find a better solution. A recent theoretical result shows that replacing the objective function by a proxy (which happens to be Rosenthal potential function) allows escaping such local optima even with small local moves albeit at the cost of an approximation factor. The Rosenthal potential function thus has the effect of smoothing the optimization landscape appropriately so that local search works. In this paper, we use this theoretical insight to design a simple but robust genetic algorithm for weighted set cover. We modify the fitness function as well as the crossover operator of the genetic algorithm to leverage the Rosenthal potential function. We show empirically this greatly improves the quality of the solutions obtained especially in examples where large local moves are required. Our results are better than existing state of the art genetic algorithms and also comparable in performance with the recent local search algorithm NuSC (carefully engineered for set cover) on benchmark instances. Our algorithm, however, performs better than NuSC on simple synthetic instances where starting from an initial solution, large local moves are necessary to find a solution that is close to optimal. For such instances, our algorithm is able to find near optimal solutions whereas NuSC either takes a very long time or returns a much worse solution.

11

The use of rank and optimisation methods in strategic management in higher education

Ryńca Radosław, Piórkowska Natalia

Operations Research and Decisions

|

2023

|

Vol. 33, No. 1

93--111

EN

The article presents proposals for a university management model supporting the process of strategic management at a university. The proposed model is based on the use of multi-criteria methods such as the 0–10 technique, object ranking, and optimisation methods – linear programming. The proposed solution integrates ranking and optimisation methods, the use of which may be helpful in the hands of managers in making management decisions. The proposed approach may also be helpful in developing a strategic scorecard, especially in the stage of formulating goals. It also enables the optimal selection of goals with the existing time constraints for the implementation of the strategy. The article presents a proposal for the use of the strategy implementation model and an example of its use. The strengths and weaknesses of the model were also indicated.

12

Linear programming models for optimal workload and batching in pick-and-pass warehousing systems

Tarczyński Grzegorz

Operations Research and Decisions

|

2023

|

Vol. 33, No. 3

141--158

EN

Pick-and-pass systems are a part of picker-to-parts order-picking systems and constitute a very common storage solution in cases where customer orders are usually small and need to be completed very quickly. As workers pick items in the zones connected by conveyors, their work needs to be coordinated. The paper presents MILP models that optimize the order-picking process. The first model uses information about the expected demand for items to solve the storage location problem and balance the workload across zones. The task of the next model is order-batching and sequencing – two concepts are presented that meet different assumptions. The results of the exemplary tasks solved with the use of the proposed MILP models show that the total picking time of a set of orders can be reduced by about 35-45% in comparison with random policies. The paper presents an equation for the lower bound of a makespan. Recommendations about the number of zones that guarantee the required system efficiency are also introduced.

13

A new geometric approach to multiobjective linear programming problems

Kaci Mustapha, Radjef Sonia

Mathematica Applicanda

|

2023

|

Vol. 51, no. 1

3--12

EN

This paper is a follow-up to a previous work where we developed a new geometric approach to sensitivity analysis. In this paper, we present a simple method to determine whether a given multiobjective linear programming problem (MOLPP) has an ideal solution (i.e. all of the objective functions are optimized simultaneously) without having to calculate the optimal value of each objective function. First, we divide the space of linear forms into a finite number of sets based on a fixed convex polygonal subset of R2 using an equivalency relationship. All the elements from a given equivalency class have the same optimal solution. Next, we characterize the equivalence classes of the quotient set using a geometric approach to sensitivity analysis. Finally, a numerical example is given to illustrate the method.

PL

W tym artykule przedstawiamy nową metodę rozwiązywania problemów programowania liniowego z wieloma celami (MOLPP), która eliminuje potrzebę obliczania optymalnej wartości każdej funkcji celu. Metoda ta jest kontynuacją naszych wcześniejszych prac dotyczących analizy wrażliwości, gdzie opracowaliśmy nowe podejście geometryczne. Pierwszym krokiem naszego podejścia jest podział przestrzeni form liniowych na skończoną liczbę zbiorów opartych na stałym wypukłym podzbiorze wielokąta R2. Dokonujemy tego za pomocą relacji równoważności, która zapewnia, że wszystkie elementy z danej klasy równoważności mają takie same rozwiązanie optymalne. Następnie charakteryzujemy klasy równoważności zbioru ilorazowego za pomocą podejścia geometrycznego do analizy wrażliwości. Ten krok jest kluczowy w identyfikacji rozwiązania idealnego dla MOLPP. Korzystając z tego podejścia, możemy określić, czy dana MOLPP ma rozwiązanie idealne, bez konieczności obliczania optymalnej wartości każdej funkcji celu. Jest to znacząca poprawa w stosunku do istniejących metod, ponieważ znacznie zmniejsza złożoność obliczeniową i czas wymagany do rozwiązania MOLPP. Aby zilustrować naszą metodę, przedstawiamy numeryczny przykład, który dowodzi jej skuteczności. Nasza metoda jest prosta, ale potężna i może być łatwo zastosowana do szerokiego zakresu MOLPP. Niniejsza praca przyczynia się do dziedziny optymalizacji poprzez przedstawienie nowego podejścia do rozwiązywania MOLPP, które jest wydajne, skuteczne i łatwe do zaimplementowania.

14

The application of linear programming for the optimal profit of PT. Naruna using the simplex method

Syifa Eka Auliya, Istiqomah Tita Nuril, Puspita Nikken Prima, Ratnasari Lucia, Khabibah Siti, Anggoro Paulus Wisnu, Bawono Baju

Management Systems in Production Engineering

|

2023

|

nr 2 (31)

138--143

EN

PT. Naruna is a ceramics factory located in Salatiga, Indonesia. In PT. Naruna ceramics, all products are handmade with contemporary designs and have a high artistic value in shape and color. Getting profit is the company's primary goal, but many companies still need to learn the maximum profit that can be obtained by optimizing their resources, one of which is PT. Naruna. PT. Naruna produces goods based on intuition. As a result, a lot of goods are piled up in warehouses. Meanwhile, with the development of the times, new trends and images will appear more attractive so that consumer tastes and motifs from ceramics will change. In addition, ceramic products that have gone through the combustion process cannot be recycled and must be burned. This research focuses on the production of glasses with three different types according to price. The aim of this paper is to optimize profits by determining the composition of the number of products produced. We used linear programming with a simplex method to solve our problem in PT. Naruna. Linear programming is the most appropriate method for solving problems that exist in PT. Naruna, namely by paying attention to the objective and constraint functions. The objective function is to maximize profit, so it takes the form of a linear equation with the variable X1 being the first type of glass, X2 being the second type of glass, and X3 being the third type of glass. The constraint functions used include the number of products, the number of workers, the amount of clay, and the time for production. The results show that PT. Naruna can achieve maximum profit when producing glass type 1 less than type 3 less than type 2.

15

New Algorithm Permitting the Construction of an Effective Spanning Tree

Belkacem Salima Nait, Abbasy Moncef

Foundations of Computing and Decision Sciences

|

2023

|

Vol. 48, No. 3

313--329

EN

In this paper, we have done a rapid and very simple algorithm that resolves the multiple objective combinatorial optimization problem. This, by determining a basic optimal solution, which is a strong spanning tree constructed, according to a well-chosen criterion. Consequently, our algorithm uses notions of Bellman’s algorithm to determine the best path of the network, and Ford Fulkerson’s algorithm to maximise the flow value. The Simplex Network Method that permits to reach the optimality conditions manipulates the two algorithms. In short, the interest of our work is the optimization of many criteria taking into account the strong spanning tree, which represents the central angular stone of the network. To illustrate that, we propose to optimize a bi-objective distribution problem.

16

Deployment of a predictive-like optimal control law on a servo drive system using linear programming approach

Horla Dariusz, Pinczewski Piotr

Archives of Electrical Engineering

|

2023

|

Vol. 72, nr 4

1005--1016

EN

Current drive control systems tend to push control loops to the limits of their performance. One of the ways of doing so is to use advanced optimization algorithms, usually related to model-based off-line calculations, such as genetic algorithms, the particle swarmoptimisation or the others. There is, however, a simpler way, namely to use predictive control formalism and by formulation of a simple linear programming problem which is easy to solve using powerful solvers, without excessive computational burden, what is a reliable solution, as whenever the optimization problem has a feasible solution, a global minimizer can be efficiently found. This approach has been deployed for a servo drive system operated by a real-time sampled-data controller, verified between model-in-the-loop and hardwarein- the-loop configurations, for a range of prediction horizons, as an attractive alternative to classical quadratic programming-related formulation of predictive control task.

17

List Of Pareto Optimal Solutions of a Biobjective Shortest Path Problem

Laskov Lasko, Marinov Marin

Annals of Computer Science and Information Systems

|

2023

|

Vol. 35

603--613

EN

Many applications in practice involve the search for a shortest path in a network by optimizing two conflicting objective functions. Such problems often are referred to as biobjective optimization problems. Their goal is to find special optimal paths that are nondominated and are also known in the specialized literature as to as Pareto optimal. While most of the existing methods aim to find the minimum complete set of Pareto optimal paths, we propose an approach that is able to generate a list of all Pareto optimal solutions in a given network.

18

A linearisation approach to solving a non-linear shelf space allocation problem with multi-oriented capping in retail store and distribution centre

Czerniachowska Kateryna, Hernes Marcin, Lutosławski Krzysztof

Operations Research and Decisions

|

2022

|

Vol. 32, No. 4

33--56

EN

Shelf space is one of the essential resources in logistic decisions. Order picking is the most time-consuming and labourintensive of the distribution processes in distribution centres. Current research investigates the allocation of shelf space on a rack in a distribution centre and a retail store. The retail store, as well as the distribution centre, offers a large number of shelf storage locations. In this research, multi-orientated capping as a product of the rack allocation method is investigated. Capping allows additional product items to be placed on the rack. We show the linearisation technique with the help of which the models with capping could be linearised and, therefore, an optimal solution could be obtained. The computational experiments compare the quality of results obtained by non-linear and linear models. The proposed technique does not increase the complexity of the initial non-linear problem.

19

Complex Fibonacci (c, p) : numbers

Prasad Bandhu

Mathematica Applicanda

|

2022

|

Vol. 50, no. 2

235--247

EN

In this paper a new complex Fibonacci Q_{p,c} matrix for complex Fibonacci (c,p)-numbers, where p is a positive integer and c is a non-zero complex number, is introduced. Thereby, we discuss various properties of Q_{p,c} matrix, coding and decoding method followed from the Q_{p,c} matrix.

PL

W artykule przedstawiono nową macierz zespoloną Fibonacciego oznaczaną Qp,c dla liczb zespolonych Fibonacciego (c, p), gdzie p jest liczbą całkowitą dodatnią, a c jest niezerową liczbą zespoloną. Omówiono różne własności macierzy Qp,c, oraz sposób kodowania i dekodowania wynikający z macierzy Qp,c.

20

A coding theoretical interpretation of Gaussian-Pell polynomials

Prasad Bandhu

Mathematica Applicanda

|

2022

|

Vol. 50, no. 1

129--138

EN

In this paper, we establish a new result followed from Gaussian Pell polynomials matrix, Qn(x)P(x) (cf. Serpil and Sinan (2018)) whose elements are Gaussian Pell polynomials and we develop new coding and decoding method follow from Gaussian Pell polynomials matrix, Qn(x)P(x). The correction ability of this method is 93:33%.

PL

W artykule z wykorzystaniem macierzy wielomianów Gaussa Pella, Qn(x)P(x) (v. Serpil and Sinan (2018)), opracowano nową metodę kodowania. Ta metoda wynika z własności tej macierzy. Uzyskany kod daje możliwość korekcji na poziomie 93:33% .