In this paper, we are concerned with identifying more efficient algorithms for solving dynamic traffic assignment with departure time choice problem using a discrete time simulation-based model. We compare and evaluat...
详细信息
ISBN:
(纸本)9789889884710
In this paper, we are concerned with identifying more efficient algorithms for solving dynamic traffic assignment with departure time choice problem using a discrete time simulation-based model. We compare and evaluate the performance of two heuristic algorithms: method of successive averages (MSA) and "route-swapping" algorithm. The two algorithms are tested in an example grid network, and convergence and stability of the proposed algorithms are discussed.
The paper describes how quasi-static, conservative instability problems can be seen in a multi-dimensional context, and how one- and two-dimensional solution manifolds can reveal further information on the structural ...
详细信息
The paper describes how quasi-static, conservative instability problems can be seen in a multi-dimensional context, and how one- and two-dimensional solution manifolds can reveal further information on the structural response. The discussed viewpoint can be seen as the natural extension of the common one-dimensional path-following methods, when additional variables are introduced to describe the parameter dependence in structural response, instability analyses and optimization. The paper describes the general setting of the generalized equilibrium problems, and discusses their numerical treatment for the cases of resulting one- and two-dimensional solution sets. Numerical examples show some applications of these models, and describe the possibilities and properties of the obtained solution sets.
Arthroscopic anterior cruciate ligament (ACL) reconstruction is a highly standardized procedure. To minimize the risk of technical failures and intraoperative complications, special instruments, such as dedicated dril...
详细信息
Arthroscopic anterior cruciate ligament (ACL) reconstruction is a highly standardized procedure. To minimize the risk of technical failures and intraoperative complications, special instruments, such as dedicated drill guides, have been developed. However, each surgical step still implies specific complications. Thus, it is of great importance to know the technique used and its instruments as well as solution algorithms in detail. This article explains intraoperative complications in ACL reconstruction. Furthermore, specific techniques to solve, and particularly to prevent these complications are discussed.
This. paper discusses parametric reform options to control losses generated by a publicly managed pay-as-you-go (PAYG) pension system under alternative deficit reduction (reform) strategies involving changes in contri...
详细信息
This. paper discusses parametric reform options to control losses generated by a publicly managed pay-as-you-go (PAYG) pension system under alternative deficit reduction (reform) strategies involving changes in contribution and replacement rates and statutory retirement ages. Two different problems corresponding to different pension reform strategies are considered using computational techniques. The techniques are illustrated through exercises employing data for the financially troubled pension system in Turkey. (C) 2001 Elsevier Science B.V. All rights reserved.
A new general solution of an ordinary differential system with impulse effects is introduced and its properties are established. Methods of solving boundary value problems with impulse effects are based on the constru...
详细信息
A new general solution of an ordinary differential system with impulse effects is introduced and its properties are established. Methods of solving boundary value problems with impulse effects are based on the construction and solution of a system of algebraic equations with respect to any vectors of the general solution.
Comparative studies of Gauss‐Seidel and Newton‐type algorithms for solving large sparse systems of equations are reported by Népomiastchy and Ravelli (1978), Gabay et al. (1980) and Norman et al. (1983). The fi...
详细信息
Comparative studies of Gauss‐Seidel and Newton‐type algorithms for solving large sparse systems of equations are reported by Népomiastchy and Ravelli (1978), Gabay et al. (1980) and Norman et al. (1983). The first two favour Newton's method, the third favours Gauss‐Seidel. Apart from working on different test models, their setups differ in the implementation of both schemes. This paper studies the performance of both methods on ten different econometric models of varying size and complexity. First the choice of implementation (equation reordering, updating rules for Newton's Jacobian) is studied on a relatively small model. Qualitative and quantitative feedback criteria are considered, and an efficient reordering algorithm is discussed. On the ten models considered, the selected Newton method is almost uniformly cheaper, generally reducing the number of iterations by more than 30 percent A final section draws attention to the possible extra gains of Newton's method in evaluating multipliers for policy analysis.
Computing sequence similarity is a problem emerging in several areas of research. Current solution algorithms are often based on alignment methods under the assumption that matching symbols, or at least a substitution...
详细信息
In this paper we address the possibility that in a competitive facility location model, one of the existing competing facilities will go out of business. We find the best location for a new facility protecting against...
详细信息
In this paper we address the possibility that in a competitive facility location model, one of the existing competing facilities will go out of business. We find the best location for a new facility protecting against such a possibility. Four commonly used decision rules (optimistic, pessimistic, minimax regret, and expected value) are analyzed and optimally solved within a given relative accuracy. The results of extensive computational experiments are reported. Special upper bounds, that may be a basis for other optimization problems, are designed. They are much tighter than existing lower bounds. The number if iterations is reduced by a factor close to 5000, and consequently run times were improved by about the same factor. The largest instance of 10 existing competing facilities and 20,000 demand points was solved in less than one second by each of the four decision criteria. The idea of possible scenarios can be investigated by other models in future research.
暂无评论