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.

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

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.

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.

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.

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.

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.

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.

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.

Numerical Fitting of Planar Photographic Images with Spherical Voronoi Diagrams

There are many phenomena that generate polygonal tessellations on surfaces of 3D objects. One interesting example is the jackfruit, a multiple fruit found in the tropics. A recent study found the best-fit spherical Voronoi diagram from a photo of jackfruit skin, but the optimization was relative to the radius of the sphere and the height of the spikes. In this study, we propose a method for adjusting the position of the center of the sphere in addition to these parameters. Experiments were conducted using both ideal and real data. However, convergence with real data has not been confirmed due to relaxation of the convergence condition.

A HYBRID METHOD FOR SOLVING VARIATIONAL INEQUALITY PROBLEMS

By using Fukushima's differentiable merit function,Taji,Fukushima and Ibaraki have given a globally convergent modified Newton method for the strongly monotone variational inequality problem and proved their method to be quadratically convergent under certain assumptions in 1993.In this paper a hybrid method for the variational inequality problem under the assumptions that the mapping F is continuously differentiable and its Jacobian matrix Δ F(x) is positive definite for all x∈S rather than strongly monotone and that the set S is nonempty,polyhedral,closed and convex is proposed.Armijo type line search and trust region strategies as well as Fukushima's differentiable merit function are incorporated into the method.It is then shown that the method is well defined and globally convergent and that,under the same assumptions as those of Taji et al.,the method reduces to the basic Newton method and hence the rate of convergence is quadratic.Computational experiences show the efficiency of the proposed method.

A Novel Variant of Moth Flame Optimizer for Higher Dimensional Optimization Problems

Moth Flame Optimization(MFO)is a nature-inspired optimization algorithm,based on the principle of navigation technique of moth toward moon.Due to less parameter and easy implementation,MFO is used in various field to solve optimization problems.Further,for the complex higher dimensional problems,MFO is unable to make a good trade-off between global and local search.To overcome these drawbacks of MFO,in this work,an enhanced MFO,namely WF-MFO,is introduced to solve higher dimensional optimization problems.For a more optimal balance between global and local search,the original MFO’s exploration ability is improved by an exploration operator,namely,Weibull flight distribution.In addition,the local optimal solutions have been avoided and the convergence speed has been increased using a Fibonacci search process-based technique that improves the quality of the solutions found.Twenty-nine benchmark functions of varying complexity with 1000 and 2000 dimensions have been utilized to verify the projected WF-MFO.Numerous popular algorithms and MFO versions have been compared to the achieved results.In addition,the robustness of the proposed WF-MFO method has been evaluated using the Friedman rank test,the Wilcoxon rank test,and convergence analysis.Compared to other methods,the proposed WF-MFO algorithm provides higher quality solutions and converges more quickly,as shown by the experiments.Furthermore,the proposed WF-MFO has been used to the solution of two engineering design issues,with striking success.The improved performance of the proposed WF-MFO algorithm for addressing larger dimensional optimization problems is guaranteed by analyses of numerical data,statistical tests,and convergence performance.

Optimal proportion of wind and PV capacity in provincial power systems based on bilevel optimization algorithm under low-carbon economy

In order to boost contributions of power systems to a low-carbon economy,the installed capacity of renewable power generation,such as wind and photovoltaic(PV)power generation should be well planned.A bilevel formulation is presented to optimize the proportion of wind and PV capacity in provincial power systems,in which,carbon emissions of generator units and features of renewable resources are taken into account.In the lowerlevel formulation,a time-sequence production simulation(TSPS)model that is suitable for actual power system has been adopted.In order to maximize benefits of energy conservation and emissions reduction resulting from renewable power generation,the commercial software called General Algebraic Modeling System(GAMS)is employed to optimize the annual operation of the power system.In the upper-level formulation,the optimal pattern search(OPS)algorithm is utilized to optimize the proportion of wind and PV capacity.The objective of the upper-level formulation is to maximize benefits of energy conservation and carbon emissions reductions optimized in the lowerlevel problem.Simulation results in practical provincial power systems validate the proposed model and corresponding solving algorithms.The optimization results can provide support to policy makers to make the polices related to renewable energy.

Subspace Search Method for Quadratic Programming With BoxConstraints

A subspace search method for solving quadratic programming with box constraints is presented in this paper. The original problem is divided into many independent subproblem at an initial point, and a search direction is obtained by solving each of the subproblem, as well as a new iterative point is determined such that the value of objective function is decreasing. The convergence of the algorithm is proved under certain assumptions, and the numerical results are also given.

AN ADAPTIVE NONMONOTONIC TRUST REGION METHOD WITH CURVILINEAR SEARCHES

In this paper, an algorithm for unconstrained optimization that employs both trust region techniques and curvilinear searches is proposed. At every iteration, we solve the trust region subproblem whose radius is generated adaptively only once. Nonmonotonic backtracking curvilinear searches are performed when the solution of the subproblem is unacceptable. The global convergence and fast local convergence rate of the proposed algorithms are established under some reasonable conditions. The results of numerical ＇experiments are reported to show the effectiveness of the proposed algorithms.