Defining science and demarcating it from pseudoscience are longstanding core issues in the philosophy of science.Hilbert’s traditional axiomatic standards(consistency,completeness,independence)struggle with modern co...Defining science and demarcating it from pseudoscience are longstanding core issues in the philosophy of science.Hilbert’s traditional axiomatic standards(consistency,completeness,independence)struggle with modern complex systems,while existing demarcation criteria like replicability and Popper’s falsificationism have practical limitations.Analyzing incompatibilities in complex systems,this paper proposes a revised framework:modified Hilbert axiomatic standards(clearly defined concepts,logical consistency,unrefuted axioms)and dynamic demarcation criteria.Abandoning unattainable traditional requirements of completeness and independence,it emphasizes conceptual clarity,openness,and progressiveness,offering an operational,self-consistent basis for judging scientificity.展开更多
We incorporate a non-Markovian feedback mechanism into the simulated bifurcation method for dynamical solvers addressing combinatorial optimization problems.By reinjecting a portion of dissipated kinetic energy into e...We incorporate a non-Markovian feedback mechanism into the simulated bifurcation method for dynamical solvers addressing combinatorial optimization problems.By reinjecting a portion of dissipated kinetic energy into each spin in a history-dependent and trajectory-informed manner,the method effectively suppresses early freezing induced by inelastic boundaries and enhances the system's ability to explore complex energy landscapes.Numerical results on the maximum cut(MAX-CUT)instances of fully connected Sherrington–Kirkpatrick(SK)spin glass models,including the 2000-spin K_(2000)benchmark,demonstrate that the non-Markovian algorithm significantly improves both solution quality and convergence speed.Tests on randomly generated SK instances with 100 to 1000 spins further indicate favorable scalability and substantial gains in computational efficiency.Moreover,the proposed scheme is well suited for massively parallel hardware implementations,such as field-programmable gate arrays,providing a practical and scalable approach for solving large-scale combinatorial optimization problems.展开更多
We propose a simplified version of the classic two-dimensional Hindmarsh–Rose neuron(2DHR),resulting in a new 2DHR that exhibits novel chaotic phenomena.Its dynamic characteristics are analyzed through bifurcation di...We propose a simplified version of the classic two-dimensional Hindmarsh–Rose neuron(2DHR),resulting in a new 2DHR that exhibits novel chaotic phenomena.Its dynamic characteristics are analyzed through bifurcation diagrams,Lyapunov exponent spectra,equilibrium points,and phase diagrams.Based on this system,a corresponding circuit is designed and circuit simulations are carried out,yielding results consistent with the numerical simulations.To explore practical applications of chaotic systems,2DHR is employed to improve the solution of the flexible job-shop scheduling problem with dynamic events.The research results demonstrate that applying 2DHR can significantly enhance the convergence rate of the optimization algorithm and improve the quality of the scheduling solution.展开更多
This paper presents an inverse problem in analytical dynamics. The inverse problem is to construct the Lagrangian when the integrals of a system are given. Firstly, the differential equations are obtained by using the...This paper presents an inverse problem in analytical dynamics. The inverse problem is to construct the Lagrangian when the integrals of a system are given. Firstly, the differential equations are obtained by using the time derivative of the integrals. Secondly, the differential equations can be written in the Lagrange equations under certain conditions and the Lagrangian can be obtained. Finally, two examples are given to illustrate the application of the result.展开更多
In dynamic environments,it is important to track changing optimal solutions over time.Univariate marginal distribution algorithm（UMDA） which is a class algorithm of estimation of distribution algorithms attracts mor...In dynamic environments,it is important to track changing optimal solutions over time.Univariate marginal distribution algorithm（UMDA） which is a class algorithm of estimation of distribution algorithms attracts more and more attention in recent years.In this paper a new multi-population and diffusion UMDA（MDUMDA） is proposed for dynamic multimodal problems.The multi-population approach is used to locate multiple local optima which are useful to find the global optimal solution quickly to dynamic multimodal problems.The diffusion model is used to increase the diversity in a guided fashion,which makes the neighbor individuals of previous optimal solutions move gradually from the previous optimal solutions and enlarge the search space.This approach uses both the information of current population and the part history information of the optimal solutions.Finally experimental studies on the moving peaks benchmark are carried out to evaluate the proposed algorithm and compare the performance of MDUMDA and multi-population quantum swarm optimization（MQSO） from the literature.The experimental results show that the MDUMDA is effective for the function with moving optimum and can adapt to the dynamic environments rapidly.展开更多
In this study,we construct a bi-level optimization model based on the Stackelberg game and propose a robust optimization algorithm for solving the bi-level model,assuming an actual situation with several participants ...In this study,we construct a bi-level optimization model based on the Stackelberg game and propose a robust optimization algorithm for solving the bi-level model,assuming an actual situation with several participants in energy trading.Firstly,the energy trading process is analyzed between each subject based on the establishment of the operation framework of multi-agent participation in energy trading.Secondly,the optimal operation model of each energy trading agent is established to develop a bi-level game model including each energy participant.Finally,a combination algorithm of improved robust optimization over time(ROOT)and CPLEX is proposed to solve the established game model.The experimental results indicate that under different fitness thresholds,the robust optimization results of the proposed algorithm are increased by 56.91%and 68.54%,respectively.The established bi-level game model effectively balances the benefits of different energy trading entities.The proposed algorithm proposed can increase the income of each participant in the game by an average of 8.59%.展开更多
This paper presents an economic lot-sizing problem with perishable inventory and general economies of scale cost functions. For the case with backlogging allowed, a mathematical model is formulated, and several proper...This paper presents an economic lot-sizing problem with perishable inventory and general economies of scale cost functions. For the case with backlogging allowed, a mathematical model is formulated, and several properties of the optimal solutions are explored. With the help of these optimality properties, a polynomial time approximation algorithm is developed by a new method. The new method adopts a shift technique to obtain a feasible solution of subproblem and takes the optimal solution of the subproblem as an approximation solution of our problem. The worst case performance for the approximation algorithm is proven to be （4√2 ＋ 5）/7. Finally, an instance illustrates that the bound is tight.展开更多
A stochastic resource allocation model, based on the principles of Markov decision processes(MDPs), is proposed in this paper. In particular, a general-purpose framework is developed, which takes into account resource...A stochastic resource allocation model, based on the principles of Markov decision processes(MDPs), is proposed in this paper. In particular, a general-purpose framework is developed, which takes into account resource requests for both instant and future needs. The considered framework can handle two types of reservations(i.e., specified and unspecified time interval reservation requests), and implement an overbooking business strategy to further increase business revenues. The resulting dynamic pricing problems can be regarded as sequential decision-making problems under uncertainty, which is solved by means of stochastic dynamic programming(DP) based algorithms. In this regard, Bellman’s backward principle of optimality is exploited in order to provide all the implementation mechanisms for the proposed reservation pricing algorithm. The curse of dimensionality, as the inevitable issue of the DP both for instant resource requests and future resource reservations,occurs. In particular, an approximate dynamic programming(ADP) technique based on linear function approximations is applied to solve such scalability issues. Several examples are provided to show the effectiveness of the proposed approach.展开更多
The difficulty in solving stochastic dynamics problems lies in the need for a large number of repeated computations of deterministic dynamic equations,which has been a challenge in stochastic dynamics analysis and was...The difficulty in solving stochastic dynamics problems lies in the need for a large number of repeated computations of deterministic dynamic equations,which has been a challenge in stochastic dynamics analysis and was discussed in this study.To efficiently and accurately compute the exponential of the dynamics state matrix and the matrix functions due to external loads,an adaptively filtered precise integration method was proposed,which inherits the high precision of the precise integrationmethod,improves the computational efficiency and saves the memory required.Moreover,the perturbation method was introduced to avoid repeated computations of matrix exponential and terms due to external loads.Based on the filtering and perturbation techniques,an adaptively filtered precise integration method considering perturbation for stochastic dynamics problems was developed.Two numerical experiments,including a model of phononic crystal and a bridge model considering random parameters,were performed to test the performance of the proposed method in terms of accuracy and efficiency.Numerical results show that the accuracy and efficiency of the proposed method are better than those of the existing precise integration method,the Newmark-βmethod and the Wilson-θmethod.展开更多
Bifurcation of periodic solutions widely existed in nonlinear dynamical systems is a kind oftonstrained one in intrinsic quality because its amplitude is always non-negative Classification of the bifurcations with the...Bifurcation of periodic solutions widely existed in nonlinear dynamical systems is a kind oftonstrained one in intrinsic quality because its amplitude is always non-negative Classification of the bifurcations with the type of constraint was discussed. All its six types of transition sets are derived, in which three types are newly found and a method is proposed for analyzing the constrained bifurcation.展开更多
We extended an improved version of the discrete particle swarm optimization (DPSO) algorithm proposed by Liao et al.(2007) to solve the dynamic facility layout problem (DFLP). A computational study was performed with ...We extended an improved version of the discrete particle swarm optimization (DPSO) algorithm proposed by Liao et al.(2007) to solve the dynamic facility layout problem (DFLP). A computational study was performed with the existing heuristic algorithms, including the dynamic programming (DP), genetic algorithm (GA), simulated annealing (SA), hybrid ant system (HAS), hybrid simulated annealing (SA-EG), hybrid genetic algorithms (NLGA and CONGA). The proposed DPSO algorithm, SA, HAS, GA, DP, SA-EG, NLGA, and CONGA obtained the best solutions for 33, 24, 20, 10, 12, 20, 5, and 2 of the 48 problems from (Balakrishnan and Cheng, 2000), respectively. These results show that the DPSO is very effective in dealing with the DFLP. The extended DPSO also has very good computational efficiency when the problem size increases.展开更多
We investigate numerically the dynamical reactions of a moving wheelset model to real measured track irregularities.The background is to examine whether the dynamics are suitable as the input to the inverse problem:de...We investigate numerically the dynamical reactions of a moving wheelset model to real measured track irregularities.The background is to examine whether the dynamics are suitable as the input to the inverse problem:determine the true track geometry from measured wheelset dynamical reactions.It is known that the method works well for the vertical position of the rails but the computed lateral position is often flawed.We find that the lateral motion of the wheelset often may differ from the track geometry.The cases are investigated closely but the reasons remain unknown.While the wheelset dynamics reflect the larger(>4-6 mm)aperiodic track disturbances and single large disturbances quite well,this does not seem to be the case for general smaller or periodic track irregularities or sections behind single large disturbances.The resulting dynamics of a wheelset to lateral track irregularities are in general not sufficiently accurate to be used as the basis for a description of the track irregularities.展开更多
A new scheme of time stepping for solving the dynamic viscoelastic problems are presented. By expanding variables at a discrete time interval, FEM based recurrent formulae are derived. A self-adaptive algorithm for di...A new scheme of time stepping for solving the dynamic viscoelastic problems are presented. By expanding variables at a discrete time interval, FEM based recurrent formulae are derived. A self-adaptive algorithm for different sizes of time steps can be carried out to improve computing accuracy. Numerical validation shows satisfactory performance.展开更多
The structural dynamics problems,such as structural design,parameter identification and model correction,are considered as a kind of the inverse generalized eigenvalue problems mathematically.The inverse eigenvalue pr...The structural dynamics problems,such as structural design,parameter identification and model correction,are considered as a kind of the inverse generalized eigenvalue problems mathematically.The inverse eigenvalue problems are nonlinear.In general,they could be transformed into nonlinear equations to solve.The structural dynamics inverse problems were treated as quasi multiplicative inverse eigenalue problems which were solved by homotopy method for nonlinear equations.This method had no requirements for initial value essentially because of the homotopy path to solution.Numerical examples were presented to illustrate the homotopy method.展开更多
Based on the theory of Eider-Bernoulli beam and Winkler assumption for elastic foundation, a mathematical model is presented. By using Fourier transformation for space variable, Laplace transformation for time variabl...Based on the theory of Eider-Bernoulli beam and Winkler assumption for elastic foundation, a mathematical model is presented. By using Fourier transformation for space variable, Laplace transformation for time variable and convolution theorem for their inverse transformations, a general solution for dynamical problem of infinite beam on an elastic foundation is obtained. Finally, the cases of free vibration,impulsive response and moving load are also discussed.展开更多
Semisubmersible naval ships are versatile military crafts that combine the advantageous features of high-speed planing crafts and submarines.At-surface,these ships are designed to provide sufficient speed and maneuver...Semisubmersible naval ships are versatile military crafts that combine the advantageous features of high-speed planing crafts and submarines.At-surface,these ships are designed to provide sufficient speed and maneuverability.Additionally,they can perform shallow dives,offering low visual and acoustic detectability.Therefore,the hydrodynamic design of a semisubmersible naval ship should address at-surface and submerged conditions.In this study,Numerical analyses were performed using a semisubmersible hull form to analyze its hydrodynamic features,including resistance,powering,and maneuvering.The simulations were conducted with Star CCM+version 2302,a commercial package program that solves URANS equations using the SST k-ωturbulence model.The flow analysis was divided into two parts:at-surface simulations and shallowly submerged simulations.At-surface simulations cover the resistance,powering,trim,and sinkage at transition and planing regimes,with corresponding Froude numbers ranging from 0.42 to 1.69.Shallowly submerged simulations were performed at seven different submergence depths,ranging from D/LOA=0.0635 to D/LOA=0.635,and at two different speeds with Froude numbers of 0.21 and 0.33.The behaviors of the hydrodynamic forces and pitching moment for different operation depths were comprehensively analyzed.The results of the numerical analyses provide valuable insights into the hydrodynamic performance of semisubmersible naval ships,highlighting the critical factors influencing their resistance,powering,and maneuvering capabilities in both at-surface and submerged conditions.展开更多
The inverse problems for motions of dynamic systems of which are described by system of the ordinary differential equations are examined. The classification of such type of inverse problems is given. It was shown that...The inverse problems for motions of dynamic systems of which are described by system of the ordinary differential equations are examined. The classification of such type of inverse problems is given. It was shown that inverse problems can be divided into two types: synthesis inverse problems and inverse problems of measurement (recognition). Each type of inverse problems requires separate approach to statements and solution methods. The regularization method for obtaining of stable solution of inverse problems was suggested. In some cases, instead of recognition of inverse problems solution, the estimation of solution can be used. Within the framework of this approach, two practical inverse problems of measurement are considered.展开更多
An improved Guo Tao algorithm （IGT algorithm） is proposed for solving complicated dynamic function optimization problems, and a function optimization benchmark problem with constrained condition and two dynamic para...An improved Guo Tao algorithm （IGT algorithm） is proposed for solving complicated dynamic function optimization problems, and a function optimization benchmark problem with constrained condition and two dynamic parameters has been designed. The results achieved by IGT algorithm have been compared with the results from the Guo Tao algorithm （GT algorithm）. It is shown that the new algorithm （IGT algorithm） provides better results. This preliminarily demonstrates the efficiency of the new algorithm in complicated dynamic environments.展开更多
Two methods of stability analysis of systems described by dynamical equations are being considered. They are based on an analysis of eigenvalues spectrum for the evolutionary matrix or the spectral equation and they a...Two methods of stability analysis of systems described by dynamical equations are being considered. They are based on an analysis of eigenvalues spectrum for the evolutionary matrix or the spectral equation and they allow determining the conditions of stability and instability, as well as the possibility of chaotic behavior of systems in case of a stability loss. The methods are illustrated for nonlinear Lorenz and Rossler model problems.展开更多
This paper presents a comparative study of evolutionary algorithms which are considered to be effective in solving the multilevel lot-sizing problem in material requirement planning(MRP)systems.Three evolutionary algo...This paper presents a comparative study of evolutionary algorithms which are considered to be effective in solving the multilevel lot-sizing problem in material requirement planning(MRP)systems.Three evolutionary algorithms(simulated annealing(SA),particle swarm optimization(PSO)and genetic algorithm(GA))are provided.For evaluating the performances of algorithms,the distribution of total cost(objective function)and the average computational time are compared.As a result,both GA and PSO have better cost performances with lower average total costs and smaller standard deviations.When the scale of the multilevel lot-sizing problem becomes larger,PSO is of a shorter computational time.展开更多
基金supported by the start-up funding from Westlake University under Grant Number 041030150118 and the scientific research project of Westlake University“Theoretical Research and Demonstration Application of Complex Systems and Deep-Sea Technology(Phase I)”under Grant Number WU2025A006.
文摘Defining science and demarcating it from pseudoscience are longstanding core issues in the philosophy of science.Hilbert’s traditional axiomatic standards(consistency,completeness,independence)struggle with modern complex systems,while existing demarcation criteria like replicability and Popper’s falsificationism have practical limitations.Analyzing incompatibilities in complex systems,this paper proposes a revised framework:modified Hilbert axiomatic standards(clearly defined concepts,logical consistency,unrefuted axioms)and dynamic demarcation criteria.Abandoning unattainable traditional requirements of completeness and independence,it emphasizes conceptual clarity,openness,and progressiveness,offering an operational,self-consistent basis for judging scientificity.
基金supported by the National Key Research and Development Program of China(Grant No.2024YFA1408500)the National Natural Science Foundation of China(Grant Nos.12174028 and 12574115)the Open Fund of the State Key Laboratory of Spintronics Devices and Technologies(Grant No.SPL-2408)。
文摘We incorporate a non-Markovian feedback mechanism into the simulated bifurcation method for dynamical solvers addressing combinatorial optimization problems.By reinjecting a portion of dissipated kinetic energy into each spin in a history-dependent and trajectory-informed manner,the method effectively suppresses early freezing induced by inelastic boundaries and enhances the system's ability to explore complex energy landscapes.Numerical results on the maximum cut(MAX-CUT)instances of fully connected Sherrington–Kirkpatrick(SK)spin glass models,including the 2000-spin K_(2000)benchmark,demonstrate that the non-Markovian algorithm significantly improves both solution quality and convergence speed.Tests on randomly generated SK instances with 100 to 1000 spins further indicate favorable scalability and substantial gains in computational efficiency.Moreover,the proposed scheme is well suited for massively parallel hardware implementations,such as field-programmable gate arrays,providing a practical and scalable approach for solving large-scale combinatorial optimization problems.
基金supported by the Graduate Research Fund of Guizhou Province(Grant No.2024YJSKYJJ165)the National Natural Science Foundation of China(Grant No.62061008)the Guizhou Provincial Basic Research Program(Natural Science)(Grant No.Qian Ke He Ji Chu-ZK[2024]General 439)。
文摘We propose a simplified version of the classic two-dimensional Hindmarsh–Rose neuron(2DHR),resulting in a new 2DHR that exhibits novel chaotic phenomena.Its dynamic characteristics are analyzed through bifurcation diagrams,Lyapunov exponent spectra,equilibrium points,and phase diagrams.Based on this system,a corresponding circuit is designed and circuit simulations are carried out,yielding results consistent with the numerical simulations.To explore practical applications of chaotic systems,2DHR is employed to improve the solution of the flexible job-shop scheduling problem with dynamic events.The research results demonstrate that applying 2DHR can significantly enhance the convergence rate of the optimization algorithm and improve the quality of the scheduling solution.
基金Project supported by the National Natural Science Foundation of China （Grant Nos 10272021, 10572021） and the Doctoral Programme Foundation of Institution of Higher Education of China （Grant No 20040007022）.
文摘This paper presents an inverse problem in analytical dynamics. The inverse problem is to construct the Lagrangian when the integrals of a system are given. Firstly, the differential equations are obtained by using the time derivative of the integrals. Secondly, the differential equations can be written in the Lagrange equations under certain conditions and the Lagrangian can be obtained. Finally, two examples are given to illustrate the application of the result.
基金supported by the National Natural Science Foundation of China (6087309960775013)
文摘In dynamic environments,it is important to track changing optimal solutions over time.Univariate marginal distribution algorithm（UMDA） which is a class algorithm of estimation of distribution algorithms attracts more and more attention in recent years.In this paper a new multi-population and diffusion UMDA（MDUMDA） is proposed for dynamic multimodal problems.The multi-population approach is used to locate multiple local optima which are useful to find the global optimal solution quickly to dynamic multimodal problems.The diffusion model is used to increase the diversity in a guided fashion,which makes the neighbor individuals of previous optimal solutions move gradually from the previous optimal solutions and enlarge the search space.This approach uses both the information of current population and the part history information of the optimal solutions.Finally experimental studies on the moving peaks benchmark are carried out to evaluate the proposed algorithm and compare the performance of MDUMDA and multi-population quantum swarm optimization（MQSO） from the literature.The experimental results show that the MDUMDA is effective for the function with moving optimum and can adapt to the dynamic environments rapidly.
基金supported by the National Nature Science Foundation of China(Nos.62063019)Natural Science Foundation of Gansu Province(22JR5RA241,2023CXZX-465).
文摘In this study,we construct a bi-level optimization model based on the Stackelberg game and propose a robust optimization algorithm for solving the bi-level model,assuming an actual situation with several participants in energy trading.Firstly,the energy trading process is analyzed between each subject based on the establishment of the operation framework of multi-agent participation in energy trading.Secondly,the optimal operation model of each energy trading agent is established to develop a bi-level game model including each energy participant.Finally,a combination algorithm of improved robust optimization over time(ROOT)and CPLEX is proposed to solve the established game model.The experimental results indicate that under different fitness thresholds,the robust optimization results of the proposed algorithm are increased by 56.91%and 68.54%,respectively.The established bi-level game model effectively balances the benefits of different energy trading entities.The proposed algorithm proposed can increase the income of each participant in the game by an average of 8.59%.
基金supported by National Natural Science Foundation of China (No. 10671108 and 70971076)Found for the Doctoral Program of Higher Education of Ministry of Education of China (No. 20070446001)+1 种基金Innovation Planning Project of Shandong Province (No. SDYY06034)Foundation of Qufu Normal University (No. XJZ200849)
文摘This paper presents an economic lot-sizing problem with perishable inventory and general economies of scale cost functions. For the case with backlogging allowed, a mathematical model is formulated, and several properties of the optimal solutions are explored. With the help of these optimality properties, a polynomial time approximation algorithm is developed by a new method. The new method adopts a shift technique to obtain a feasible solution of subproblem and takes the optimal solution of the subproblem as an approximation solution of our problem. The worst case performance for the approximation algorithm is proven to be （4√2 ＋ 5）/7. Finally, an instance illustrates that the bound is tight.
文摘A stochastic resource allocation model, based on the principles of Markov decision processes(MDPs), is proposed in this paper. In particular, a general-purpose framework is developed, which takes into account resource requests for both instant and future needs. The considered framework can handle two types of reservations(i.e., specified and unspecified time interval reservation requests), and implement an overbooking business strategy to further increase business revenues. The resulting dynamic pricing problems can be regarded as sequential decision-making problems under uncertainty, which is solved by means of stochastic dynamic programming(DP) based algorithms. In this regard, Bellman’s backward principle of optimality is exploited in order to provide all the implementation mechanisms for the proposed reservation pricing algorithm. The curse of dimensionality, as the inevitable issue of the DP both for instant resource requests and future resource reservations,occurs. In particular, an approximate dynamic programming(ADP) technique based on linear function approximations is applied to solve such scalability issues. Several examples are provided to show the effectiveness of the proposed approach.
基金the support of the National Natural Science Foundation of China(Grant Nos.11472067 and 51609034)the Science Foundation of Liaoning Province of China(No.2021-MS-119)+1 种基金the Dalian Youth Science and Technology Star Project(No.2018RQ06)the Fundamental Research Funds for the Central Universities(Grant No.DUT20GJ216).
文摘The difficulty in solving stochastic dynamics problems lies in the need for a large number of repeated computations of deterministic dynamic equations,which has been a challenge in stochastic dynamics analysis and was discussed in this study.To efficiently and accurately compute the exponential of the dynamics state matrix and the matrix functions due to external loads,an adaptively filtered precise integration method was proposed,which inherits the high precision of the precise integrationmethod,improves the computational efficiency and saves the memory required.Moreover,the perturbation method was introduced to avoid repeated computations of matrix exponential and terms due to external loads.Based on the filtering and perturbation techniques,an adaptively filtered precise integration method considering perturbation for stochastic dynamics problems was developed.Two numerical experiments,including a model of phononic crystal and a bridge model considering random parameters,were performed to test the performance of the proposed method in terms of accuracy and efficiency.Numerical results show that the accuracy and efficiency of the proposed method are better than those of the existing precise integration method,the Newmark-βmethod and the Wilson-θmethod.
文摘Bifurcation of periodic solutions widely existed in nonlinear dynamical systems is a kind oftonstrained one in intrinsic quality because its amplitude is always non-negative Classification of the bifurcations with the type of constraint was discussed. All its six types of transition sets are derived, in which three types are newly found and a method is proposed for analyzing the constrained bifurcation.
文摘We extended an improved version of the discrete particle swarm optimization (DPSO) algorithm proposed by Liao et al.(2007) to solve the dynamic facility layout problem (DFLP). A computational study was performed with the existing heuristic algorithms, including the dynamic programming (DP), genetic algorithm (GA), simulated annealing (SA), hybrid ant system (HAS), hybrid simulated annealing (SA-EG), hybrid genetic algorithms (NLGA and CONGA). The proposed DPSO algorithm, SA, HAS, GA, DP, SA-EG, NLGA, and CONGA obtained the best solutions for 33, 24, 20, 10, 12, 20, 5, and 2 of the 48 problems from (Balakrishnan and Cheng, 2000), respectively. These results show that the DPSO is very effective in dealing with the DFLP. The extended DPSO also has very good computational efficiency when the problem size increases.
文摘We investigate numerically the dynamical reactions of a moving wheelset model to real measured track irregularities.The background is to examine whether the dynamics are suitable as the input to the inverse problem:determine the true track geometry from measured wheelset dynamical reactions.It is known that the method works well for the vertical position of the rails but the computed lateral position is often flawed.We find that the lateral motion of the wheelset often may differ from the track geometry.The cases are investigated closely but the reasons remain unknown.While the wheelset dynamics reflect the larger(>4-6 mm)aperiodic track disturbances and single large disturbances quite well,this does not seem to be the case for general smaller or periodic track irregularities or sections behind single large disturbances.The resulting dynamics of a wheelset to lateral track irregularities are in general not sufficiently accurate to be used as the basis for a description of the track irregularities.
文摘A new scheme of time stepping for solving the dynamic viscoelastic problems are presented. By expanding variables at a discrete time interval, FEM based recurrent formulae are derived. A self-adaptive algorithm for different sizes of time steps can be carried out to improve computing accuracy. Numerical validation shows satisfactory performance.
文摘The structural dynamics problems,such as structural design,parameter identification and model correction,are considered as a kind of the inverse generalized eigenvalue problems mathematically.The inverse eigenvalue problems are nonlinear.In general,they could be transformed into nonlinear equations to solve.The structural dynamics inverse problems were treated as quasi multiplicative inverse eigenalue problems which were solved by homotopy method for nonlinear equations.This method had no requirements for initial value essentially because of the homotopy path to solution.Numerical examples were presented to illustrate the homotopy method.
文摘Based on the theory of Eider-Bernoulli beam and Winkler assumption for elastic foundation, a mathematical model is presented. By using Fourier transformation for space variable, Laplace transformation for time variable and convolution theorem for their inverse transformations, a general solution for dynamical problem of infinite beam on an elastic foundation is obtained. Finally, the cases of free vibration,impulsive response and moving load are also discussed.
文摘Semisubmersible naval ships are versatile military crafts that combine the advantageous features of high-speed planing crafts and submarines.At-surface,these ships are designed to provide sufficient speed and maneuverability.Additionally,they can perform shallow dives,offering low visual and acoustic detectability.Therefore,the hydrodynamic design of a semisubmersible naval ship should address at-surface and submerged conditions.In this study,Numerical analyses were performed using a semisubmersible hull form to analyze its hydrodynamic features,including resistance,powering,and maneuvering.The simulations were conducted with Star CCM+version 2302,a commercial package program that solves URANS equations using the SST k-ωturbulence model.The flow analysis was divided into two parts:at-surface simulations and shallowly submerged simulations.At-surface simulations cover the resistance,powering,trim,and sinkage at transition and planing regimes,with corresponding Froude numbers ranging from 0.42 to 1.69.Shallowly submerged simulations were performed at seven different submergence depths,ranging from D/LOA=0.0635 to D/LOA=0.635,and at two different speeds with Froude numbers of 0.21 and 0.33.The behaviors of the hydrodynamic forces and pitching moment for different operation depths were comprehensively analyzed.The results of the numerical analyses provide valuable insights into the hydrodynamic performance of semisubmersible naval ships,highlighting the critical factors influencing their resistance,powering,and maneuvering capabilities in both at-surface and submerged conditions.
文摘The inverse problems for motions of dynamic systems of which are described by system of the ordinary differential equations are examined. The classification of such type of inverse problems is given. It was shown that inverse problems can be divided into two types: synthesis inverse problems and inverse problems of measurement (recognition). Each type of inverse problems requires separate approach to statements and solution methods. The regularization method for obtaining of stable solution of inverse problems was suggested. In some cases, instead of recognition of inverse problems solution, the estimation of solution can be used. Within the framework of this approach, two practical inverse problems of measurement are considered.
基金Supported by the National Natural Science Foundation of China(60473081,60133010)
文摘An improved Guo Tao algorithm （IGT algorithm） is proposed for solving complicated dynamic function optimization problems, and a function optimization benchmark problem with constrained condition and two dynamic parameters has been designed. The results achieved by IGT algorithm have been compared with the results from the Guo Tao algorithm （GT algorithm）. It is shown that the new algorithm （IGT algorithm） provides better results. This preliminarily demonstrates the efficiency of the new algorithm in complicated dynamic environments.
文摘Two methods of stability analysis of systems described by dynamical equations are being considered. They are based on an analysis of eigenvalues spectrum for the evolutionary matrix or the spectral equation and they allow determining the conditions of stability and instability, as well as the possibility of chaotic behavior of systems in case of a stability loss. The methods are illustrated for nonlinear Lorenz and Rossler model problems.
基金the National Natural Science Foundation of China(No.70971017)the Humanities and Social Sciences Project of Ministry of Education(No.10YJC630009)+1 种基金the Social Science Fund of Zhejiang Province(No.10CGGL21YBQ)the Natural Science Foundation of Zhejiang Province(No.Y1100854)
文摘This paper presents a comparative study of evolutionary algorithms which are considered to be effective in solving the multilevel lot-sizing problem in material requirement planning(MRP)systems.Three evolutionary algorithms(simulated annealing(SA),particle swarm optimization(PSO)and genetic algorithm(GA))are provided.For evaluating the performances of algorithms,the distribution of total cost(objective function)and the average computational time are compared.As a result,both GA and PSO have better cost performances with lower average total costs and smaller standard deviations.When the scale of the multilevel lot-sizing problem becomes larger,PSO is of a shorter computational time.
