Generation Scheme (generation + scheme)

Distribution by Scientific Domains


Selected Abstracts


Multimode Project Scheduling Based on Particle Swarm Optimization

COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, Issue 2 2006
Hong Zhang
This article introduces a methodology for solving the MRCPSP based on particle swarm optimization (PSO) that has not been utilized for this and other construction-related problems. The framework of the PSO-based methodology is developed. A particle representation formulation is proposed to represent the potential solution to the MRCPSP in terms of priority combination and mode combination for activities. Each particle-represented solution should be checked against the nonrenewable resource infeasibility and will be handled by adjusting the mode combination. The feasible particle-represented solution is transformed to a schedule through a serial generation scheme. Experimental analyses are presented to investigate the performance of the proposed methodology. [source]


Towards automatic structured multiblock mesh generation using improved transfinite interpolation

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 5 2008
C. B. AllenArticle first published online: 4 OCT 200
Abstract The quality of any numerical flowfield solution is inextricably linked to the quality of the mesh used. It is normally accepted that structured meshes are of higher quality than unstructured meshes, but are much more difficult to generate and, furthermore, for complex topologies a multiblock approach is required. This is the most resource-intensive approach to mesh generation, since block structures, mesh point distributions, etc., need to be defined before the generation process, and so is seldom used in an industrial design loop, particularly where a novice user may be involved. This paper considers and presents two significant advances in multiblock mesh generation: the development of a fast, robust, and improved quality interpolation-based generation scheme and a fully automatic multiblock optimization and generation method. A volume generation technique is presented based on a form of transfinite interpolation, but modified to include improved orthogonality and spacing control and, more significantly, an aspect ratio-based smoothing algorithm that removes grid crossover and results in smooth meshes even for discontinuous boundary distributions. A fully automatic multiblock generation scheme is also presented, which only requires surface patch(es) and a target number of mesh cells. Hence, all user input is removed from the process, and a novice user is able to obtain a high-quality mesh in a few minutes. It also means the code can be run in batch mode, or called as an external function, and so is ideal for incorporation into a design or optimization loop. To demonstrate the power and efficiency of the code, multiblock meshes of up to 256 million cells are presented for wings and rotors in hover and forward flight. Copyright © 2007 John Wiley & Sons, Ltd. [source]


A parallel advancing front grid generation scheme

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 6 2001
Rainald Löhner
Abstract A parallel advancing front scheme has been developed. The domain to be gridded is first subdivided spatially using a relatively coarse octree. Boxes are then identified and gridded in parallel. A scheme that resembles closely the advancing front technique on scalar machines is recovered by only considering the boxes of the active front that generate small elements. The procedure has been implemented on the SGI origin class of machines using the shared memory paradigm. Timings for a variety of cases show speedups similar to those obtained for flow codes. The procedure has been used to generate grids with tens of millions of elements. Copyright © 2001 John Wiley & Sons, Ltd. [source]


Self-regular boundary integral equation formulations for Laplace's equation in 2-D

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 1 2001
A. B. Jorge
Abstract The purpose of this work is to demonstrate the application of the self-regular formulation strategy using Green's identity (potential-BIE) and its gradient form (flux-BIE) for Laplace's equation. Self-regular formulations lead to highly effective BEM algorithms that utilize standard conforming boundary elements and low-order Gaussian integrations. Both formulations are discussed and implemented for two-dimensional potential problems, and numerical results are presented. Potential results show that the use of quartic interpolations is required for the flux-BIE to show comparable accuracy to the potential-BIE using quadratic interpolations. On the other hand, flux error results in the potential-BIE implementation can be dominated by the numerical integration of the logarithmic kernel of the remaining weakly singular integral. Accuracy of these flux results does not improve beyond a certain level when using standard quadrature together with a special transformation, but when an alternative logarithmic quadrature scheme is used these errors are shown to reduce abruptly, and the flux results converge monotonically to the exact answer. In the flux-BIE implementation, where all integrals are regularized, flux results accuracy improves systematically, even with some oscillations, when refining the mesh or increasing the order of the interpolating function. The flux-BIE approach presents a great numerical sensitivity to the mesh generation scheme and refinement. Accurate results for the potential and the flux were obtained for coarse-graded meshes in which the rate of change of the tangential derivative of the potential was better approximated. This numerical sensitivity and the need for graded meshes were not found in the elasticity problem for which self-regular formulations have also been developed using a similar approach. Logarithmic quadrature to evaluate the weakly singular integral is implemented in the self-regular potential-BIE, showing that the magnitude of the error is dependent only on the standard Gauss integration of the regularized integral, but not on this logarithmic quadrature of the weakly singular integral. The self-regular potential-BIE is compared with the standard (CPV) formulation, showing the equivalence between these formulations. The self-regular BIE formulations and computational algorithms are established as robust alternatives to singular BIE formulations for potential problems. Copyright © 2001 John Wiley & Sons, Ltd. [source]