5 results
Search Results
2. QUANTITATIVE MEASURES FOR CHARACTERISTICS OF A STATE-DEPENDENT ASSIGNMENT POLICY.
- Author
-
Halpern, Jonathan and Wand, Yair
- Subjects
MATHEMATICAL optimization ,MATHEMATICAL analysis ,MATHEMATICS ,OPERATIONS research ,EXPERIMENTAL design ,MATHEMATICAL programming - Abstract
The paper presents an analytical description of a state-dependent assignment policy, where different assignments of attributes to objects are employed under different states. Various considerations, other than optimizing an objective function, present themselves for such cases—for example, the existence of groups of assignees with certain levels of intragroup assignment uniformity, the stability of the policy over states, the presence of a revealed preference ordering of the assignments, and others. An approach towards a quantitative treatment of such features of a state-dependent assignment policy is discussed, and in particular a uniformity measure is defined and its properties are investigated. Potential uses of the model are suggested for urban emergency services, questionnaire analysis, task allocation, medical diagnosis, and dynamic computer program behavior. Three implementations for questionnaire analysis are reported. [ABSTRACT FROM AUTHOR]
- Published
- 1980
- Full Text
- View/download PDF
3. Efficient heuristics for the Rural Postman Problem.
- Author
-
Groves, G. W. and van Vuuren, J. H.
- Subjects
- *
TRAVELING salesman problem , *MATHEMATICAL programming , *HEURISTIC programming , *FUNCTIONAL equations , *MATHEMATICAL optimization , *OPERATIONS research , *MATHEMATICAL analysis , *PROBABILITY theory , *MATHEMATICS - Abstract
A local search framework for the (undirected) Rural Postman Problem (RPP) is presented in this paper. The framework allows local search approaches that have been applied successfully to the well-known Travelling Salesman Problem also to be applied to the RPP. New heuristics for the RPP, based on this framework, are introduced and these are capable of solving significantly larger instances of the RPP than have been reported in the literature. Test results are presented for a number of benchmark RPP instances in a bid to compare efficiency and solution quality against known methods. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
4. Scheduling maintenance services to three machines.
- Author
-
Anily, Shoshana, Glass, Celia A., and Hassin, Refael
- Subjects
PRODUCTION scheduling ,OPERATIONS research ,PRODUCTION control ,COST control ,MATHEMATICAL programming ,MATHEMATICAL analysis ,MATHEMATICS - Abstract
We study a discrete problem of scheduling activities of three types under the constraint that at most a single activity can be scheduled to any one period. Applications of such a model are the scheduling of maintenance service to machines and multi-item replenishment of stock. We assume that the cost associated with any given type of activity increases linearly with the number of periods since the last execution of this type. The problem is to specify at which periods to execute each of the activity types in order to minimize the long-run average cost per period. We analyze various forms of optimal solution which may occur, relating them to the combination of the three machine cost constants. Some cases remain unsolved by this method and for these we develop a heuristic whose worst case performance is no more than 3.33% from the optimal. [ABSTRACT FROM AUTHOR]
- Published
- 1999
- Full Text
- View/download PDF
5. EFFICIENT ON-LINE COMPUTATION OF CONSTRAINED OPTIMAL CONTROL.
- Author
-
Baotć, Mato, Borrelli, Francesco, Bemporad, Alberto, and Morari, Manfred
- Subjects
COMPUTATIONAL complexity ,AUTOMATIC control systems ,ROBUST control ,MATHEMATICAL programming ,CONTROL theory (Engineering) ,NUMERICAL analysis ,OPERATIONS research ,MATHEMATICAL analysis ,MATHEMATICS - Abstract
We consider constrained finite-time optimal control problems for discrete-time linear time-invariant systems with constraints on inputs and outputs based on linear and quadratic performance indices. The solution to such problems is a time-varying piecewise affine (PWA) statefeedback law and can be computed by means of multiparametric programming. By exploiting the properties of the value function and the piecewise affine optimal control law of the constrained finitetime optimal control (CFTOC), we propose two new algorithms that avoid storing the polyhedral regions. The new algorithms significantly reduce the on-line storage demands and computational complexity during evaluation of the PWA feedback control law resulting from the CFTOC. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.