Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

171 articles for “I-convergence”
Set a search alert
Research ArticleOpen accessIn the abstractBenders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment ProblemsSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD) generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP) to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC) for the … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,684 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Application of Combined Model for Tehran Metropolitan Area Incorporating Captive Travel BehaviorShahriar A. Zargari, Morteza Araghi, Kouros MohammadianTo overcome deficiencies of the sequential transportation planning approach, this research applies a Combined Trip Distribution and Assignment Model (CTDAM) for the simultaneous prediction. The proposed combined model can itself be reformulated as an Equivalent Minimization Problem (EMP). When applying the Evans algorithm to the EMP, the CTDAM is expected to be usable in a realistic application. The objective of … …American Journal of Applied Sciences, Vol. 6, Issue 1 · 31 Jan 2009 · 7,857 accessesView PDFCite
Research ArticleOpen accessIn the abstractNumerical Solution of Fourth Order Linear Ordinary Differential Equations by Cubic Spline Collocation Tau MethodO.A. Taiwo, O.M. OgunlaranProblem Statement: Many boundary value problems that arise in real life situations defy analytical solution; hence numerical techniques are desirable to find the solution of such equations. New numerical methods which are comparatively better than the existing ones in terms of efficiency, accuracy, stability, convergence and computational cost are always needed. Approach: In this study, we developed and applied three … …Journal of Mathematics and Statistics, Vol. 4, Issue 4 · 31 Dec 2008 · 6,987 accessesView PDFCite
Research ArticleOpen accessIn the abstractCollocation Discrete Least Squares (CDLS) Method for Elasticity Problems and Grid Irregularity Effect AssessmentM. Naisipour, M. H. Afshar, B. Hassani, A. R. FiroozjaeeA meshless approach, collocation discrete least square (CDLS) method, is extended in this paper, for solving elasticity problems and grid irregularity effect is assessed. In the present CDLS method, the problem domain is discretized by distributed field nodes. The field nodes are used to construct the trial functions. The moving least-squares interpolant is employed to construct the trial functions. Some … …American Journal of Applied Sciences, Vol. 5, Issue 11 · 30 Nov 2008 · 7,093 accessesView PDFCite
Research ArticleOpen accessIn the abstractVulnerability Assessment of Power System Using Radial Basis Function Neural Network and a New Feature Extraction MethodAhmed M.A. Haidar, Azah Mohamed, Aini HussainVulnerability assessment in power systems is important so as to determine how vulnerable a power system in case of any unforeseen catastrophic events. This paper presents the application of Radial Basis Function Neural Network (RBFNN) for vulnerability assessment of power system incorporating a new proposed feature extraction method named as the Neural Network Weight Extraction (NNWE) for dimensionality reduction of … …American Journal of Applied Sciences, Vol. 5, Issue 6 · 30 Jun 2008 · 7,155 accessesView PDFCite
Research ArticleOpen accessIn the abstractMINLP Optimization of Mechanical StructuresS. Šilih, T. Žula, Z. Kravanja, S. KravanjaWe presented optimization of mechanical structures, performed by the Mixed-Integer Nonlinear Programming (MINLP) optimization approach. The MINLP is a combined continuous/discrete optimization technique, where a structural topology and standard/discrete sizes are optimized simultaneously with the continuous variables. Ddiscrete binary 0-1 variables were used to express the discrete decisions. For solution of this non-linear, continuous/discrete and non-convex MINLP class of the … …American Journal of Applied Sciences, Vol. 5, Issue 1 · 31 Jan 2008 · 7,129 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn the Discretized Algorithm for Optimal Problems Constrained by Differential Equation with Real CoefficientsO. OlotuA discretized scheme, Discretized Continuous Algorithm (DCA), for solving constrained quadratic optimal control problems was developed to ease the computational cumbersomeness inherent in some existing algorithms, particularly, the Function Space A lgorithm (FSA) by replacing the integral by a series of summation. In order to accomplish this numerical scheme, we resort to a finite approximation of it by discretizing its … …Journal of Mathematics and Statistics, Vol. 3, Issue 4 · 31 Dec 2007 · 6,854 accessesView PDFCite
Research ArticleOpen accessIn the abstractData-Driven Forecasting Schemes: Evaluation and ApplicationsJosip Vrbanek Jr, Wilson WangA reliable multi-step predictor is very useful to a wide array of applications to forecast the behavior of dynamic systems. The objective of this paper is to develop a more robust data-driven predictor for time series forecasting. Based on simulation analysis, it is found that multi-step-ahead forecasting schemes based on step inputs perform better than those based on sequential inputs. … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,568 accessesView PDFCite
Research ArticleOpen accessIn the abstractNumerical Solutions of the Multispecies Predator-Prey Model by Variational Iteration MethodKhaled BatihaThe main objective of the current work was to solve the multispecies predator-prey model. The techniques used here were called the variational iteration method (VIM) and the Adomian decomposition method (ADM). The advantage of this work is twofold. Firstly, the VIM reduces the computational work. Secondly, in comparison with existing techniques, the VIM is an improvement with regard to its … …Journal of Computer Science, Vol. 3, Issue 7 · 31 Jul 2007 · 6,799 accessesView PDFCite
Research ArticleOpen accessIn the abstractApproximate Analytical Solutions For Time-Dependent Emden-Fowler-Type Equations By Variational Iteration MethodKhaled BatihaThe main objective of the current study was to solve the time-dependent Emden-Fowler-type equation with singular behavior. The technique used here was called the variational iteration method (VIM). The advantage of this work is twofold. Firstly, the VIM reduces the computational work. Secondly, in comparison with existing techniques, the VIM is an improvement with regard to its accuracy and rapid … …American Journal of Applied Sciences, Vol. 4, Issue 7 · 31 Jul 2007 · 6,594 accessesView PDFCite