Informacja

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

Wyszukujesz frazę "Integer programming" wg kryterium: Temat


Wyświetlanie 1-10 z 10
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ł:
Overlay Multicast Optimization : IBM ILOG CPLEX
Autorzy:
Kucharzak, M.
Zydek, D.
Poźniak-Koszałka, I.
Powiązania:
https://bibliotekanauki.pl/articles/226362.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
overlay multicast
maximum flows
linear programming
mixed-integer programming
Opis:
IBM ILOG CPLEX Optimization Studio delivers advanced and complex optimization libraries that solve linear programming (LP) and related problems, e.g., mixed integer. Moreover, the optimization tool provides users with its Academic Research Edition, which is available for teaching and noncommercial research at no-charge. This paper describes the usage of CPLEX C++ API for solving linear problems and, as an exhaustive example, optimization of network flows in overlay multicast is taken into account. Applying continuous and integral variables and implementing various constraints, including equations and inequalities, as well as setting some global parameters of the solver are presented and widely explained.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 4; 381-388
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A mixed integer program for cyclic scheduling of flexible flow lines
Autorzy:
Sawik, T.
Powiązania:
https://bibliotekanauki.pl/articles/201462.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flexible flow line
cyclic scheduling
cyclic-batch scheduling
mixed-integer programming
Opis:
A new mixed integer programming formulation is presented for cyclic scheduling in flow lines with parallel machines and finite in-process buffers, where a Minimal Part Set (MPS) in the same proportion as the overall production target is repetitively scheduled. The cycle of parts in an MPS is not determined a priori, but is obtained along with the optimal schedule for all parts. In addition to the cyclic scheduling, a cyclic-batch scheduling mode is introduced, where within the MPS the parts of one type are processed consecutively. Numerical examples are included and some results of computational experiments are reported.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 1; 121-128
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Methods of planning deliveries of food products to a trade network with the selection of suppliers and transport companies
Autorzy:
Magiera, M.
Powiązania:
https://bibliotekanauki.pl/articles/229719.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
supply network
supply chain management
logistics
integer programming
transportation
scheduling
hierarchical planning
Opis:
The paper refers to planning deliveries of food products (especially those available in certain seasons) to the recipients: supermarket networks. The paper presents two approaches to solving problems of simultaneous selection of suppliers and transportation modes and construction of product flow schedules with these transportation modes. Linear mathematical models have been built for the presented solution approaches. The cost criterion has been taken into consideration in them. The following costs have been taken into account: purchase of products by individual recipients, transport services, storing of products supplied before the planned deadlines and penalties for delays in supply of products. Two solution approaches (used for transportation planning and selection of suppliers and selection of transportation modes) have been compared. The monolithic approach calls for simultaneous solutions for the problems of supplier selection and selection of transportation modes. In the alternative (hierarchical) solution approach, suppliers are selected first, and then transportation companies and their relevant transportation modes are selected. The results of computational experiments are used for comparison of the hierarchical and monolithic solution approaches.
Źródło:
Archives of Control Sciences; 2018, 28, 3; 419-442
1230-2384
Pojawia się w:
Archives of Control Sciences
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ł:
A multi-level method of support for management of product flow through supply chains
Autorzy:
Magiera, M.
Powiązania:
https://bibliotekanauki.pl/articles/201930.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
supply network
supply chain
scheduling
logistic
integer programming
decision making
zasilanie
łańcuch dostaw
harmonogramowanie
logistyka
podejmowanie decyzji
Opis:
The paper presents a three-level method used to support the management of product flow through supply chain links (e.g. production lines) and between these links: suppliers and recipients of products of various types.The supply chain includes both producers of components (suppliers) and recipients of these components, which are used for the production of complex goods. The method is dedicated to the development of schedules of product flows through particular production plants (links in supply chains) and between individual plants. Each module of the developed system refers to a separate production plant. The organization of product flow through production lines covers different types of production routes and different configurations of production systems. At the first level of the method, preliminary production schedules are developed for each plant within the supply chain. The second level of the method is dedicated to the development of delivery schedules of components and semi-finished products to these plants. The determined delivery times of components to the individual production plants constitute data for the third level of the method. At this lowest level, detailed schedules of product flow through production lines with the producers of complex goods are developed. Linear mathematical models have been built for each level of the method. In the developed method, optimization take place in the developed method in the scale of the entire supply chain (cost reduction), as well as in the scale of its links (production lines for which manufacturing schedules are built with various criteria taken into consideration). The computational experiments used for verification of the method have been included.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 4; 933-946
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
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ł:
Real – time dispatching modelling for trucks with different capacities in open pit mines
Modelowanie w czasie rzeczywistym przewozów ciężarówek o różnej ładowności w kopalni odkrywkowej
Autorzy:
Ahangaran, D. K.
Yasrebi, A. B.
Wetherelt, A.
Foster, P.
Powiązania:
https://bibliotekanauki.pl/articles/218736.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
transportation
truck dispatching and allocation
optimisation of mines’ transportationtion
integer programming
transport
dysponowanie przewozami
optymalizacja transportu w kopalni
programowanie binarne
Opis:
Application of fully automated systems for truck dispatching plays a major role in decreasing the transportation costs which often represent the majority of costs spent on open pit mining. Consequently, the application of a truck dispatching system has become fundamentally important in most of the world’s open pit mines. Recent experiences indicate that by decreasing a truck’s travelling time and the associated waiting time of its associated shovel then due to the application of a truck dispatching system the rate of production will be considerably improved. Computer-based truck dispatching systems using algorithms, advanced and accurate software are examples of these innovations. Developing an algorithm of a computer-based program appropriated to a specific mine’s conditions is considered as one of the most important activities in connection with computer-based dispatching in open pit mines. In this paper the changing trend of programming and dispatching control algorithms and automation conditions will be discussed. Furthermore, since the transportation fleet of most mines use trucks with different capacities, innovative methods, operational optimisation techniques and the best possible methods for developing the required algorithm for real-time dispatching are selected by conducting research on mathematical-based planning methods. Finally, a real-time dispatching model compatible with the requirement of trucks with different capacities is developed by using two techniques of flow networks and integer programming.
Zastosowanie w pełni zautomatyzowanych systemów dysponowania przewozami ciężarówek w poważny sposób przyczynia się do zmniejszenia kosztów transportu, które częstokroć mają poważny udział w kosztach funkcjonowania kopalni odkrywkowych. Dlatego też zastosowanie systemu dysponowania transportem ma kluczowe znaczenie w kopalniach odkrywkowych na świecie. Niedawne doświadczenia wskazują, że poprzez zmniejszenie czasu przejazdu ciężarówek oraz zmniejszenie czasu oczekiwania dzięki zastosowaniu systemu dysponowania przewozami możliwe jest znaczne podniesienie poziomu produkcji. Wspomagany komputerowo system dysponowania przewozami wykorzystujący odpowiednie algorytmy a także zaawansowane oprogramowanie stanowią przykłady nowoczesnych rozwiązań w tej dziedzinie. Opracowanie algorytmu komputerowego dostosowanego do konkretnych warunków panujących w danej kopalni odkrywkowej jest jedną z kluczowych czynności dla uruchomienia komputerowego systemu dysponowania przewozami ciężarówek w kopalni. W artykule przedstawiono zmieniające się trendy w zakresie programowania, algorytmów sterowania przewozami i automatyzacji. Ponadto, ponieważ większość kopalni odkrywkowych wykorzystuje ciężarówki o różnej ładowności, wybrano najlepsze i najnowocześniejsze metody i techniki optymalizacji oraz najskuteczniejsze metody opracowywania algorytmów wspomagających systemy dysponowania przejazdami ciężarówek w czasie rzeczywistym, wybrano je w oparciu o metody planowania wykorzystujące aparat matematyczny. W części końcowej zaprezentowano model dysponowania przewozami w czasie rzeczywistym kompatybilny z wymogiem zastosowania ciężarówek o różnej ładowności, opracowany w oparciu o metody sieci przepływowych i programowania binarnego.
Źródło:
Archives of Mining Sciences; 2012, 57, 1; 39-52
0860-7001
Pojawia się w:
Archives of Mining Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimum Bend Shortest Rectilinear Route Discovery for a Moving Sink in a Grid Based Wireless Sensor Network
Autorzy:
Thomas, Sanu
Mathew, Thomaskutty
Powiązania:
https://bibliotekanauki.pl/articles/226096.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
minimum bend shortest paths
travelling salesman problem
binary integer programming
edge orientation index
Vertex Bend Index
Vertex-Edge Incident Matrix
Opis:
In a rectilinear route, a moving sink is restricted to travel either horizontally or vertically along the connecting edges. We present a new algorithm that finds the shortest round trip rectilinear route covering the specified nodes in a grid based Wireless Sensor Network. The proposed algorithm determines the shortest round trip travelling salesman path in a two-dimensional grid graph. A special additional feature of the new path discovery technique is that it selects that path which has the least number of corners (bends) when more than one equal length shortest round trip paths are available. This feature makes the path more suitable for moving objects like Robots, drones and other types of vehicles which carry the moving sink. In the prosed scheme, the grid points are the vertices of the graph and the lines joining the grid points are the edges of the graph. The optimal edge set that forms the target path is determined using the binary integer programming.
Źródło:
International Journal of Electronics and Telecommunications; 2019, 65, 2; 267-276
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mathematical programming model of cost optimization for supply chain from perspective of logistics provider
Autorzy:
Sitek, P.
Wikarek, J.
Powiązania:
https://bibliotekanauki.pl/articles/407341.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
logistyka
łańcuch dostaw
koszty
optymalizacja
transport multimodalny
supply chain
MILP
mixed integer linear programming
optimization
3PL-Third Party Logistic
multimodal transport
Opis:
The article presents the problem of optimizing the supply chain from the perspective of a logistics provider and includes a mathematical model of multilevel cost optimization for a supply chain in the form of MILP (Mixed Integer Linear Programming). The costs of production, transport and distribution were adopted as an optimization criterion. Timing, volume, capacity and mode of transport were also taken into account. The model was implemented in the environment of LINGO ver. 12 package. The implementation details, the basics of LINGO as well as the results of the numerical tests are presented and discussed. The numerical experiments were carried out using sample data to show the possibilities of practical decision support and optimization of the supply chain. In addition, the article presents the current state of logistics outsourcing.
Źródło:
Management and Production Engineering Review; 2012, 3, 2; 49-61
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-10 z 10

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