Determination of the Shortest Crank in Four Position Synthesis: A Numerical Apporach

1992 ◽  
Author(s):  
Shin-Min Song ◽  
Fu-Hung Lu ◽  
Ning-Xin Chen ◽  
Kenneth J. Waldron
Keyword(s):  
Numerical Stability ◽  
Search Algorithm ◽  
Solution Space ◽  
Numerical Approach ◽  
Parameter Perturbation ◽  
Spurious Solutions ◽  
Automatic Search ◽  
Position Synthesis ◽  
Parameter Perturbation Method

Abstract The shortest crank of a four position synthesis can be determined by solving a statically determinate five-bar structure and a set of seven nonlinear equations have been proposed for this purpose. In this paper a numerical method which can directly solve the shortest crank is presented. It is found that a direct implementation of the original seven equations has two problems: many spurious solutions and poor numerical stability. And the spurious solutions are of the following two types: solutions with incorrect signs of angles and solutions with incorrect geometry. In order to solve the problems, a set of ten equations is developed and parameter perturbation method is applied. Furthermore, a set of eight equations is developed for better numerical stability. Both the ten and eight equations can eliminate the spurious solutions with incorrect geometry. Yet the spurious solutions with incorrect signs of angles can only be rectified after convergence. An automatic search algorithm is included to automatically search the shortest crank in the solution space. Many examples are given to illustrate this numerical approach.

Determination of Optimal Public Transportation Routes Using Firefly and Tabu Search Algorithms

2020 ◽  
Vol 4 (5) ◽  
pp. 884-891
Author(s):  
Salwa Salsabila Mansur ◽  
Sri Widowati ◽  
Mahmud Imrona
Keyword(s):  
Tabu Search ◽  
Public Transportation ◽  
Traffic Congestion ◽  
Search Algorithm ◽  
Urban Transportation ◽  
The Public ◽  
Comparison Results ◽  
Congestion Problems ◽  
Transportation Routes

Traffic congestion problems generally caused by the increasing use of private vehicles and public transportations. In order to overcome the situation, the optimization of public transportation’s route is required particularly the urban transportation. In this research, the performance analysis of Firefly and Tabu Search algorithm is conducted to optimize eleven public transportation’s routes in Bandung. This optimization aims to increase the dispersion of public transportation’s route by expanding the scope of route that are crossed by public transportation so that it can reach the entire Bandung city and increase the driver’s income by providing the passengers easier access to public transportations in order to get to their destinations. The optimal route is represented by the route with most roads and highest number of incomes. In this research, the comparison results between the reference route and the public transportation’s optimized route increasing the dispersion of public transportation’s route to 60,58% and increasing the driver’s income to 20,03%.

scholarly journals Efficient Operative Cost Reduction in Distribution Grids Considering the Optimal Placement and Sizing of D-STATCOMs Using a Discrete-Continuous VSA

2021 ◽  
Vol 11 (5) ◽  
pp. 2175
Author(s):  
Oscar Danilo Montoya ◽  
Walter Gil-González ◽  
Jesus C. Hernández
Keyword(s):  
Objective Function ◽  
Reactive Power ◽  
Programming Model ◽  
Search Algorithm ◽  
Solution Space ◽  
Distribution Networks ◽  
Optimal Placement ◽  
Mixed Integer ◽  
Solution Vector ◽  
The Impact

The problem of reactive power compensation in electric distribution networks is addressed in this research paper from the point of view of the combinatorial optimization using a new discrete-continuous version of the vortex search algorithm (DCVSA). To explore and exploit the solution space, a discrete-continuous codification of the solution vector is proposed, where the discrete part determines the nodes where the distribution static compensator (D-STATCOM) will be installed, and the continuous part of the codification determines the optimal sizes of the D-STATCOMs. The main advantage of such codification is that the mixed-integer nonlinear programming model (MINLP) that represents the problem of optimal placement and sizing of the D-STATCOMs in distribution networks only requires a classical power flow method to evaluate the objective function, which implies that it can be implemented in any programming language. The objective function is the total costs of the grid power losses and the annualized investment costs in D-STATCOMs. In addition, to include the impact of the daily load variations, the active and reactive power demand curves are included in the optimization model. Numerical results in two radial test feeders with 33 and 69 buses demonstrate that the proposed DCVSA can solve the MINLP model with best results when compared with the MINLP solvers available in the GAMS software. All the simulations are implemented in MATLAB software using its programming environment.

