A number of mathematical programming models for test construction have been presented in recent years. For example, Adema & van der Linden (1989) developed models for maximizing test reliability, and van der Linde...
详细信息
A number of mathematical programming models for test construction have been presented in recent years. For example, Adema & van der Linden (1989) developed models for maximizing test reliability, and van der Linden & Boekkooi-Timminga (1988) developed models for the construction of parallel tests. A minimization and a maximization model for parallel test construction under constraints are presented here, The purpose of the minimization model is to construct weakly and strongly parallel tests of minimum length. The purpose of the maximization model is to construct weakly and strongly parallel tests with maximum test reliability.
Networks provide a very useful way to describe a wide range of different data types in biology, physics and elsewhere. Apart from providing a convenient tool to visualize highly dependent data, networks allow stringen...
详细信息
ISBN:
(数字)9781848164345
ISBN:
(纸本)9781848164338
Networks provide a very useful way to describe a wide range of different data types in biology, physics and elsewhere. Apart from providing a convenient tool to visualize highly dependent data, networks allow stringent mathematical and statistical *** recent years, much progress has been achieved to interpret various types of biological network data such as transcriptomic, metabolomic and protein interaction data as well as epidemiological data. Of particular interest is to understand the organization, complexity and dynamics of biological networks and how these are influenced by network evolution and functionalityThe book is divided into comprehensive and self-contained chapters, each of which focuses on an important biological network type, explains concepts and theory and illustrates how these can be used to obtain insight into biologically relevant processes and questions. There are chapters covering metabolic, transcriptomic, protein interaction and epidemiological networks as well as chapters that deal with theoretical and conceptual material. The authors, who contribute to the book, are active, highly regarded and well-known in the network community.
Airports, are major components of the global transportation network and are the subject of continuous operational improvements. Commercial aviation industry has experienced substantial growth in the last decades. This...
详细信息
ISBN:
(纸本)9781479959273
Airports, are major components of the global transportation network and are the subject of continuous operational improvements. Commercial aviation industry has experienced substantial growth in the last decades. This booming demand generates economic benefits, however, it also increases the congestion levels at airports. While demand is a source of recurrent congestion, it is very common experience other forms of non-recurrent congestion. Extreme weather events, equipment failure and security threats are commonly encountered sources of non-recurrent congestion. This work presents the application of the systems engineering process to build a decision support system for ground traffic control. The proposed model should be able to assist ground traffic control operators to route planes in the taxiways in a system-optimal fashion. Business use cases, requirements, model verification, are presented. The proposed model is able to handle both, recurrent and non-recurrent congestion at the operational level. The proposed model is tested for a single runway airport case with moderate to heavy degree of congestion. Percentage of congestion effectively reduced ranged from 10% to 14%, depending on taxiway geometry. Results are encouraging enough to establish the proposed model as a feasible concept and, a practical system can be developed with further research and development. In addition, non-functional requirements at the management level allow using the model to determine capacity, and measure operational performance.
We discuss the issue of computing resource-optimal routing plans in a network domain. Given a number of known traffic demands, with associated required delays, we discuss how to route them and allocate resources for t...
详细信息
ISBN:
(纸本)9783642165573
We discuss the issue of computing resource-optimal routing plans in a network domain. Given a number of known traffic demands, with associated required delays, we discuss how to route them and allocate resources for them at each node so that the demands are satisfied. While a globally optimal routing plan requires joint computation of the paths and of the associated resources (which was claimed to be NP-hard), in this paper we stick to existing approaches for path computation, and use mathematical programming to model resource allocation once the paths are computed. We show that the problem is either convex or non-convex, depending on the scheduling algorithms adopted at the nodes. Our results show that, by computing resources per-path, instead of globally, the available capacity can be exceeded even at surprisingly low utilizations.
Learning-to-rank techniques have proven to be extremely useful for prioritization problems, where we rank items in order of their estimated probabilities, and dedicate our limited resources to the top-ranked items. Th...
详细信息
Learning-to-rank techniques have proven to be extremely useful for prioritization problems, where we rank items in order of their estimated probabilities, and dedicate our limited resources to the top-ranked items. This work exposes a serious problem with the state of learning-to-rank algorithms, which is that they are based on convex proxies that lead to poor approximations. We then discuss the possibility of "exact" reranking algorithms based on mathematical programming. We prove that a relaxed version of the "exact" problem has the same optimal solution, and provide an empirical analysis.
The concept of duality in mathematical programming is utilized to define a generalized duality principle between linear, minimum-variance estimation and fixed-time, linear-quadratic regulator problems which provides a...
详细信息
The paper describes a mathematical programming approach used for the line-planning problem in urban public transport. The input data include the transportation network in a city, O-D matrix of travel demand, and the s...
详细信息
ISBN:
(纸本)9781845644567
The paper describes a mathematical programming approach used for the line-planning problem in urban public transport. The input data include the transportation network in a city, O-D matrix of travel demand, and the set of available vehicles of specified transportation modes and types. The goal of line planning is to design the routes of lines and their frequencies. Supposing an initial set of lines has been proposed, the line-planning problem is formulated and solved as a multiple criteria optimisation problem, where the criteria reflect the travellers' demand for a high quality service, the operator's interest in an effective service, and the environmental impact of the vehicles. The solution to this problem specifies the number of vehicles of the given mode and type operating on the lines. Lines, which are not assigned a vehicle, will not operate. At the same time, the solution specifies optimal passenger routes in the line network. Then an iterative process follows which computes new line frequencies using a discrete choice model to respect passengers' behaviour when they have multiple travel alternatives.
The main goal of this article is to present several new results on the maximality of the composition and of the sum of maximal monotone operators in Banach spaces under weak interiority conditions involving their doma...
详细信息
The main goal of this article is to present several new results on the maximality of the composition and of the sum of maximal monotone operators in Banach spaces under weak interiority conditions involving their domains. Direct applications of our results to the structure of the range and domain of a maximal monotone operator are discussed. The last section of this note studies continuity properties of the duality product between a Banach space X and its dual X* with respect to topologies compatible with the natural duality (X x X*, X* x X).
This document describes the development an analysis of the main optimization methods used in flexible manufacturing systems (FMS) problems. The results are obtained from a random sample of more than one hundred docume...
详细信息
ISBN:
(纸本)9783030009793;9783030009786
This document describes the development an analysis of the main optimization methods used in flexible manufacturing systems (FMS) problems. The results are obtained from a random sample of more than one hundred documents published from 1986 to 2018 dedicated to the optimization of FMS. These are classified by their applications in the most significant fields of this area in analytical methods and heuristic methods. The discussion is based on the importance of this branch of engineering in the economic activity of a country and is motivation to continue doing research in it. The analysis also addresses some aspects of computational complexity found in ordinary optimization as well as the most common NP-hard problems of the FMS. The statistical results obtained are presented and the virtual future of the FMS is projected as well as the new challenges and opportunities to venture into this important field of human activity.
This paper presents a universal model transformation method for the problem which is represented in the form of facts. This method is the key element of the hybrid approach. In this approach, two environments of const...
详细信息
ISBN:
(纸本)9783319672298;9783319672281
This paper presents a universal model transformation method for the problem which is represented in the form of facts. This method is the key element of the hybrid approach. In this approach, two environments of constraint logic programming (CLP) and mathematical programming (MP) were integrated and hybridized. Hybrid approach is very effective method for modeling and solving different kinds of decision and optimization problems in manufacturing, transportation, logistics etc. These problems are characterized by large numbers of integer variables and constraints, which build a large space of possible solutions. The model transformation method makes it possible to significantly reduce this space even before looking for a solution. The paper also presents an author's illustrative model for variant of CVRP (Capacity Vehicle Routing Problem) and many numerical experiments to test the model transformation method and evaluate its effectiveness when using a hybrid approach.
暂无评论