Operations Research Techniques in Wildfire Fuel Management
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
The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkin’s ground breaking contributions in various fields of decision making and data analysis have marked the fourth quarter of the 20th century and beyond. Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hidden structures—first of all, clusters, orderings, and hierarchies—in multivariate and/or network data.
This volume contains a collection of papers reflecting recent developments rooted in Mirkin's fundamental contribution to the state-of-the-art in group choice, ordering, clustering, data mining, and knowledge discovery. Researchers, students, and software engineers will benefit from new knowledge discovery techniques and application directions.
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.
Financial Decision Making Using Computational Intelligence covers all the recent developments in complex financial decision making through computational intelligence approaches. Computational intelligence has evolved rapidly in recent years and it is now one of the most active fields in operations research and computer science. The increasing complexity of financial problems and the enormous volume of financial data often make it difficult to apply traditional modeling and algorithmic procedures. In this context, the field of computational intelligence provides a wide range of useful techniques, including new modeling tools for decision making under risk and uncertainty, data mining techniques for analyzing complex data bases, and powerful algorithms for complex optimization problems.
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 book constitutes the proceedings of the 9th International Conference on Discrete Optimization and Operations Research, DOOR 2016, held in Vladivostok, Russia, in September 2016.
The 39 full papers presented in this volume were carefully reviewed and selected from 181 submissions. They were organized in topical sections named: discrete optimization; scheduling problems; facility location; mathematical programming; mathematical economics and games; applications of operational research; and short communications.
The computerized system of statistical operations research of pulsed optical tomography of spherical microobjects is under consideration. The system serves for creating new methods of dynamic space-time reconstruction of microobjects by their pulse discrete projection images and allows to perform dynamic measurements of main geometric miroobject properties. On this basis, original methods of on-line control and sorting by geometric dimensions and shape of nuclear fuel microobjects have been developed. These methods use the statistical reconstruction of the size (D) and shape (K) of each microobject on the base of their outline overall dimensions of three mutually orthogonal two-dimensional pulsed discrete projection images of each microobject. The processing speed of these methods are nearly 100 MO/s in the diameter range of 400–1500 μm.
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 , 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)