Route Search Method for Railway Replacement Buses Adopting Ant Colony Optimization

In recent years, Japan, and especially rural areas have faced the growing problems of debt-ridden local railway lines along with the population decline and aging population. Therefore, it is best to consider the discontinuation of local railway lines and introduce replacement buses to secure the transportation methods of the local people especially in rural areas. Based on the above background, targeting local railway lines that may be discontinued in the near future, appropriate bus stops when provided with potential bus stops were selected, the present study proposed a method that introduces routes for railway replacement buses adopting ant colony optimization (ACO). The improved ACO was designed and developed based on the requirements set concerning the route length, number of turns, road width, accessibility of railway lines and zones without bus stops as well as the constraint conditions concerning the route length, number of turns and zones without bus stops. Original road network data were generated and processed adopting a geographic information systems (GIS), and these are used to search for the optimal route for railway replacement buses adopting the improved ACO concerning the 8 zones on the target railway line (JR Kakogawa line). By comparing the improved ACO with Dijkstra’s algorithm, its relevance was verified and areas needing further improvements were revealed.

Electrical Impedance Tomography Based on Direct Search Method

Solution to impedance distribution in electrical impedance tomography （EIT） is an ill-posed nonlinear inverse problem. It is especially difficult to reconstruct an EIT image in the center area of a measured object. Tikhonov regularization with some prior information is a sound regnlarization method for static electrical impedance tomography under the condition that some true impedance distribution information is known a priori. This paper presents a direct search method （DSM） as pretreatment of image reconstruction through which one not only can construct a regularization matrix which may locate in areas of impedance change, but also can obtain an initial impedance distribution more similar to the true impedance distribution, as well as better current modes which can better distinguish the initial distribution and the true distribution. Simulation results indicate that, by using DSM, resolution in the center area of the measured object can be improved significantly.

Algorithms for Multicriteria Scheduling Problems to Minimize Maximum Late Work, Tardy, and Early

This study examines the multicriteria scheduling problem on a single machine to minimize three criteria: the maximum cost function, denoted by maximum late work (Vmax), maximum tardy job, denoted by (Tmax), and maximum earliness (Emax). We propose several algorithms based on types of objectives function to be optimized when dealing with simultaneous minimization problems with and without weight and hierarchical minimization problems. The proposed Algorithm (3) is to find the set of efficient solutions for 1//F (Vmax, Tmax, Emax) and 1//(Vmax + Tmax + Emax). The Local Search Heuristic Methods (Descent Method (DM), Simulated Annealing (SA), Genetic Algorithm (GA), and the Tree Type Heuristics Method (TTHM) are applied to solve all suggested problems. Finally, the experimental results of Algorithm (3) are compared with the results of the Branch and Bound (BAB) method for optimal and Pareto optimal solutions for smaller instance sizes and compared to the Local Search Heuristic Methods for large instance sizes. These results ensure the efficiency of Algorithm (3) in a reasonable time.

Dual threshold search method for asperity boundary determination based on geodetic and seismic catalog data

As an important model for explaining the seismic rupture mode,the asperity model plays an important role in studying the stress accumulation of faults and the location of earthquake initiation.Taking Qilian-Haiyuan fault as an example,this paper combines geodetic method and b-value method to propose a multi-source observation data fusion detection method that accurately determines the asperity boundary named dual threshold search method.The method is based on the criterion that the b-value asperity boundary should be most consistent with the slip deficit rate asperity boundary.Then the optimal threshold combination of slip deficit rate and b-value is obtained through threshold search,which can be used to determine the boundary of the asperity.Based on this method,the study finds that there are four potential asperities on the Qilian-Haiyuan fault:two asperities(A1 and A2)are on the Tuolaishan segment and the other two asperities(B and C)are on Lenglongling segment and Jinqianghe segment,respectively.Among them,the lengths of asperities A1 and A2 on Tuolaishan segment are 17.0 km and 64.8 km,respectively.And the lower boundaries are 5.5 km and 15.5 km,respectively;The length of asperity B on Lenglongling segment is 70.7 km,and the lower boundary is 10.2 km.The length of asperity C on Jinqianghe segment is 42.3 km,and the lower boundary is 8.3 km.

Study on boundary search method for DFM mesh generation

