Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Integer programming" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 67
Tytuł:
An integrated modelling approach for an optimal location of warehouses in the defence industry organisation
Autorzy:
Bayrakcı, Melda Gelibolu
Baykoç, Ömer Faruk
Powiązania:
https://bibliotekanauki.pl/articles/27315334.pdf
Data publikacji:
2023
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
warehouse location
integer programming
defence industry
analytic hierarchy process
goal programming
Opis:
Countries’ defence industries are the leading indicator of their global power. The warehouse is the place where the materials are kept until the customer order arrives so that the companies are viable and can respond appropriately to internal/external customer demands. In this regard, warehouse location plays a vital role in the defence industry in terms of storage options with increased flexibility, a simplified supply chain with cost management and optimal positioning according to deployment locations. In this study, the decision on the location of warehouses for logistic support during the warranty period of military vehicles manufactured and supplied to the armed forces by a defence company was made. It is aimed to propose the best solution to a real-life problem with high complexity, containing many data and constraints. In this context, the criteria that are thought to be most relevant to this problem have been determined by taking expert opinions. Having determined the order of importance of the requirements by the analytical hierarchy process (AHP) with the Super Decisions V 2.10, their weights were included as a coefficient of the objective function in the goal programming (GP) model. As a result of solving the GP model using GAMS (general algebraic modelling system), it was decided to select the warehouses that provided the optimal results among the alternative warehouse locations in 9 different locations. Furthermore, to see the impact of changes in criterion weights, sensitivity analysis has also been included. The significance of this research lies within the integrated usage of AHP and GP in the defence industry when determining warehouse locations by the experts’ opinions. With this study, not only a solution strategy was developed, but also a basis for the warehouse location decision in the defence industry projects already signed or to be signed was given.
Źródło:
Operations Research and Decisions; 2023, 33, 2; 35--52
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The SEKO assignment : efficient and fair assignment of students to multiple seminars
Autorzy:
Hoßfeld, Tobias
Powiązania:
https://bibliotekanauki.pl/articles/27315331.pdf
Data publikacji:
2023
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
assignment problem
limited capacity
utilization
at least on seminar ratio
ALOS ratio
fairness
integer linear programming
ILP
first-in first-out assignment
FIFO assignment
random selection using key objectives
SEKO
Opis:
Seminars are offered to students for education in various disciplines. The seminars may be limited in terms of the maximum number of participants, e.g., to have lively interactions. Due to capacity limitations, those seminars are often offered several times to serve the students’ demands. Still, some seminars are more popular than others and it may not be possible to grant access to all interested students due to capacity limitations. In this paper, a simple, but efficient random selection using key objectives (SEKO) assignment strategy is proposed which achieves the following goals: (i) efficiency by utilizing all available seminar places, (ii) satisfying all students by trying to assign at least one seminar to each student, and (iii) fairness by considering the number of assigned seminars per student. We formulate various theoretical optimization models using integer linear programming (ILP) and compare their solutions to the SEKO assignment based on a real-world data set. The real-world data set is also used as the basis for generating large data sets to investigate the scalability in terms of demand and number of seminars. Furthermore, the first-in first-out (FIFO) assignment, as a typical implementation of fair assignments in practice, is compared to SEKO in terms of utilization and fairness. The results show that the FIFO assignment suffers in realworld situations regarding fairness, while the SEKO assignment is close to the optimum and scales regarding computational time in contrast to the ILP.
Źródło:
Operations Research and Decisions; 2023, 33, 3; 1--25
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A novel approach to optimize the maintenance strategies: a case in the hydroelectric power plant
Autorzy:
Özcan, Evrencan
Yumuşak, Rabia
Eren, Tamer
Powiązania:
https://bibliotekanauki.pl/articles/1841740.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
maintenance management
maintenance strategy optimization
multi-criteria decision making
AHP
COPRAS
integer programming
Opis:
Countries need to develop sustainable energy policies based on the principles of environmental sensitivity, reliability, efficiency, economy and uninterrupted service and to maintain their energy supply in order to increase their global competitiveness. In addition to this impact of sustainable energy supply on the global world, maintenance processes in power plants require high costs due to allocated time, materials and labor, and generation loss. Thus, the maintenance needs to be managed within a system. This makes analytical and feasible maintenance planning a necessity in power plants. In this context, this study focuses on maintenance strategy optimization which is the first phase of maintenance planning for one of the large-scale hydroelectric power plants with a direct effect on Turkey's energy supply security with its one fifth share in total generation. In this study, a new model is proposed for the maintenance strategy optimization problem considering the multi-objective and multicriteria structure of hydroelectric power plants with hundreds of complex equipment and the direct effect of these equipment on uninterrupted and cost-effective electricity generation. In the model, two multi-criteria decision-making methods, AHP and COPRAS methods, are integrated with integer programming method and optimal maintenance strategies are obtained for 571 equipment.
Źródło:
Eksploatacja i Niezawodność; 2021, 23, 2; 324-337
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Explicit modeling of multi-period setup times in proportional lot-sizing and scheduling problem with variable capacity
Autorzy:
Kaczmarczyk, Waldemar
Powiązania:
https://bibliotekanauki.pl/articles/2083469.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
production
lot-sizing
scheduling
mixed-integer programming
Opis:
Small bucket models with many short fictitious micro-periods ensure high-quality schedules in multi-level systems, i.e., with multiple stages or dependent demand. In such models, setup times longer than a single period are, however, more likely. This paper presents new mixed-integer programming models for the proportional lot-sizing and scheduling problem (PLSP) with setup operations overlapping multiple periods with variable capacity. A new model is proposed that explicitly determines periods overlapped by each setup operation and the time spent on setup execution during each period. The model assumes that most periods have the same length; however, a few of them are shorter, and the time interval determined by two consecutive shorter periods is always longer than a single setup operation. The computational experiments show that the new model requires a significantly smaller computation effort than known models.
Źródło:
Archives of Control Sciences; 2021, 31, 4; 883-912
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mixed-integer programming formulations for the truck scheduling problem with fixed outbound departures
Rozwiązywanie problemu harmonogramowania przewozów przy ustalonych załadunkach
Autorzy:
Wolff, Pascal
Huo, Jiazhen
Pfohl, Hans-Christian
Powiązania:
https://bibliotekanauki.pl/articles/1835497.pdf
Data publikacji:
2021
Wydawca:
Wyższa Szkoła Logistyki
Tematy:
cross-docking
truck scheduling
mixed-integer programming
logistics
optimization
harmonogramowanie przewozów
programowanie różnych zmiennych
logistyka
optymalizacja
Opis:
Truck scheduling at cross-docking terminals has received much academic attention over the last three decades. A vast number of mixed-integer programming models have been proposed to assign trucks to dock-doors and time slots. Surprisingly, only a few models assume fixed outbound truck departures that are often applied in the less-than-truckload or small parcel and express delivery industry. To the best of our knowledge, none of these papers explore whether a discrete-time or continuous-time model formulation has a better computational performance. This paper attempts to close this research gap and tries to shed light on which type of formulation is advantageous. Therefore, a variant of the truck scheduling problem with fixed outbound departures is considered. This problem's objective is to find a feasible truck schedule that minimizes the number of delayed freight units. Methods: We propose two model formulations for the described variant of the truck scheduling problem with fixed outbound departures. Specifically, the problem is formulated as a discrete-time and a continuous-time mixed-integer programming model. Results: A computational experiment is conducted in order to assess the computational performance of the presented model formulations. We compare the discrete-time and continuous-time formulation in terms of both the solution quality and computational time. Conclusions: The computational results show that the proposed discrete-time model formulation can solve problem instances of medium size to proven optimality within less than one minute. The continuous-time model formulation, on the other hand, can solve small instances to optimality. However, it requires longer solution times than the discrete-time formulation. Furthermore, it is unable to solve medium-sized instances within a 5-minute time limit. Thus, it can be summarized that the proposed discrete-time model formulation is clearly superior to the continuous-time model formulation.
Harmonogramowanie przewozów oraz cross-dockingu leży w zasięgu zainteresowania uczonych już od ponad 30 lat. W tym okresie zaproponowało wiele różnych modeli programistycznych tablic awizacyjnych. Jednak zaledwie kilka modeli bierze pod uwagę stałe załadunki, które często są stosowane w przewozach niepełno samochodowych oraz kurierskich. Według naszego rozeznania, żaden z dostępnych modeli nie stosuje modelowania czasem w sposób dyskretny lub ciągły dla uzyskania lepszego wyniku. Celem pracy jest uzupełnienie tej luki w badaniach. Dlatego też rozważono wariant problemu harmonogramowania przewozów ze stałymi załadunkami z celem nadrzędnym znalezienia takiego sposobu harmonogramowania aby minimalizował on liczbę opóźnionych przewozów. Metody: Zaproponowano dwa modele, opisujące harmonogramowanie przewozów ze stałymi załadunkami. Problem ten został sformułowany poprzez model programistyczny ze zmienną czasu w ujęciu dyskretnym i ciągłym. Wyniki: Przeprowadzono symulację komputerową w celu określenie działania opracowanych modeli. Porównano wyniki pod względem jakości uzyskanego wyniku oraz niezbędnego czasu dla obliczeń. Wnioski: Na podstawie uzyskanych wyników można stwierdzić, że proponowany model dyskretny może rozwiązywać problem średniej wielkości w czasie niższej niż minuta. Model oparty na czasie ciągłym uzyskał z kolei optymalizację przy małych przypadkach. Wymagało to jednak dłuższego czasu obliczeniowego. Dodatkowo nie uzyskano dla rozwiązań średniej wielkości czasu niższego od 5 minut. Dlatego też wysunięto wniosek, że model dyskretny jest lepszym w porównaniu z modelem ciągłym.
Źródło:
LogForum; 2021, 17, 2; 243--251
1734-459X
Pojawia się w:
LogForum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An optimum scheduling method for multi-option product flows through production lineswithout intermediate buffers
Autorzy:
Magiera, Marek
Powiązania:
https://bibliotekanauki.pl/articles/406718.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Flexible Manufacturing Systems
integer programming
linear programming
no-wait scheduling
hybrid flow shop
makespan
decision making
Opis:
The presented method is constructed for optimum scheduling in production lines with parallel machines and without intermediate buffers. The production system simultaneously performs operations on various types of products. Multi-option products were taken into account – products of a given type may differ in terms of details. This allows providing for individual requirements of the customers. The one-level approach to scheduling for multioption products is presented. The integer programming is used in the method – optimum solutions are determined: the shortest schedules for multi-option products. Due to the lack of the intermediate buffers, two possibilities are taken into account: no-wait scheduling, possibility of the machines being blocked by products awaiting further operations. These two types of organizing the flow through the production line were compared using computational experiments, the results of which are presented in the paper.
Źródło:
Management and Production Engineering Review; 2020, 11, 1; 86-94
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bi-objective routing in a dynamic network: An application to maritime logistics
Autorzy:
Maskooki, Alaleh
Nikulin, Yury
Powiązania:
https://bibliotekanauki.pl/articles/2050033.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
travelling salesman
time dependent network
multi-objective optimization
integer programming
Opis:
A bi-objectiveMILP model for optimal routing in a dynamic network with moving targets (nodes) is developed, where all targets are not necessarily visited. Hence, our problem extends the moving target travelling salesman problem. The two objectives aim at finding the sequence of targets visited in a given time horizon by minimizing the total travel distance and maximizing the number of targets visited. Due to a huge number of binary variables, such a problem often becomes intractable in the real life cases. To reduce the computational burden, we introduce a measure of traffic density, based on which we propose a time horizon splitting heuristics. In a real-world case study of greenhouse gas emissions control, using Automatic Identification System data related to the locations of ships navigating in the Gulf of Finland, we evaluate the performance of the proposed method. Different splitting scenarios are analysed numerically. Even in the cases of a moderate scale, the results show that near-efficient values for the two objectives can be obtained by our splitting approach with a drastic decrease in computational time compared to the exact MILP method. A linear value function is introduced to compare the Pareto solutions obtained by different splitting scenarios. Given our results, we expect that the present study is valuable in logistic applications, specifically maritime management services and autonomous navigation.
Źródło:
Control and Cybernetics; 2020, 49, 2; 211--232
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Conflict Management in University Examination Timetabling Problem: A case study of summer school mid-terms
Autorzy:
Bayar, Mustafa Mehmet
Uzun Bayar, Irmak
Powiązania:
https://bibliotekanauki.pl/articles/14147915.pdf
Data publikacji:
2020-09-20
Wydawca:
Wyższa Szkoła Bankowa we Wrocławiu
Tematy:
examination timetabling
group decision making
lexicographic optimization
linear mixed integer programming
Opis:
Abstract: Aim: This study is on tackling Examination Timetabling Problem (ETP) of the Faculty of Economics And Administrative Sciences (FEAS) of the Ankara HBV University summer school, where the courses of fall and spring semesters are offered simultaneously and regulations on restricting enrollments in inter-department electives or in-department courses of distinct years are relaxed. Thus, the complexity of the nature of the ETP problem is exacerbated. The direct heuristics based on successive assignments that the university normally adopts was proven inadequate for assuming standard regulations hence, another approach we explain in this paper was needed. Design / Research methods: The ETP was formulated as a Linear Mixed-Integer Program (LMIP) and decomposed into three stages; timetabling exams, room assignment, student allocation. To manage the conflict between the stakeholders of the examination procedure, a lexicographic optimization process based on the priority of the parties was undertaken. Conclusions / findings: After a recursive timetabling process based on a trial-and-error method a clash-free timetable was generated and, a room assignment plan that minimizes the total number of proctoring duties, usage of higher floor rooms and total crowdedness of rooms respectively was put into action. Therefore no student group experienced any clashing exams, the faculty members saved time that can be spent on research instead, since the room usage was better planned the costs (elevator usage, lighting, air conditioning, the labor of the janitors) were assumed to be decreased. Originality / value of the article: Each examination period bares a different ETP due to its problem-specific nature (number of courses offered, structure of student enrollments, availability of rooms, etc.). Summer schools provide a more irregular structure that demands special attention, a trial-and-error reformulation of the ETP in our case. In addition, the traditional formulations of the ETP, to the extent we have been able to scan, do not include the minimization of the crowdedness of the rooms. Thus, in creating a more comfortable environment, easier to monitor exams and, ability in handling unexpected dysfunctionalities (broken classroom equipment, etc.) this study is novel. Limitations of the research: The algorithms to solve an ETP formulated as an LMIP are of high complexity therefore, we are not able to assert the optimality of our suggested solutions acquired within time limitations. Keywords: examination timetabling, group decision making, lexicographic optimization, linear mixed-integer programming JEL: C44, C61, M12
Źródło:
Central European Review of Economics and Management; 2020, 4, 3; 67-87
2543-9472
Pojawia się w:
Central European Review of Economics and Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic energy-saving virtual network embedding algorithm based on Katz centrality
Autorzy:
Zhu, Qiang
Wang, Qing-Jun
Zang, Mu-Jun
Wang, Zhen-Dong
Xiao, Chang
Powiązania:
https://bibliotekanauki.pl/articles/141679.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
energy-saving virtual network
integer linear programming
Katz centrality
network virtualization embedding
virtualization
Opis:
Current networks are designed for peak loads leading to low utilization of power resources. In order to solve this problem, a heuristic energy-saving virtual network embedding algorithm based on the Katz centrality (Katz-VNE) is proposed. For solving an energy-saving virtual network embedding problem, we introduce the Katz centrality to represent the node influence. In order to minimize the energy consumption of the substrate network, the energy-saving virtual network embedding problem is formulated as an integer linear program, and the Katz-VNE is used to solve this problem. The Katz-VNE tries to embed the virtual nodes onto the substrate nodes with high Katz centrality, which is effective, and uses the shortest paths offering the best factor of bandwidths to avoid the hot nodes. The simulation results demonstrate that the long-term average energy consumption of the substrate network is reduced significantly, and the long-term revenue/cost ratio, the acceptance rate of virtual network requests, and the hibernation rate of substrate nodes as well as links are improved significantly.
Źródło:
Archives of Electrical Engineering; 2020, 69, 3; 595-608
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mimimizing the cost of using tractors at agricultural operations
Autorzy:
Zaynagabdinov, Rishat
Gabitov, Ildar
Bakiev, Ilshat
Gafurov, Ildar
Kostarev, Konstantin
Powiązania:
https://bibliotekanauki.pl/articles/327432.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Polskie Towarzystwo Diagnostyki Technicznej PAN
Tematy:
crop production
DT-75 tractor
integer programming
T-402 tractor
optimal planning
produkcja roślinna
ciągnik DT-75
ciągnik T-402
koszty
planowanie optymalne
prace rolnicze
Opis:
The paper shows the economic efficiency of the optimal use of technology in crop production. A totally new model has been developed ,that allows planning the operation of each tractor individually, as well as an integer programming method with Boolean variables based on the formation of a lexicographic sequence. The paper shows the calculation according to the optimization criterion of the minimum duration of the work. The developed method of integer programming is original because it allows to solve problems typical of agricultural planning. For this, the authors derived a formula for the formation of any member of the lexicographic sequence and developed the AgroMaster + computer program, which also carries out the search for the optimal solution using the method of truncated exhaustive search. Due to optimal planning, the total duration of agricultural operations is reduced by 1.7 times compared to their actual duration. The cost of additional products received per 1 moto-hour is 7.3 dollars. The testing the results of studies in one of the farms of the Republic of Bashkortostan showed the possibility of practical application of the above developments for optimal planning of tractors in any agricultural enterprises.
Źródło:
Diagnostyka; 2020, 21, 2; 41-49
1641-6414
2449-5220
Pojawia się w:
Diagnostyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New models and algorithms for RNA pseudoknot order assignment
Autorzy:
Zok, Tomasz
Badura, Jan
Swat, Sylwester
Figurski, Kacper
Popenda, Mariusz
Antczak, Maciej
Powiązania:
https://bibliotekanauki.pl/articles/911230.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
RNA pseudoknot order
conflict graph
vertex coloring
maximum independent set
integer programming
kolorowanie grafu
zbiór niezależny
programowanie całkowitoliczbowe
Opis:
The pseudoknot is a specific motif of the RNA structure that highly influences the overall shape and stability of a molecule. It occurs when nucleotides of two disjoint single-stranded fragments of the same chain, separated by a helical fragment, interact with each other and form base pairs. Pseudoknots are characterized by great topological diversity, and their systematic description is still a challenge. In our previous work, we have introduced the pseudoknot order: a new coefficient representing the topological complexity of the pseudoknotted RNA structure. It is defined as the minimum number of base pair set decompositions, aimed to obtain the unknotted RNA structure. We have suggested how it can be useful in the interpretation and understanding of a hierarchy of RNA folding. However, it is not trivial to unambiguously identify pseudoknots and determine their orders in an RNA structure. Therefore, since the introduction of this coefficient, we have worked on the method to reliably assign pseudoknot orders in correspondence to the mechanisms that control the biological process leading to their formation in the molecule. Here, we introduce a novel graph coloring-based model for the problem of pseudoknot order assignment. We show a specialized heuristic operating on the proposed model and an alternative integer programming algorithm. The performance of both approaches is compared with that of state-of-the-art algorithms which so far have been most efficient in solving the problem in question. We summarize the results of computational experiments that evaluate our new methods in terms of classification quality on a representative data set originating from the non-redundant RNA 3D structure repository.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 2; 315-324
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of underground mine access layout and production scheduling
Optymalizacja układu dostępu do kopalni podziemnej i harmonogramu produkcji
Autorzy:
Hou, Jie
Li, Guoqing
Hu, Nailian
Powiązania:
https://bibliotekanauki.pl/articles/217032.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Gospodarki Surowcami Mineralnymi i Energią PAN
Tematy:
access layout optimization
production schedule optimization
underground mine
integer programming
optymalizacja układu dostępu
optymalizacja harmonogramu produkcji
kopalnia podziemna
programowanie zintegrowane
Opis:
Optimization in mine planning could improve the economic benefit for mining companies. The main optimization contents in an underground mine includes stope layout, access layout and production scheduling. It is common to optimize each part sequentially, where optimal results from one phase are treated as the input for the next phase. The production schedule is based on the mining design. Access layout plays an important role in determining the connection relationships between stopes. This paper proposes a shortest-path search algorithm to design a network that automatically connects each stope. Access layout optimization is treated as a network flow problem. Stopes are viewed as nodes, and the roads between the stopes are regarded as edges. Moreover, the decline location influences the ore transport paths and haul distances. Tree diagrams of the ore transportation path are analyzed when each stope location is treated as an alternative decline location. The optimal decline location is chosen by an enumeration method. Then, Integer Programming (IP) is used to optimize the production scheduling process and maximize the Net Present Value (NPV). The extension sequence of access excavation and stope extraction is taken into account in the optimization model to balance access development and stope mining. These optimization models are validated in an application involving a hypothetical gold deposit, and the results demonstrate that the new approach can provide a more realistic solution compared with those of traditional approaches.
Optymalizacja w planowaniu kopalni może poprawić korzyści gospodarcze dla przedsiębiorstw górniczych. Główna część optymalizacji w kopalni podziemnej obejmuje układ wyrobisk eksploatacyjnych, schemat udostepnienia i harmonogram wydobycia. Zazwyczaj każdy etap optymalizowany jest sekwencyjnie, gdzie optymalne wyniki z jednej fazy są traktowane jako dane wejściowe do następnej fazy. Harmonogram produkcji opiera się na projekcie górniczym. Struktura udostępnienia odgrywa ważną rolę w określaniu połączeń pomiędzy przodkami eksploatacyjnymi. Ten artykuł proponuje algorytm wyszukiwania najkrótszej ścieżki, aby zaprojektować sieć, która automatycznie łączy każdy przodek. Optymalizacja struktury udostępnienia jest traktowana jako problem przepływu w sieci. Przodki są traktowane jako węzły, a drogi pomiędzy nimi jako krawędzie. Ponadto lokalizacja upadowej udostępniającej wpływa na drogi transportu rudy i odległości odstawy. Analiza ścieżek drzew zdarzeń odbywa się przy założeniu alternatywnych lokalizacji upadowych. Optymalna lokalizacja upadowej jest wybierana metodą wyliczania. Następnie, za pomocą programowania zintegrowanego (Integer Programming – IP) optymalizuje się proces planowania produkcji i maksymalizacji wartości bieżącej netto (NPV).Rozwinięty układ wyrobisk udostępniających i eksploatacyjnych jest uwzględniany w modelu optymalizacji do zbilansowania udostępnienia i eksploatacji złoża. Te modele optymalizacji są walidowane w aplikacji uwzględniającej hipotetyczne złoże rud złota, której wyniki pokazują, że nowe podejście może dostarczyć bardziej realistyczne rozwiązanie w porównaniu z tradycyjnymi metodami.
Źródło:
Gospodarka Surowcami Mineralnymi; 2020, 36, 2; 87-108
0860-0953
Pojawia się w:
Gospodarka Surowcami Mineralnymi
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pick up plan in the case of a shuttle racks warehouse – an optimization approach
Plan pobrań w przypadku magazynu typu shuttle – podejście optymalizacyjne
Autorzy:
Kansy, Dawid
Powiązania:
https://bibliotekanauki.pl/articles/1182043.pdf
Data publikacji:
2020
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
mixed-integer linear programming
optimization modeling
logistics
warehouse
shuttle racks
programowanie liniowe
modeloweanie optymalizacyjne
logistyka
magazyn
regały przepływowe
Opis:
System regałów przepływowych typu shuttle dedykowany jest do składowania szybko rotujących towarów na jednorodnych paletach, przy jednoczesnym zapewnieniu wysokiej efektywności wykorzystania przestrzeni magazynowej. System radioshuttle składa się z kanałów shuttle i zdalnie sterowanego wózka transportowego. Rozpatrywanym naukowo problemem badawczym jest opracowanie narzędzi, których rezultatem będzie plan odbioru produktów z lokalizacji regałów przepływowych typu shuttle, gwarantujących minimalną liczbę blokad towaru. Model programowania liniowego zapewnia pobieranie towarów z miejsc składowania minimalizujących liczbę blokad lub całkowicie je eliminujących. Głównym celem artykułu jest przedstawienie metody i algorytmu systemu regałów przepływowych typu shuttle, który pozwoli zaplanować lokalizację przed składowaniem towarów w regałach, bazując na zamówieniach. W pracy przedstawiono model i zweryfikowano podstawową charakterystykę analizowanych problemów oraz otrzymane rozwiązanie.
Źródło:
Informatyka Ekonomiczna; 2020, 1 (55); 38-59
1507-3858
Pojawia się w:
Informatyka Ekonomiczna
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Post-optimal analysis for multicriteria integer linear programming problem with parametric optimality
Autorzy:
Emelichev, Vladimir
Nikulin, Yury
Powiązania:
https://bibliotekanauki.pl/articles/2049980.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
post-optimal analysis
multiple criteria
quasistability radius
integer linear programming
parametric optimality
Opis:
This paper addresses a multicriteria problem of integer linear programming with parametric optimality. Parameterizations is introduced by dividing a set of objectives into a family of disjoint subsets, within each Pareto optimality is used to establish dominance between alternatives. The introduction of this principle allows us to connect such classical optimality sets as Pareto and extreme. The parameter space of admissible perturbations in such problem is formed by a set of additive matrices, with arbitrary Hölder’s norms specified in the solution and criterion spaces. The attainable lower and upper bounds for the radii of quasistability are obtained.
Źródło:
Control and Cybernetics; 2020, 49, 2; 163-178
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of the polyblock method to special integer chance constrained problem
Autorzy:
Bellahcene, Fatima
Powiązania:
https://bibliotekanauki.pl/articles/406257.pdf
Data publikacji:
2019
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
stochastic programming
integer nonlinear programming
monotone optimization
polyblock method
Opis:
The focus in this paper is on a special integer stochastic program with a chance constraint in which, with a given probability, a sum of independent and normally distributed random variables is bounded below. The objective is to maximize the expectation of a linear function of the random variables. The stochastic program is first reduced to an equivalent deterministic integer nonlinear program with monotonic objective and constraints functions. The resulting deterministic problem is solved using the discrete polyblock method which exploits its special structure. A numerical example is included for illustration and comparisons with LINGO, COUENNE, BONMIN and BARON solvers are performed.
Źródło:
Operations Research and Decisions; 2019, 29, 4; 23-40
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 67

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