One. of the. main components of stochastic assignment models is the. route. choice. model solved with implicit or explicit path enumeration algorithms. Such models are. used both for congested networks within equilibr...
详细信息
One. of the. main components of stochastic assignment models is the. route. choice. model solved with implicit or explicit path enumeration algorithms. Such models are. used both for congested networks within equilibrium or dynamic models and for non-congested networks within static or pseudo-dynamic network loading models. This paper proposes a C-Logit model specification within a Dial algorithm structure. for the. implicit assignment of network flows. The. model and its solution algorithm, called D-C-Logit, combine. several positive. features found in the. literature. for choice set generation and choices from a given choice set: generation of a set of alternatives with a selective. approach;calculation of the. path choice. probability in a closed form;simulation of the. overlapping effect among alternative. paths;computation of just one. tree for each origin avoiding explicit path enumeration. This paper has two main objectives: the. proposition of a Dial-like. algorithm to solve. a C-Logit assignment model and application of the. algorithm to different networks in order to demonstrate. certain properties.
Video analytics, also known as video content analysis, involves a variety of pivotal tasks, such as video segmentation and recognition. In essence, performing most of these tasks can be viewed as learning an assignmen...
详细信息
Video analytics, also known as video content analysis, involves a variety of pivotal tasks, such as video segmentation and recognition. In essence, performing most of these tasks can be viewed as learning an assignment model. Here, assignment model refers to what each element in a target set is assigned to the element in an opposite source set under some kind of constraint. Existing assignment models generally suffer from some limitations. For instance, imperfect results can be obtained when the source set is artificially provided with less representativeness, or part of the target set has expected assignments, thus significantly limiting the application of assignment model. To alleviate these issues, we develop, in this paper, a general assignment model to dynamically learn a source set by minimizing structural dissimilarity in a low-dimensional space. Furthermore, by associating the expected assignment solution with empirical assignment indicator via a consistency boasting strategy, the proposed assignment model is provided with a potential powerful generalization ability to deal flexibly with the unsupervised, semi-supervised, and fully supervised scenarios in assignment model learning. Considering the separability of both objective and constraints to be solved, an alternating direction method of multipliers solver is presented with rigorous theoretical analysis on its convergence. Experimental results on video analysis, including motion segmentation, activities recognition, and scene categorization, demonstrate that the proposed general assignment model is considerable superior to the state-of-the-art methods.
This paper addresses the current gap in the literature on quantitative tools that enable a manager to build schedules which incorporate job rotation by employees. This is done within the framework of the well-known As...
详细信息
This paper addresses the current gap in the literature on quantitative tools that enable a manager to build schedules which incorporate job rotation by employees. This is done within the framework of the well-known assignment model recast in a multi-period setting. In addition to the usual objective of minimizing the total cost of assignment, we also consider a requirement to minimize the boredom felt by employees due to continued repetition of the same task over consecutive periods. Depending on alternative definitions of 'boredom', different bi-objective optimization models are formulated and solved using polynomial time algorithms or simple heuristics. In the case of heuristics, their implementation is discussed and computational experience is also reported.
We study the assignment model where a collection of indivisible goods are sold to a set of buyers who want to buy at most one good. We characterize the extreme and interior points of the set of Walrasian equilibrium p...
详细信息
We study the assignment model where a collection of indivisible goods are sold to a set of buyers who want to buy at most one good. We characterize the extreme and interior points of the set of Walrasian equilibrium price vectors for this model. Our characterizations are in terms of demand sets of buyers. Using these characterizations, we also give a unique characterization of the minimum and the maximum Walrasian equilibrium price vectors. Also, necessary and sufficient conditions are given under which the interior of the set of Walrasian equilibrium price vectors is non-empty. Several of the results are derived by interpreting Walrasian equilibrium price vectors as potential functions of an appropriate directed graph. (C) 2009 Elsevier B.V. All rights reserved.
This paper introduces a notion of consistency for the probabilistic assignment model, which we call probabilistic consistency. We show that the axioms equal treatment of equals and probabilistic consistency characteri...
详细信息
This paper introduces a notion of consistency for the probabilistic assignment model, which we call probabilistic consistency. We show that the axioms equal treatment of equals and probabilistic consistency characterize the uniform rule, which is the rule which randomizes uniformly over all possible assignments. (C) 2004 Elsevier B.V. All rights reserved.
Based on the characteristics of the equipment support and the current war factual situation, the rush-repair task of damage equipment was classified according to different urgent level. Then the rush-repair task assig...
详细信息
ISBN:
(纸本)9781424449033
Based on the characteristics of the equipment support and the current war factual situation, the rush-repair task of damage equipment was classified according to different urgent level. Then the rush-repair task assignment model was made based on the urgent level of the damaged equipment, and the method is given to solve the model. Finally, the example validates the model and the result indicates that the method operate simply and availability.
Rotational grazing is an effective way to improve grassland resources utilization and develop animal husbandry. Rational grazing scheme can avoid eco-environment damage caused by overgrazing, and it can ensure the liv...
详细信息
Rotational grazing is an effective way to improve grassland resources utilization and develop animal husbandry. Rational grazing scheme can avoid eco-environment damage caused by overgrazing, and it can ensure the livestock normal feeding. The rationality of rotational grazing management is affected by many complex and dynamic factors. This paper establishes a model of rotational grazing assignment based on grass resource leveling. Firstly, each rotational grazing plot's forage yield in each rotational grazing assignment stage is predicted by seasonal prediction method. Then, constrained by the rotational grazing plots' forage yield and livestock's forage demand, a dynamic rotational grazing assignment model is established, which combines the assignment model and carrying capacity constraint. Thus, the maximum edible forage in a rotational grazing cycle is contained and the distribution of the corresponding rotational grazing plots is determined. In each rotational grazing cycle, each rotational grazing plot can only be assigned once, which embodies the principle of ecological protection. And livestock have as much forage as possible in a rotational grazing cycle. Finally, through a case analysis, a feasible solution in a rotational grazing cycle is obtained. Through taking carrying capacity in each rotational grazing assignment stage as a standard to scheme the grazing order in each plot, the uncertainty of eco-environment is better reflected. A reasonable decision scheme of dynamic rotational grazing can make resources used efficiently in time and space. (C) 2020 The Authors. Published by Elsevier B.V.
We study assignment problems where individuals trade packages consisting of several, rather than single, objects. Although buyers' reservations values are nonadditive, efficient assignments can be formulated as a ...
详细信息
We study assignment problems where individuals trade packages consisting of several, rather than single, objects. Although buyers' reservations values are nonadditive, efficient assignments can be formulated as a linear programming problem in which the pricing functions expressing duality may be non-linear in the objects constituting the packages. The interconnections among the linear programming formulation, Walrasian equilibrium, and the core are established. In the single seller (auction) version, a necessary and sufficient condition is given for the Vickrey payoff point to be implementable by a pricing equilibrium. (C) 2002 Elsevier Science (USA).
Because of growing population and a consequent increase in number of vehicles, the problem of parking personal vehicles is becoming explosive. This paper suggests efficient use of surplus space to be utilized as parki...
详细信息
Because of growing population and a consequent increase in number of vehicles, the problem of parking personal vehicles is becoming explosive. This paper suggests efficient use of surplus space to be utilized as parking slot using analytical hierarchy process and integer programming model. Examples covering a real situation justify the approach. Copyright (C) 2011 John Wiley & Sons, Ltd.
Visual bag of words model have been applied in the recent past for the purpose of content-based image retrieval. In this paper, we propose a novel assignment model of visual words for representing an image patch. In p...
详细信息
ISBN:
(纸本)9789811021046;9789811021039
Visual bag of words model have been applied in the recent past for the purpose of content-based image retrieval. In this paper, we propose a novel assignment model of visual words for representing an image patch. In particular, a vector is used to represent an image patch with its elements denoting the affinities of the patch to belong to a set of closest/most influential visual words. We also introduce a dissimilarity measure, consisting of two terms, for comparing a pair of image patches. The first term captures the difference in affinities of the patches to belong to the common set of influential visual words. The second term checks the number of visual words which influences only one of the two patches and penalizes the measure accordingly. Experimental results on the publicly available COIL-100 image database clearly demonstrates the superior performance of the proposed content-based image retrieval (CBIR) method over some similar existing approaches.
暂无评论