The boundary mesh of the casting model was determined by direct calculation on the triangular facets extracted from the STL file of the 3D model. Then the inner and outer grids of the model were identified by the algorithm in which we named Inner Seed Grid Method. Finally, a program to automatically generate a 3D FDM mesh was compiled. In the paper, a method named Triangle Contraction Search Method (TCSM) was put forward to ensure not losing the boundary grids; while an algorithm to search inner seed grids to identify inner/outer grids of the casting model was also brought forward. Our algorithm was simple, clear and easy to construct program. Three examples for the casting mesh generation testified the validity of the program.

Estimation of mass transfer coefficient in ozone absorption by linear least square fitting and Simplex search methods

For physical ozone absorption without reaction,two parametric estimation methods,i.e.the common linear least square fitting and non-linear Simplex search methods,were applied,respectively,to determine the ozone mass transfer coefficient during absorption and both methods give almost the same mass transfer coefficient.While for chemical absorption with ozone decomposition reaction,the common linear least square fitting method is not applicable for the evaluation of ozone mass transfer coefficient due to the difficulty of model linearization for describing ozone concentration dissolved in water.The nonlinear Simplex method obtains the mass transfer coefficient by minimizing the sum of the differences between the simulated and experimental ozone concentration during the whole absorption process,without the limitation of linear relationship between the dissolved ozone concentration and absorption time during the initial stage of absorption.Comparison of the ozone concentration profiles between the simulation and experimental data demonstrates that Simplex method may determine ozone mass transfer coefficient during absorption in an accurate and high efficiency way with wide applicability.

A New Genetic Algorithm Based on Niche Technique and Local Search Method

The genetic algorithm has been widely used in many fields as an easy robust global search and optimization method. In this paper, a new generic algorithm based on niche technique and local search method is presented under the consideration of inadequacies of the simple genetic algorithm. In order to prove the adaptability and validity of the improved genetic algorithm, optimization problems of multimodal functions with equal peaks, unequal peaks and complicated peak distribution are discussed. The simulation results show that compared to other niching methods, this improved genetic algorithm has obvious potential on many respects, such as convergence speed, solution accuracy, ability of global optimization, etc.

PID Parameters for Tuning and Optimization of a Turbine EngineBased on the Simplex Search Method

A PID parameters tuning and optimization method for a turbine engine based on the simplex search method was proposed. Taking time delay of combustion and actuator into account, a simulation model of a PID control system for a turbine engine was developed. A performance index based on the integral of absolute error （IAE） was given as an objective function of optimization. In order to avoid the sensitivity that resulted from the initial values of the simplex search method, the traditional Ziegler-Nichols method was used to tune PID parameters to obtain the initial values at first, then the simplex search method was applied to optimize PID parameters for the turbine engine. Simulation results indicate that the simplex search method is a reasonable and effective method for PID controller parameters tuning and optimization.

Global Convergence of Curve Search Methods for Unconstrained Optimization

In this paper we propose a new family of curve search methods for unconstrained optimization problems, which are based on searching a new iterate along a curve through the current iterate at each iteration, while line search methods are based on finding a new iterate on a line starting from the current iterate at each iteration. The global convergence and linear convergence rate of these curve search methods are investigated under some mild conditions. Numerical results show that some curve search methods are stable and effective in solving some large scale minimization problems.

A CLASSOF NONMONOTONE CONJUGATE GRADIENT METHODSFOR NONCONVEX FUNCTIONS

This paper discusses the global convergence of a class of nonmonotone conjugate gra- dient methods(NM methods) for nonconvex object functions.This class of methods includes the nonmonotone counterpart of modified Polak- Ribière method and modified Hestenes- Stiefel method as special cases

Optimizing Control for Rotor Vibration with Magnetorheological Fluid Damper

