Vehicle dispatching plays an important part in improving event reaction ability, saving rescue time and reducing property losses in urban traffic emergency systems. Combined with characteristics of emergency rescue, a...
详细信息
ISBN:
(纸本)9781424417339
Vehicle dispatching plays an important part in improving event reaction ability, saving rescue time and reducing property losses in urban traffic emergency systems. Combined with characteristics of emergency rescue, an optimal object based on the shortest emergency time is established and proved to satisfy the definition of the best dispatching plan. An algorithm based on convex combination method is also proposed. Finally, an example illustrates that the optimal objective is rational and the algorithm is effective.
A new model for variable speed limit in freeway work zone Was presented. Model predictive control was applied to optimizing variable speed limit in freeway work zone. The classic macroscopic traffic model METANET was ...
详细信息
ISBN:
(纸本)9787900719706
A new model for variable speed limit in freeway work zone Was presented. Model predictive control was applied to optimizing variable speed limit in freeway work zone. The classic macroscopic traffic model METANET was a little modified for simulating the traffic in the work zone, considering the effect of speed limit. One new optimization model for solving the optimal variable speed was proposed, which is a real-time nonlinear controlling model. In the optimization model, the objective function considers efficiency and safety by minimizing the total time spent (TTS) and the speed variation. To solve this optimization model, discretization for time horizon was conducted firstly;on every control time step, SQP algorithm was applied to solve the nonlinear programming in the next;the optimization results were integer conversion for the real speed limit displayed. One example was conducted to prove the efficiency of the proposed model. And some valuable conclusion was obtained.
This paper presents solutions for fully fuzzy optimization based on Immune Algorithm by using methods for integral calculus and ordering of fuzzy numbers,directing at nonlinear fuzzy optimization on the condition that...
详细信息
This paper presents solutions for fully fuzzy optimization based on Immune Algorithm by using methods for integral calculus and ordering of fuzzy numbers,directing at nonlinear fuzzy optimization on the condition that constrain conditions,coefficients and optimum variables are all fuzzy *** analyzing examples of fully fuzzy nonlinear optimization,we will verify the effectiveness of the proposed method.
Reactive power optimization is one of the key problems in power system which makes the voltage quality and stability improved and the loss of the power system reduced. This paper briefly analyzes the limitation of som...
详细信息
Evaluation of competitiveness is the strategic choice for the logistics *** this paper a new framework of combinational evaluation methodolgy based on statistics is *** first the Kendall coefficient of consistency is ...
详细信息
Evaluation of competitiveness is the strategic choice for the logistics *** this paper a new framework of combinational evaluation methodolgy based on statistics is *** first the Kendall coefficient of consistency is computed to identify whether the different single evaluation methods are compatible.A nonlinear program is constructed to determine the weight of different evaluation method *** effect of the combinational method is determined with the index of MAPE and *** competitiveness of logistics enterprise are evaluated with the combinational evaluation *** evaluation index system is constructed. Composite index, TOPSIS,Efficlency coefficlent method and Factor analysis are chosen to take *** on above 4 sigle evaluation methods,combinational evaluation is constructed with the nonlinear *** explorative results show that combinational evaluation method is a kind of good evaluation method.
We consider a class of problems in formation control. This class comprises of the so called radar deception, rigid formation keeping and formation reconfiguration problems. An intrinsic geometric formulation of the as...
详细信息
ISBN:
(纸本)9781424420780
We consider a class of problems in formation control. This class comprises of the so called radar deception, rigid formation keeping and formation reconfiguration problems. An intrinsic geometric formulation of the associated constraints unifies the three problems. It is the first time such a generalization has been presented. The constraints can include nonholonomic constraints and actuator limitations. Deriving the constrained dynamics describing the motion eliminates the need for nonlinear programming making the approach amenable to real time motion planning. The constrained dynamics along with the motion planning algorithm that generates reference trajectories online and in real-time, are validated for the formation keeping problem using simulations.
Semi-penalty function methods, which are proposed by Nie, are new approaches combining sequential quadratic programming (SQP) methods and sequential penalty quadratical programming (SlQP) approaches. But in some cases...
详细信息
Semi-penalty function methods, which are proposed by Nie, are new approaches combining sequential quadratic programming (SQP) methods and sequential penalty quadratical programming (SlQP) approaches. But in some cases, the subproblem may be inconsistent in Nie's method. Therefore, we aim to overcome the inconsistence in this paper. We regard some constraints, which is satisfied in some point, as constraints. Other constraints are acted as penalty term. The convergent results are obtained. Further, we extend our new semi-penalty method to augmented Lagrangian penalty approaches. (C) 2003 Elsevier Inc. All rights reserved.
The aim of this paper is to show that the theorem on the global convergence of the Newton interior-point (IP) method presented in Ref. 1 can be proved under weaker assumptions. Indeed, we assume the boundedness of the...
详细信息
The aim of this paper is to show that the theorem on the global convergence of the Newton interior-point (IP) method presented in Ref. 1 can be proved under weaker assumptions. Indeed, we assume the boundedness of the sequences of multipliers related to nontrivial constraints, instead of the hypothesis that the gradients of the inequality constraints corresponding to slack variables not bounded away from zero are linearly independent. By numerical examples, we show that, in the implementation of the Newton IP method, loss of boundedness in the iteration sequence of the multipliers detects when the algorithm does not converge from the chosen starting point.
In this paper, a new sequential quadratic programming (SQP) method of feasible directions is proposed and analyzed for nonlinear programming, where a feasible direction of descent can be derived from solving only one ...
详细信息
In this paper, a new sequential quadratic programming (SQP) method of feasible directions is proposed and analyzed for nonlinear programming, where a feasible direction of descent can be derived from solving only one QP subproblem. In particular, this method can produce automatically a revised direction with the explicit expression which can avoid Maratos effect without solving QP subproblem. The theoretical analysis shows that global and superlinear convergence can be induced. In the end, numerical experiment is given to illustrate the effectiveness of the method. (C) 2002 Elsevier Inc. All rights reserved.
In [4], Fletcher and Leyffer present a new method that solves nonlinear programming problems without a penalty function by SQP-Filter algorithm. It has attracted much attention due to its good numerical results. In th...
详细信息
In [4], Fletcher and Leyffer present a new method that solves nonlinear programming problems without a penalty function by SQP-Filter algorithm. It has attracted much attention due to its good numerical results. In this paper we propose a new SQP-Filter method which can overcome Maratos effect more effectively. We give stricter acceptant criteria when the iterative points are far from the optimal points and looser ones vice-versa. About this new method, the proof of global convergence is also presented under standard assumptions. Numerical results show that our method is efficient.
暂无评论