999 resultados para mine optimization


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Analytic expression of pellet acceleration by constant base pressure with consideration of gas-wall friction, heat transfer and viscous dissipation that important for high speed injection is obtained. The process of compression stage is formulated by a set of governing equations and can be numerically integrated. Excellent confirmation with experiments is obtained and the ways to optimum match the compression stage with the launch stage are suggested.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A method for optimizing tried wave functions in quantum Monte Carlo method has been found and used to calculate the energies of molecules, such as H-2, Li-2, H-3+, H-3 and H-4. Good results were obtained.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The aim of this technical report is to present some detailed explanations in order to help to understand and use the Message Passing Interface (MPI) parallel programming for solving several mixed integer optimization problems. We have developed a C++ experimental code that uses the IBM ILOG CPLEX optimizer within the COmputational INfrastructure for Operations Research (COIN-OR) and MPI parallel computing for solving the optimization models under UNIX-like systems. The computational experience illustrates how can we solve 44 optimization problems which are asymmetric with respect to the number of integer and continuous variables and the number of constraints. We also report a comparative with the speedup and efficiency of several strategies implemented for some available number of threads.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we introduce four scenario Cluster based Lagrangian Decomposition (CLD) procedures for obtaining strong lower bounds to the (optimal) solution value of two-stage stochastic mixed 0-1 problems. At each iteration of the Lagrangian based procedures, the traditional aim consists of obtaining the solution value of the corresponding Lagrangian dual via solving scenario submodels once the nonanticipativity constraints have been dualized. Instead of considering a splitting variable representation over the set of scenarios, we propose to decompose the model into a set of scenario clusters. We compare the computational performance of the four Lagrange multiplier updating procedures, namely the Subgradient Method, the Volume Algorithm, the Progressive Hedging Algorithm and the Dynamic Constrained Cutting Plane scheme for different numbers of scenario clusters and different dimensions of the original problem. Our computational experience shows that the CLD bound and its computational effort depend on the number of scenario clusters to consider. In any case, our results show that the CLD procedures outperform the traditional LD scheme for single scenarios both in the quality of the bounds and computational effort. All the procedures have been implemented in a C++ experimental code. A broad computational experience is reported on a test of randomly generated instances by using the MIP solvers COIN-OR and CPLEX for the auxiliary mixed 0-1 cluster submodels, this last solver within the open source engine COIN-OR. We also give computational evidence of the model tightening effect that the preprocessing techniques, cut generation and appending and parallel computing tools have in stochastic integer optimization. Finally, we have observed that the plain use of both solvers does not provide the optimal solution of the instances included in the testbed with which we have experimented but for two toy instances in affordable elapsed time. On the other hand the proposed procedures provide strong lower bounds (or the same solution value) in a considerably shorter elapsed time for the quasi-optimal solution obtained by other means for the original stochastic problem.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, the influence on corrugation of the most significant track parameters has been examined. After this parametric study, the optimization of the track parameters to minimize the undulatory wear growth has been achieved. Finally, the influence of the dispersion of the track and contact parameters on corrugation growth has been studied. A method has been developed to obtain an optimal solution of the track parameters which minimizes corrugation growth, thus ensuring that this solution remains optimum despite dispersion of track parameters and wheel-rail contact uncertainties. This work is based on the computer application RACING (RAil Corrugation INitiation and Growth) which has been developed by the authors to predict rail corrugation features.