scholarly journals Circumspect descent prevails in solving random constraint satisfaction problems

2008 ◽  
Vol 105 (40) ◽  
pp. 15253-15257 ◽  
Author(s):  
Mikko Alava ◽  
John Ardelius ◽  
Erik Aurell ◽  
Petteri Kaski ◽  
Supriya Krishnamurthy ◽  
...  
Keyword(s):  
Local Search ◽  
Linear Time ◽  
Search Algorithm ◽  
Solution Space ◽  
Search Algorithms ◽  
Constraint Satisfaction Problems ◽  
Problem Instance ◽  
Stochastic Local Search ◽  
Local Search Algorithms ◽  
Local Energy Minimum

We study the performance of stochastic local search algorithms for random instances of the K-satisfiability (K-SAT) problem. We present a stochastic local search algorithm, ChainSAT, which moves in the energy landscape of a problem instance by never going upwards in energy. ChainSAT is a focused algorithm in the sense that it focuses on variables occurring in unsatisfied clauses. We show by extensive numerical investigations that ChainSAT and other focused algorithms solve large K-SAT instances almost surely in linear time, up to high clause-to-variable ratios α; for example, for K = 4 we observe linear-time performance well beyond the recently postulated clustering and condensation transitions in the solution space. The performance of ChainSAT is a surprise given that by design the algorithm gets trapped into the first local energy minimum it encounters, yet no such minima are encountered. We also study the geometry of the solution space as accessed by stochastic local search algorithms.

VESTA 3for three-dimensional visualization of crystal, volumetric and morphology data

2011 ◽  
Vol 44 (6) ◽  
pp. 1272-1276 ◽  
Author(s):  
Koichi Momma ◽  
Fujio Izumi
Keyword(s):  
Search Algorithm ◽  
Voronoi Tessellation ◽  
Three Dimensional ◽  
Structure Parameters ◽  
Volumetric Data ◽  
Complex Molecules ◽  
Visualization System ◽  
Performance Improvements ◽  
Significant Performance

VESTAis a three-dimensional visualization system for crystallographic studies and electronic state calculations. It has been upgraded to the latest version,VESTA 3, implementing new features including drawing the external morphology of crystals; superimposing multiple structural models, volumetric data and crystal faces; calculation of electron and nuclear densities from structure parameters; calculation of Patterson functions from structure parameters or volumetric data; integration of electron and nuclear densities by Voronoi tessellation; visualization of isosurfaces with multiple levels; determination of the best plane for selected atoms; an extended bond-search algorithm to enable more sophisticated searches in complex molecules and cage-like structures; undo and redo in graphical user interface operations; and significant performance improvements in rendering isosurfaces and calculating slices.

THE PROBLEM OF IDENTIFICATION OF HYDRAULIC RESISTANCE COEFFICIENTS IN MAKISTRAL GAS PIPELINE

2021 ◽  
pp. 6-11
Author(s):  
G. Gasymov
Keyword(s):  
Hydraulic Resistance ◽  
Group Identification ◽  
Numerical Approach ◽  
Transportation Systems ◽  
Gas Pipeline ◽  
Closed Loops ◽  
Hydraulic Network ◽  
Resistance Coefficients ◽  
Operating Regimes

A numerical approach, based on obtaining design formulas for the determination of hydraulic resistance coefficients of sites in pipeline transportation systems in the presence of the results of observations over a gas pipeline operating regimes, is proposed. The representation of the hydraulic network in the form of a directed graph allows to essentially reduce the number of equations in the system down to the number of closed loops. In the software implementation of the method described, for the solution of practical problems, group identification of the hydraulic resistance coefficients is provided for every eventuality.

Sign in / Sign up

Export Citation Format

Share Document