A Technique for Improving Readability of Forrester Diagram in System Dynamics
A terminal area topology-independent GB-based conflict detection system for A-SMGCS.
A module for conflict detection in A-SMGCS is presented. It supervises the operations that the ground controller has to perform. It doesn?t depend on the topology of the terminal area. The system guarantees the safety of the proposed situation, that is, the impossibility that a conflict arises among aircrafts (and also road vehicles) obeying the signaling. We suppose that the terminal area has stop bars (or semaphores) controlling all intersections and accesses between runways, taxiways, exits,...
A theorem of the alternative and a two-function minimax theorem.
A Theorem On The Optimal Allocation Of Effort.
A theoretical model for testing new product sales velocity at small format retail stores
The present study proposes a theoretical model to test sales velocity for new products introduced in small format retail stores. The model is designed to distinguish fast moving products within a relatively short period. Under the proposed model, the sales of a newly introduced product are monitored for a prespecified period , e.g., one week, and if the number of items sold over is equal to a prespecified integer or more, the product is considered a fast moving product and is carried over to...
A Theoretical Model for Testing New Product Sales Velocity at Small Format Retail Stores
The present study proposes a theoretical model to test sales velocity for new products introduced in small format retail stores. The model is designed to distinguish fast moving products within a relatively short period. Under the proposed model, the sales of a newly introduced product are monitored for a prespecified period T, e.g., one week, and if the number of items sold over T is equal to a prespecified integer k or more, the product is considered a fast moving product and is carried over...
A thermodynamically motivated optimization algorithm: Circular wheel balance optimization
The author investigates a Monte Carlo algorithm for finding suboptimal solutions for a wide clase of complicated optimization problems characterized by a large combinatorial complexity. This algorithm was applied to one specific problem: circular wheel balance optimization. The slow increase of the effort along with the increasing size of the problems and the generality of the method promise that the thermodynamically motivated optimization will become a very universal and effective optimization...
A threshold accepting approach to the open vehicle routing problem
In this paper we consider the operational planning problem of physical distribution via a fleet of hired vehicles, for which the travelling cost is solely a function of the sequence of locations visited within all open delivery routes, while vehicle fixed cost is inexistent. The problem is a special class of vehicle routing and is encountered in the literature as the Open Vehicle Routing Problem (OVRP), since vehicles are not required to return to the depot. The goal is to distribute in an optimal...
A threshold accepting approach to the Open Vehicle Routing problem
In this paper we consider the operational planning problem of physical distribution via a fleet of hired vehicles, for which the travelling cost is solely a function of the sequence of locations visited within all open delivery routes, while vehicle fixed cost is inexistent. The problem is a special class of vehicle routing and is encountered in the literature as the Open Vehicle Routing Problem (OVRP), since vehicles are not required to return to the depot. The goal is to distribute in an...
A tight bound of modified iterative hard thresholding algorithm for compressed sensing
We provide a theoretical study of the iterative hard thresholding with partially known support set (IHT-PKS) algorithm when used to solve the compressed sensing recovery problem. Recent work has shown that IHT-PKS performs better than the traditional IHT in reconstructing sparse or compressible signals. However, less work has been done on analyzing the performance guarantees of IHT-PKS. In this paper, we improve the current RIP-based bound of IHT-PKS algorithm from to , where is the restricted...
A timed Petri net framework to find optimal IRIS schedules
A time-dependent best choice problem with costs and random lifetime in organ transplants
This paper develops and analyzes a time-dependent optimal stopping problem and its application to the decision making process concerning organ transplants. Offers (organs for transplant) appear at jump times of a Poisson process. The values of the offers are i.i.d. random variables with a known distribution function. These values express the degree of histocompatibility between the donor and the recipient. The sequence of offers is independent of the jump times of the Poisson process. The decision...
A Time-Predefined Approach to Course Timetabling
A topology over a set of systems
The systems of an arbitrary number of linear inequalities OVer a real locally convex space have been classified in three classes, namely: consistent, weakly inconsistent and strongly inconsistent, i.e. having ordinary solutions, weak solutions or notsolutions respectively. In this paper, the third type is divided in two classes: strict-strongly and quasi-strongly inconsistent and is given a topology over a quotient space of the set of systems over finite- dimensional spaces, that yields a set of...
A transportation system viewed as a queueing system
A truncated descent HS conjugate gradient method and its global convergence.
A trust region method for zero-one nonlinear programming
A Trust Region Method Using Subgradient for Minimizing a Nondifferentiable Function
A trust-region-based BFGS method with line search technique for symmetric nonlinear equations.
A tutorial on nonlinear time-series data mining in engineering asset health and reliability prediction: concepts, models, and algorithms.