Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it pos...Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it poses become an NP-hard problem.This problem has major practical significance because the effectiveness of the schedules obtained has strong economical impact for any mining project.Despite of the rapid theoretical and technical advances in this field,heuristics is still the only viable approach for large scale industrial applications.This work presents an approach combining genetic algorithms(GAs) and Lagrangian relaxation(LR) to optimally determine the CLTPSP of open pit mines.GAs are stochastic,parallel search algorithms based on the natural selection and the process of evolution.LR method is known for handling large-scale separable problems; however,the convergence to the optimal solution can be slow.The proposed Lagrangian relaxation and genetic algorithms(LR-GAs) combines genetic algorithms into Lagrangian relaxation method to update the Lagrangian multipliers.This approach leads to improve the performance of Lagrangian relaxation method in solving CLTPSP.Numerical results demonstrate that the LR method using GAs to improve its performance speeding up the convergence.Subsequently,highly near-optimal solution to the CLTPSP can be achieved by the LR-GAs.展开更多
This paper presents an approximate expression to transmission capacity of ad hoc networks by using stochastic geometry. For there is no general close-form expression to the transmission capacity of ad hoc networks, by...This paper presents an approximate expression to transmission capacity of ad hoc networks by using stochastic geometry. For there is no general close-form expression to the transmission capacity of ad hoc networks, by using Taylor series, we obtain the exact series expression to transmission capacity first, then we take partial summation to yield an n-th order approximate expression. Further- more, compared with the exact expression under a special case, the accuracy of the n-th order ap- proximation has been studied. The numerical results show that the accuracy of the approximation is mainly determined by the order n, and a high accuracy can be obtained when the node density or the outage constraint is close to zero .展开更多
An analytic expression for π and π* electronic structure of graphene is derived within the tight-binding approximation. Including up to fifth-nearest neighbors, the tight-binding description of electronic dispersio...An analytic expression for π and π* electronic structure of graphene is derived within the tight-binding approximation. Including up to fifth-nearest neighbors, the tight-binding description of electronic dispersion quite accurately reproduces the first-principle calculation result over the entire Brillouin zone. The maximal deviation of the fifth-nearest tight-binding result from the first-principle result is only 6 meV for π band, and 25 meV for π* band. This 25 meV deviation is only one-tenth of the maximal deviation of the third-nearest tight-binding result. It is more important that the fitted parameters exponentially approach to zero as the distance between interacting atoms increases.展开更多
An algorithm composed of an iterative modified approximate factorization(MAF(k)) method with Navier-Stokes characteristic boundary conditions(NSCBC) is proposed for solving subsonic viscous flows.A transformation on t...An algorithm composed of an iterative modified approximate factorization(MAF(k)) method with Navier-Stokes characteristic boundary conditions(NSCBC) is proposed for solving subsonic viscous flows.A transformation on the matrix equation in MAF(k) is made in order to impose the implicit boundary conditions properly.To be in consistent with the implicit solver for the interior domain,an implicit scheme for NSCBC is formulated.The performance of the developed algorithm is investigated using spatially evolving zero pressure gradient boundary layer over a flat plate and a wall jet mixing with a cross flow over a flat plate with a square hole as the test cases.The numerical results are compared to the existing experimental datasets and a number of general correlations,together with other available numerical solutions,which demonstrate that the developed algorithm possesses promising capacity for simulating the subsonic viscous flows with large CFL number.展开更多
The Hellmann potential, which is a superposition of an attractive Coulomb potential -air and a Yutmwa potential b e-δr /r , is often used to compute bound-state normalizations and energy levels of neutral atoms. By u...The Hellmann potential, which is a superposition of an attractive Coulomb potential -air and a Yutmwa potential b e-δr /r , is often used to compute bound-state normalizations and energy levels of neutral atoms. By using the generalized parametric Nikiforov-Uvarov (NU) method, we have obtained the approximate analytical solutions of the radial Schr6dinger equation (SE) for the Hellmann potential. The energy eigenvalues and corresponding eigenfunctions are calculated in closed forms. Some numerical results are presented, which show good agreement with a numerical amplitude phase method and also those previously obtained by other methods. As a particular case, we find the energy levels of the pure Coulomb potential.展开更多
A new method of the reproducing kernel Hilbert space is applied to a twodimensional parabolic inverse source problem with the final overdetermination. The exact and approximate solutions are both obtained in a reprodu...A new method of the reproducing kernel Hilbert space is applied to a twodimensional parabolic inverse source problem with the final overdetermination. The exact and approximate solutions are both obtained in a reproducing kernel space. The approximate solution and its partial derivatives are proved to converge to the exact solution and its partial derivatives, respectively. A technique is proposed to improve some existing methods. Numerical results show that the method is of high precision, and confirm the robustness of our method for reconstructing source parameter.展开更多
文摘Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it poses become an NP-hard problem.This problem has major practical significance because the effectiveness of the schedules obtained has strong economical impact for any mining project.Despite of the rapid theoretical and technical advances in this field,heuristics is still the only viable approach for large scale industrial applications.This work presents an approach combining genetic algorithms(GAs) and Lagrangian relaxation(LR) to optimally determine the CLTPSP of open pit mines.GAs are stochastic,parallel search algorithms based on the natural selection and the process of evolution.LR method is known for handling large-scale separable problems; however,the convergence to the optimal solution can be slow.The proposed Lagrangian relaxation and genetic algorithms(LR-GAs) combines genetic algorithms into Lagrangian relaxation method to update the Lagrangian multipliers.This approach leads to improve the performance of Lagrangian relaxation method in solving CLTPSP.Numerical results demonstrate that the LR method using GAs to improve its performance speeding up the convergence.Subsequently,highly near-optimal solution to the CLTPSP can be achieved by the LR-GAs.
文摘This paper presents an approximate expression to transmission capacity of ad hoc networks by using stochastic geometry. For there is no general close-form expression to the transmission capacity of ad hoc networks, by using Taylor series, we obtain the exact series expression to transmission capacity first, then we take partial summation to yield an n-th order approximate expression. Further- more, compared with the exact expression under a special case, the accuracy of the n-th order ap- proximation has been studied. The numerical results show that the accuracy of the approximation is mainly determined by the order n, and a high accuracy can be obtained when the node density or the outage constraint is close to zero .
基金Supported from the Scientific Research Foundation of Henan University of Science and Technology under Grant Nos.2008ZY036Student Research Training Program 2009178, and 2009183
文摘An analytic expression for π and π* electronic structure of graphene is derived within the tight-binding approximation. Including up to fifth-nearest neighbors, the tight-binding description of electronic dispersion quite accurately reproduces the first-principle calculation result over the entire Brillouin zone. The maximal deviation of the fifth-nearest tight-binding result from the first-principle result is only 6 meV for π band, and 25 meV for π* band. This 25 meV deviation is only one-tenth of the maximal deviation of the third-nearest tight-binding result. It is more important that the fitted parameters exponentially approach to zero as the distance between interacting atoms increases.
文摘An algorithm composed of an iterative modified approximate factorization(MAF(k)) method with Navier-Stokes characteristic boundary conditions(NSCBC) is proposed for solving subsonic viscous flows.A transformation on the matrix equation in MAF(k) is made in order to impose the implicit boundary conditions properly.To be in consistent with the implicit solver for the interior domain,an implicit scheme for NSCBC is formulated.The performance of the developed algorithm is investigated using spatially evolving zero pressure gradient boundary layer over a flat plate and a wall jet mixing with a cross flow over a flat plate with a square hole as the test cases.The numerical results are compared to the existing experimental datasets and a number of general correlations,together with other available numerical solutions,which demonstrate that the developed algorithm possesses promising capacity for simulating the subsonic viscous flows with large CFL number.
文摘The Hellmann potential, which is a superposition of an attractive Coulomb potential -air and a Yutmwa potential b e-δr /r , is often used to compute bound-state normalizations and energy levels of neutral atoms. By using the generalized parametric Nikiforov-Uvarov (NU) method, we have obtained the approximate analytical solutions of the radial Schr6dinger equation (SE) for the Hellmann potential. The energy eigenvalues and corresponding eigenfunctions are calculated in closed forms. Some numerical results are presented, which show good agreement with a numerical amplitude phase method and also those previously obtained by other methods. As a particular case, we find the energy levels of the pure Coulomb potential.
基金supported by the National Natural Science Foundation of China(No.91230119)
文摘A new method of the reproducing kernel Hilbert space is applied to a twodimensional parabolic inverse source problem with the final overdetermination. The exact and approximate solutions are both obtained in a reproducing kernel space. The approximate solution and its partial derivatives are proved to converge to the exact solution and its partial derivatives, respectively. A technique is proposed to improve some existing methods. Numerical results show that the method is of high precision, and confirm the robustness of our method for reconstructing source parameter.