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-25 z 67
Tytuł:
Stochastic algorithms in discrete optimization with noisy values for the function
Autorzy:
Wieczorkowski, Robert
Powiązania:
https://bibliotekanauki.pl/articles/747459.pdf
Data publikacji:
1995
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Stochastic programming
Mathematical programming methods
Integer programming
Opis:
.
The paper deals with stochastic methods for searching approximately global minimum of function defined on discrete set. A measure of quality of solution is defined to compare different algorithms. Simple Monte Carlo method is analysed as main algorithm for which formulas dealing with the measure of quality are derived(two cases: exact values and noisy values of function). This Monte Carlo method is used as a base in simulation experiments for comparing other stochastic algorithms. The second part of the paper analyses asymptotic properties of the generalised simulated annealing algorithms. Theory of Markov chains is used in modelling this class of algorithms. Theorems about convergence of the records of algorithms to set of optima with probability one are presented in the case of function having random noisy values. The paper also reviews known results in the field of simulated annealing type algorithms for function with randomly perturbated values.
Źródło:
Mathematica Applicanda; 1995, 24, 38
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quantitative approach to project portfolio management: proposal for Slovak companies
Autorzy:
Kral, Pavol
Valjaskova, Viera
Janoskova, Katarina
Powiązania:
https://bibliotekanauki.pl/articles/19107981.pdf
Data publikacji:
2019
Wydawca:
Instytut Badań Gospodarczych
Tematy:
mathematical model
integer programming
optimization
project portfolio
Opis:
Research background: Project portfolio optimization isa  demanding process in the case of considering a large number of project intentions and has so far been the subject of research by many authors, especially foreign authors. However, the issue of project portfolio optimization is an area that is not sufficiently addressed by Slovak authors. This was the main impulse to create a specific mathematical model of integer programming with bivalent variables to optimize the company's project portfolio with the intention to reflect the specific requirements of Slovak companies. Purpose of the article: The aim of the article is to propose a mathematical model of integer programming with bivalent variables to optimize the project portfolio with a focus on Slovak companies. Methods: In accordance with the aim of the article, a questionnaire survey was carried out with the intention of identifying the criteria that are perceived by the managers of Slovak companies as important in the optimization of the project portfolio. These criteria were subsequently reflected in the mathematical model design using the mathematical programming method. Findings & Value added: Based on a literature review aimed at the project portfolio optimization, we have found a gap in considering the compliance of project intentions and strategic objectives of the company within the optimization of the project portfolio. Based on the results of the questionnaire survey, the significance of the mutual compliance of project intentions with the strategic objectives of the company was confirmed from the point of view of Slovak companies. Given the fact that our aim was to create an innovative integer programming model with bivalent variables orientated to the conditions of Slovak companies, we included in the resulting model the criteria that were not considered within the scope of existing research in this area, and which are perceived as important by the Slovak companies.
Źródło:
Oeconomia Copernicana; 2019, 10, 4; 797-814
2083-1277
Pojawia się w:
Oeconomia Copernicana
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ł:
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ł:
Optimizing modular machining line design problem with mixed activation mode of machining units
Autorzy:
Belmokhtar, S.
Dolgui, A.
Delorme, X.
Ignatenko, I.
Powiązania:
https://bibliotekanauki.pl/articles/375904.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
modular machining line
cost optimization
mixed-integer programming
Opis:
A modular transfer line designing problem is investigated. The problem is to find the best subset of modules (machining units) from a given set and to assign them to different stations so that technological constraints and cycle upper limit are respected and the line cost is minimal. The investigated lines have a mixed activation mode for the machining units of each station, i. e. the units of each station are arranged into a series of stages such that each stage is composed of several units activated in parallel. A mixed integer program approach is proposed to model and solve the corresponding design problem. Improvements are suggested in order to reduce the model size and speed up the computations.
Źródło:
Decision Making in Manufacturing and Services; 2007, 1, 1-2; 35-48
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modelling multi-period set-up times in the Proportional Lot-Sizing Problem
Autorzy:
Kaczmarczyk, W.
Powiązania:
https://bibliotekanauki.pl/articles/375894.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
production
lot-sizing and scheduling
mixed-integer programming
Opis:
This paper presents new mixed integer programming models for the Proportional Lot-Sizing Problem (PLSP) with set-up times longer than a period. Proposed models explicitly calculate the distribution of times amongst products in periods with a changeover and determine a final period for every set-up operation. Presented results prove that the proposed models are easier to solve using standard MIP methods than already known models.
Źródło:
Decision Making in Manufacturing and Services; 2009, 3, 1-2; 15-35
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Practical tips for modelling Lot-Sizing and Scheduling Problems
Autorzy:
Kaczmarczyk, W.
Powiązania:
https://bibliotekanauki.pl/articles/375896.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
production
lot-sizing and scheduling
mixed-integer programming
Opis:
This paper presents some important alternatives for modelling Lot-Sizing and Scheduling Problems. First, the accuracy of models can improved by using short time buckets, which allow more detailed planning but lead to higher computational effort. Next, valid inequalities make the models tighter but increase their size. Sometimes it is possible to find a good balance between the size and tightness of a model by limiting a priori the number of valid inequalities. Finally, a special normalization of the variables simplifies the presentation of results and validation of models.
Źródło:
Decision Making in Manufacturing and Services; 2009, 3, 1-2; 37-48
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł:
Mixed Integer Programming Approaches to Planning and Scheduling in Electronics Supply Chains
Autorzy:
Sawik, T.
Powiązania:
https://bibliotekanauki.pl/articles/375874.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
electronics supply chains
planning and scheduling
mixed integer programming
Opis:
This paper discusses mixed-integer programming (MIP) approaches to planning and scheduling in electronics supply chains. First, the short-term detailed scheduling of wafer fabrication in semiconductor manufacturing and detailed scheduling of printed wiring board assembly in surface mount technology lines are discussed. Then, the medium-term aggregate production planning in a production/assembly facility of a consumer electronics supply chain is described; and finally, the coordinated aggregate planning and scheduling of the manufacturing and supply of parts and production of the finished products is presented. The decision variables are defined, and the MIP modeling frameworks are provided. Two decisionmaking approaches are discussed and compared: an integrated (simultaneous) approach, in which all required decisions are made simultaneously using a complex, large monolithic MIP model; and a hierarchical (sequential) approach, in which the required decisions are made successively using the hierarchies of simpler and smaller-sized MIP models. The paper also highlights the research on stochastic MIP applications to the planning and scheduling in electronics supply chains with disrupted material and information flows due to natural or man-made disasters.
Źródło:
Decision Making in Manufacturing and Services; 2017, 11, 1-2; 5-17
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modelling Set-up Times Overlapping Two Periods in the Proportional Lot-Sizing Problem with Identical Parallel Machines
Autorzy:
Kaczmarczyk, W.
Powiązania:
https://bibliotekanauki.pl/articles/375946.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
production planning
lot-sizing and scheduling
mixed-integer programming
Opis:
This paper presents a new mixed integer programming model for the Proportional Lot-Sizing Problem (PLSP) with identical parallel machines and set-up times overlapping two periods. The proposed model assumes constant period length and explicitly calculates the distribution of set-up operations among periods. The presented results of computational experiments with standard mip methods prove that the untying set-ups from period borders enables the reduction of the total costs in optimal solutions.
Źródło:
Decision Making in Manufacturing and Services; 2013, 7, 1-2; 43-50
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Developing and deploying electronics assembly line optimization tools: a Motorola case study
Autorzy:
Tirpak, T. M.
Powiązania:
https://bibliotekanauki.pl/articles/375906.pdf
Data publikacji:
2008
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
electronics assembly
line balancing
linear-integer programming
industrial case study
Opis:
The assignment of workloads to production equipment is one category of planning decision for an electronics assembly factory. In practice, line balancing requires not only selecting machines with sufficient placement accuracy and feeder capacity, but also addressing a host of other operational objectives and constraints. Motorola Labs led a multi-year effort to apply mathematical programming to balance a variety of production mix and volume scenarios. By representing the optimization problem as a specially structured, mixed linear-integer program, we were able to incorporate a high degree of reality in the model, simultaneously optimizing fixed setups, handling custom parts, maximizing machine uptime, and mitigating secondary bottlenecks. This paper presents the story of how we developed and deployed a software solution that significantly improved assembly cycle times, setup changeovers, and overall factory productivity, saving the company tens of millions of dollars.
Źródło:
Decision Making in Manufacturing and Services; 2008, 2, 1-2; 63-78
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Partial coordination may increase overall costs in supply chains
Autorzy:
Kaczmarczyk, W.
Powiązania:
https://bibliotekanauki.pl/articles/375910.pdf
Data publikacji:
2008
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
supply chain
production
distribution
lot-sizing
coordination
mixed-integer programming
Opis:
This paper presents a computational study to evaluate the impact of coordinating production and distribution planning in a two-level industrial supply chain. Three planning methods are compared. The first emulates the traditional way of planning. The two other coordinate plans of the supplier and of all the buyers according to the Vendor Managed Inventory (VMI) approach. The monolithic method solves a single model describing the entire optimization problem. The sequential method copies the imperfect VMI practice. All three methods are implemented by means of Mixed Integer Programming models. The results presented prove that the right choice of planning method is very important for overall cost of the supply chain. In contrast to the previous research, it turned out that information sharing without full coordination may even lead to increase in the overall cost. For some companies applying the VMI approach, developing exact models and solving them almost optimally may therefore be very important.
Źródło:
Decision Making in Manufacturing and Services; 2008, 2, 1-2; 47-62
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
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ł:
Energy-saving Algorithms for the Control of Backbone Networks: A Survey
Autorzy:
Kamola, M.
Niewiadomska-Szynkiewicz, E.
Arabas, P.
Sikora, A.
Powiązania:
https://bibliotekanauki.pl/articles/307968.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
green routing
mixed-integer programming
OSPF heuristics
power-save networks
Opis:
The rapid growth of energy demand by wired IP networks can be mitigated on hardware and software levels. While upgrading to more efficient transmission media still brings biggest savings, we take a look here at power-saving algorithms that combine the capability of setting networking equipment in arbitrary energy states which, combined with profound knowledge of the network traffic matrix, leads to considerable complex optimization problem formulations. Alternatively, lightweighted heuristic approaches are presented, built on much simpler network model but still capable to perform energy-efficient traffic engineering.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 2; 13-20
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hybrid Models for the OWA Optimization
Autorzy:
Olender, P.
Powiązania:
https://bibliotekanauki.pl/articles/307934.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
location problem
mixed-integer programming
mixed linear programming
multiple criteria
ordered weighted averaging
Opis:
When dealing with multicriteria problems, the aggregation of multiple outcomes plays an essential role in finding a solution, as it reflects the decision-maker's preference relation. The Ordered Weighted Averaging (OWA) operator provides a exible preference model that generalizes many objective functions. It also ensures the impartiality and allow to obtain equitable solutions, which is vital when the criteria represent evaluations of independent individuals. These features make the OWA operator very useful in many fields, one of which is location analysis. However, in general the OWA aggregation makes the problem nonlinear and hinder its computational complexity. Therefore, problems with the OWA operator need to be devised in an efficient way. The paper introduces new general formulations for OWA optimization and proposes for them some simple valid inequalities to improve efficiency. A hybrid structure of proposed models makes the number of binary variables problem type dependent and may reduce it signicantly. Computational results show that for certain problem types, some of which are very useful in practical applications, the hybrid models perform much better than previous general models from literature.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 4; 22-30
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The airport gate assignment problem – multi-objective optimization versus evolutionary multi-objective optimization
Autorzy:
Kaliszewski, I.
Miroforidis, J.
Stańczak, J.
Powiązania:
https://bibliotekanauki.pl/articles/305661.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
airport gate assignment problem
Evolutionary Multi-objective Optimization
mixed-integer programming
Opis:
In this paper, we approach the Airport Gate Assignment Problem by Multi-objective Optimization as well as Evolutionary Multi-objective Optimization. We solve a bi-criteria formulation of this problem by the commercial mixed-integer programming solver CPLEX and a dedicated Evolutionary Multi-objective Optimization algorithm. To deal with multiple objectives, we apply a methodology that we developed earlier to capture decision-maker preferences in multi-objective environments. We present the results of numerical tests for these two approaches.
Źródło:
Computer Science; 2017, 18 (1); 41-52
1508-2806
2300-7036
Pojawia się w:
Computer Science
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ł:
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ł:
An integer optimization model and algorithms to support the cost-revenue study and provisory designing warehouses or other storage objects
Autorzy:
Miatselski, M.
Staruch, B.
Powiązania:
https://bibliotekanauki.pl/articles/298439.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Warmińsko-Mazurski w Olsztynie
Tematy:
warehouse design
cost-revenue recognition
state space
model
algorithm
nonlinear programming
integer programming
Opis:
An optimization model for the cost–revenue study at the stage of system analysis and preliminary designs of storage objects such as warehouses, containers, packs and similar objects are developed. Our assumptions motivated by warehouses design lead us to a nonlinear integer optimization problem with the only basic constraint. We present algorithmic methods for obtaining the exact solution to the general problem with emphasizing the special case when both the objective and the constraint functions are increasing. The results of the paper may be used in developing software tools intended for supporting designers.
Źródło:
Technical Sciences / University of Warmia and Mazury in Olsztyn; 2018, 21(4); 257-269
1505-4675
2083-4527
Pojawia się w:
Technical Sciences / University of Warmia and Mazury in Olsztyn
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem
Autorzy:
Jain, P.
Saran, G.
Srivastava, K.
Powiązania:
https://bibliotekanauki.pl/articles/384223.pdf
Data publikacji:
2016
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
Vertex Bisection Minimization
Integer Linear Programming
quadratic programming
Opis:
Vertex Bisection Minimization problem (VBMP) consists of partitioning a vertex set V of graph G = (V, E) into two sets B and B′ where ∣B∣ = [\v|/2] such that vertex width (VW) is minimized where vertex width is defined as the number of vertices in B which are adjacent to at least one vertex in B′. It is an NP-complete problem in general. VBMP has applications in fault tolerance and is related to the complexity of sending messages to processors in interconnection networks via vertex disjoint paths. In this paper, we have proposed a new integer linear programming (ILP) and quadratically constrained quadratic programming (QCQP) formulation for VBMP. Both of them require number of variables and constraints lesser than existing ILPs and QCQP. We have also implemented ILP and obtained optimal results for various classes of graphs. The result of the experiments with the benchmark graphs shows that the proposed model outperforms the state of the art. Moreover, proposed model obtains optimal result for all the benchmark graphs.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2016, 10, 1; 69-73
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A New Mathematical Model for Multisession Exams-Building Assignment
Autorzy:
Ergul, Z.
Kamisli Ozturk, Z.
Powiązania:
https://bibliotekanauki.pl/articles/1031701.pdf
Data publikacji:
2017-09
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
Educational timetabling
Examination-building assignment
Multi objective nonlinear optimization
Mixed Integer Programming
Opis:
The educational timetabling problem has been extensively investigated in timetabling literature. However, the problem of assigning exams to examination buildings has not been studied intensively by researchers. We were inspired by Open and Distance Education System exams of Anadolu University. Anadolu University Open and Distance Education System, which is used by approximately two millions of students and has more than two millions of graduates, is a well-known institution in Turkey. In this study, we propose a multi-objective mathematical model for multisession exam-building assignment problem. Objective functions of this model are to minimize the distance between consecutive session buildings for a given student, to maximize the number of occupants of buildings in every session and to minimize the variety of booklets for building in every session. Mathematical model has been found inadequate because students-examination building assignment in the Anadolu University Open Education system is a large size real life problem. Starting from this point of view, an order-based multi-objective heuristic algorithm is developed to solve this problem. The solutions obtained by the proposed algorithm are compared with the solution obtained by the mathematical modelling and the current state of the existing system.
Źródło:
Acta Physica Polonica A; 2017, 132, 3; 1207-1210
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An incremental approach for storage and delivery planning problems
Autorzy:
Sakakibara, K.
Tian, Y.
Nishikawa, I.
Powiązania:
https://bibliotekanauki.pl/articles/375942.pdf
Data publikacji:
2012
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
simultaneous optimization
logistic terminal
consolidate shipment
mixed-integer programming
relax-and-fix
Opis:
We consider a logistic planning problem for simultaneous optimization of the storage and the delivery. This problem arises in the consolidate shipment using an intermediate storage in a supply chain, which is typically found in the automobile industry. The vehicles deliver the items from the origin to the destination, while the items can be stored at some warehousing facilities as the intermediate storage during the delivery. The delivery plan is made for each day separately, but the storage at a warehouse may last for more than one day. Therefore, the entire logistic plan should be considered over a certain period for the total optimization. We formulate the storage and delivery problem as a mixed integer programming. Then, we propose a relax-and-fix type heuristic method, which incrementally fixes decision variables until all the variables are fixed to obtain a complete solution. Moreover, a semiapproximate model is introduced to effectively fix the variables. Based on the formulation, the delivery plan can be solved for each day separately. This has the advantage especially in the dynamic situation, where the delivery request is modified from the original request before the actual delivery day. Numerical experiments show that the simultaneous optimization gives the effective storage plan to reduce the total logistic cost, and the proposed heuristics efficiently reduce the computational time and are robust against the dynamic situation.
Źródło:
Decision Making in Manufacturing and Services; 2012, 6, 1-2; 5-23
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
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ł:
Combinatorial approaches to the capital-budgeting problem
Autorzy:
Pichugina, O.
Powiązania:
https://bibliotekanauki.pl/articles/411221.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Oddział w Lublinie PAN
Tematy:
capital-budgeting problem
integer programming
knapsack problem
combinatorial optimization
Branch and Bound
Opis:
Optimization approaches, combinatorial and continuous, to a capital-budgeting problem (CBP) are presented. This NP-hard problem, traditionally modelled as a linear binary problem, is represented as a biquadratic over an intersection of a sphere and a supersphere. This allows applying nonlinear optimization to it. Also, the method of combinatorial and surface cuttings (MCSC) is adopted to (CBP). For the single constrained version (1CBP), new combinatorial models are introduced based on joint analysis of the constraint, objective function, and feasible region. Equivalence of (1CBP) to the multichoice knapsack problem (MCKP) is shown. Peculiarities of Branch&Bound techniques to (1CBP) are described.
Źródło:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2016, 5, 4; 29-36
2084-5715
Pojawia się w:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Flexible measure in the presence of the partial input to output impacts process
Autorzy:
Shakouri, Rita
Salahi, Maziar
Kordrostami, Sohrab
Wu, Jie
Powiązania:
https://bibliotekanauki.pl/articles/406427.pdf
Data publikacji:
2019
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
data envelopment analysis
flexible measure
efficiency
integer programming
partial impact
bank industry
Opis:
Precise recognition of the nonparametric measurement approach in the production process and proper application of accurate techniques to categorise the variables play a key role in the process of improving performance of decision-making units (DMUs). The classical data envelopment analysis (DEA) models require that the status of all inputs and outputs measures be precisely specified in advance. However, there are situations where a performance measure can play input role for some DMUs and output role for the others. This paper introduces an approach to determine the situation of such flexibility where in the presence of resource sharing among subunits, the partial input will impact output in DEA. As a result, DMUs have a fair evaluation when compared to each other. Likewise, the maximum improvement is obtained in aggregate efficiency due to partial input to output impacts. The proposed approach is applied to a set of real data collected from 30 branches of an Iranian bank.
Źródło:
Operations Research and Decisions; 2019, 29, 3; 77-98
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-25 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