The aim of this work is to analyze and design a control system for vibration reduction in a rotor system using a shear mode magnetorheological fluid(MRF)damper.A dynamic model of the MRF damper-rotor system was built and simulated in Matlab/Simulink to analyze the rotor vibration characteristics and the vibration reduction effect of the MRF damper.Based on the numerical simulation analysis,an optimizing control strategy using pattern search method was proposed and designed.The control system was constructed on a test rotor bench and experiment validations on the effectiveness of the proposed control strategy were conducted.Experimental results show that rotor vibration caused by unbalance can be well controlled whether in resonance region(70%)or in non-resonance region(30%).An irregular vibration amplitude jump can be suppressed with the optimization strategy.Furthermore,it is found that the rapidity of transient response and efficiency of optimizing technique depend on the pattern search step.The presented strategies and control system can be extended to multi-span(more than two or three spans)rotor system.It provides a powerful technical support for the extension and application in target and control for shafting vibration.

Powell dynamic identification of displacement parameters of indeterminate thin-walled curve box based on FCSE theory

The FCSE controlling equation of pinned thinwalled curve box was derived and the indeterminate problem of continuous thin-walled curve box with diaphragm was solved based on flexibility theory. With Bayesian statistical theory,dynamic Bayesian error function of displacement parameters of indeterminate curve box was founded. The corresponding formulas of dynamic Bayesian expectation and variance were deduced. Combined with one-dimensional Fibonacci automatic search scheme of optimal step size,the Powell optimization theory was utilized to research the stochastic identification of displacement parameters of indeterminate thin-walled curve box. Then the identification steps were presented in detail and the corresponding calculation procedure was compiled. Through some classic examples,it is obtained that stochastic performances of systematic parameters and systematic responses are simultaneously deliberated in dynamic Bayesian error function. The one-dimensional optimization problem of the optimal step size is solved by adopting Fibonacci search method. And the Powell identification of displacement parameters of indeterminate thin-walled curve box has satisfied numerical stability and convergence,which demonstrates that the presented method and the compiled procedure are correct and reliable.During parameters鈥？iterative processes,the Powell theory is irrelevant with the calculation of finite curve strip element（FCSE） partial differentiation,which proves high computation effciency of the studied method.

Conformations and Metal Ion Affinities of Glutamine Binding with Alkali and Alkaline Earth Metal Cations： an ab initio Study

Conformations and reaction energetics are important for understanding the interactions be- tween biomolecules and metal ions. In this work, we report a systematic ab initio study on the conformations and metal ion affinities of glutamine （Gln） binding with alkali and alkaline earth metal ions. An efficient and reliable method of searching low energy conformations of metalated Gln is proposed and applied to the complexes of Gln.Gln.M^＋/＋＋（M＋/＋＋=Li^＋、Na^＋、K^＋、Rb^＋、Cs^＋、Be^＋＋、Mg^＋＋、Ca^＋＋、Sr^＋＋ and Ba^＋＋）.. In addition to all conformers known in literatures, many new important conformations are located, demonstrating the power of the new method and the necessity of the conformational search performed here. The metal coordination modes, relative energies, dipole moments, and equilibrium distributions of all important conformations of Gln.M^＋/＋＋ are calculated by the methods of B3LYP, BHandHLYP, and MP2. IR spectra and metalation enthalpies and free energies are also presented and compared with the available experiments. The results form an extensive database for systematic examination of the metalation properties of Gln.

A DERIVATIVE-FREE ALGORITHM FOR UNCONSTRAINED OPTIMIZATION

In this paper a hybrid algorithm which combines the pattern search method and the genetic algorithm for unconstrained optimization is presented. The algorithm is a deterministic pattern search algorithm,but in the search step of pattern search algorithm,the trial points are produced by a way like the genetic algorithm. At each iterate, by reduplication,crossover and mutation, a finite set of points can be used. In theory,the algorithm is globally convergent. The most stir is the numerical results showing that it can find the global minimizer for some problems ,which other pattern search algorithms don＇t bear.

Electromagnetism-Like Mechanism Algorithm with New Charge Formula for Optimization

The electromagnetism-like(EM)algorithm is a meta-heuristic optimization algorithm,which uses a novel searching mechanism called attraction-repulsion between charged particles.It is worth pointing out that there are two potential problems in the calculation of particle charge by the original EM algorithm.One of the problems is that the information utilization rate of the population is not high,and the other problem is the decline of population diversity when the population size is much greater than the dimension of the problem.In contrast,it is more fully to exploit the useful search information based on the proposed new quadratic formula for charge calculation in this paper.Furthermore,the population size was introduced as a new multiplier term to improve the population diversity.In the end,numerical experiments were used to verify the performance of the proposed method,including a comparison with the original EM algorithm and other well-known methods such as artificial bee colony(ABC),and particle swarm optimization(PSO).The results showed the effectiveness of the proposed algorithm.

