Book
VIII Moscow International Conference on Operations Research (ORM2016) Moscow, October 17–22, 2016
The coalitional manipulability of voting rules for special case of coalition formation is studied by computer experiment. For the considered case, the coalition, upon manipulation, consists of agents with the same alternative on the first place in their orderings. Not necessary all agents of the manipulating coalition should report insincere preferences, i.e. manipulating agents can join others by adjusting the preferences. This makes the coalition formation more flexible, inducing the increase of the Nitzan-Kelly manipulability index by different value for different voting rules. Calculations are made for 3 alternatives for knows aggregation procedures.
We consider a problem of the astronaut training scheduling. Each astronaut has his own set of tasks which should be performed with respect to resource and time constraints. The problem is to determine start moments for all considered tasks. For this issue a mathematical model based on integer linear programming is proposed. Computational results of the implemented model and experiments on real data are presented.
Single track segments are common in various railway networks, in particular in various supply chains. For such a segment, connecting two stations, the trains form two groups, depending on what station is the initial station for the journey between these two stations. Within a group the trains differ by their cost functions. It is assumed that the single track is sufficiently long so several trains can travel in the same direction simultaneously. The paper presents polynomial-time algorithms for different versions of this two-station train scheduling problem with a single railway track. The considered models differ from each other by their objective functions.
The cosmonauts training planning problem is a problem of construc- tion of cosmonauts training timetable. Each cosmonaut has his own set of tasks which should be performed with respect to resource and time con- straints. The problem is to determine start moments for all considered tasks. This problem is a generalization of the resource-constrained project scheduling problem with “time windows”. In addition, the investigated problem is extended with restrictions of different kinds. Previously, for solving this problem the authors proposed an approach based on methods of integer linear programming. However, this approach turned out to be ineffective for high-dimensional problems. A new heuristic method based on constraint programming is developed. The effectiveness of the method is verified on real data.
This journal publishes the mathematics section of Series I of the Vestnik (Herald) of St. Petersburg University, and is one of the oldest Russian mathematics journals in English translation. Articles cover the major areas of pure and applied mathematics.
Many famous mathematicians are associated with the Faculty of Mathematics and Mechanics at St. Petersburg University, including Chebyshev, Lyapunov, Alexandrov, Smirnov, Kantorovich, to name a few. Today, mathematics/mechanics faculty members continue the excellent tradition in mathematics associated with the University and the Vestnik is the prime outlet for their research results.
On the one hand, the relevance of this research is determined by an attempt of solving the problem of optimal inventory allocation, which can open the possibilities for increase in stock turnover. On the other hand, there was an attempt to extend the list of problems which can be solved by operations research methods. The potential of application of operations research methods (transport model as a specific case of linear programming, in particular) is underestimated. According to Taha [2011], a transport model is a problem of finding optimal allocation of homogeneous objects from accumulators (a i ) to receivers (b i ) with minimizations of costs on displacement or movement. In our opinion, the canonical form of a transport model represents accumulators as points of departures, receivers as clients and cost on displacement as transport costs. The paradigm of using this model is constrained by using the latter in transport logistics only. In fact we can apply this model in much more problems (micro, meso or macro level). This study shows that objects and variables from the canonical transport model can be represented as objects from different fields (beyond logistics) thus helping to find an optimal solution to a certain problem. Our study represents accumulators as nominal cells where work-in-process (WIP) product is in the warehouse, receivers - as production lines and costs on displacements as mileage of loaders. Thus, the cost function Z that we want to optimize is the function of mileage of loaders. Minimizing function Z will enable us to find the optimal allocation of WIP products to production lines (next production stage)
Wildfires are a naturally occurring phenomenon in many places of 4 the world. While they perform a number of important ecological functions, the 5 proximity of human activities to forest landscapes requires a measure of control/pre- 6 paredness to address safety concerns and mitigate damage. An important technique 7 utilized by forest managers is that of wildfire fuel management, in which a portion 8 of the available combustible material in the forest is disposed of through a variety 9 of fuel treatment activities. A number of operations research approaches have been 10 applied to locate and schedule these fuel treatment activities, and herein we review 11 and discuss the various models and approaches in the literature
EURO 2013 Abstract Book