An Advanced Stochastic Numerical Approach for Host-Vector-Predator Nonlinear Model

A novel design of the computational intelligent framework is presented to solve a class of host-vector-predator nonlinear model governed with set of ordinary differential equations.The host-vector-predator nonlinear model depends upon five groups or classes,host plant susceptible and infected populations,vectors population of susceptible and infected individuals and the predator population.An unsupervised artificial neural network is designed using the computational framework of local and global search competencies of interior-point algorithm and genetic algorithms.For solving the hostvector-predator nonlinear model,a merit function is constructed using the differential model and its associated boundary conditions.The optimization of this merit function is performed using the computational strength of designed integrated heuristics based on interior point method and genetic algorithms.For the comparison,the obtained numerical solutions of networks models optimized with efficacy of global search of genetic algorithm and local search with interior point method have been compared with the Adams numerical solver based results or outcomes.Moreover,the statistical analysis will be performed to check the reliability,robustness,viability,correctness and competency of the designed integrated heuristics of unsupervised networks trained with genetic algorithm aid with interior point algorithm for solving the biological based host-vector-predator nonlinear model for sundry scenarios of paramount interest.

Relay Selection Strategy in the Secure Cooperative Communications System

With the low cost and low hardware complex considerations,cooperative systems are a tendency in the future communications.This work considers the secure cooperative communications systems.For a practical situation in the system,the scenario includes multiple source stations,multiple relay stations,multiple destination stations,and eavesdroppers.To analyze the optimal relay selection in the system,we begin with the performance analysis for a single source station and a single destination station.By applying two cooperative models,the amplify-andforward（AF） mode and decode-and-forward（DF）mode,the secrecy capacity is derived.Then,we apply the derived results to the considered environment to find the optimal relay assignment.By the way,the relay selection can be obtained by the exhaustive search algorithm.However,there are a lot of steps needed if the number of source stations is large.Hence,applying the characters of the cooperative modes in the relay selection,the pre-selection step is proposed with a mathematical derivation.It could be used for the practical situation without a long-time calculation.

Mobility and constant-orientation workspace analysis of 4UPS-UPU parallel mechanism

One of the key issues for parallel mechanism is the kinematic characteristics,especially the workspace which varies with configuration parameters.A kind of 4UPS-UPU parallel mechanism is designed and its workspace is studied in this paper.First,the mobility of the 4UPS-UPU parallel mechanism is analyzed based on the reciprocal screw theory,and the motion and constraint screw systems of the parallel mechanism are obtained.Then the inverse kinematics is derived by the closed-form kinematics chain.The boundary search method in the polar coordinate system is presented to analyze the constant-orientation workspace of the parallel mechanism.Finally,the influence factors relevant to the workspace,such as the structural parameters and kinematics parameters are analyzed in detail.The relationship between the workspace volume and different parameters are obtained.The conclusions can be used for parameters optimization and path planning of the parallel mechanism.

Capacitated Dynamic Facility Location Problem Based on Tabu Search Algorithm

Facility location problem is a kind of NP-Hard combinational problem.Considering ever-changing demand sites,demand quantity and releasing cost,we formulate a model combining tabu search and FCM(fuzzy clustering method) to solve the capacitated dynamic facility location problem.Some results are achieved and they show that the proposed method is effective.

Structural Optimization of Concrete Slab Frame Bridges Considering Investment Cost

The present study investigates computer-antomated design and structural optimization of concrete slab frame bridges considering investment cost based on a complete 3D model. Thus, a computer code with several modules has been developed to produce parametric models of slab frame bridges. Design loads and load combinations are based on the Eurocode design standard and the Swedish design standard for bridges. The necessary reinforcement diagrams to satisfy the ultimate and serviceability limit states, including fatigue checks for the whole bridge, are calculated according to the aforementioned standards. Optimization techniques based on the genetic algorithm and the pattern search method are applied. A case study is presented to highlight the efficiency of the applied optimization algorithms. This methodology has been applied in the design process for the time-effective, material-efficient, and optimal design of concrete slab frame bridges.