develop a mentation This paper considers the priority facility primal-dual 3-approximation algorithm for procedure, the authors further improve the location problem with penalties： The authors this problem. Combining...develop a mentation This paper considers the priority facility primal-dual 3-approximation algorithm for procedure, the authors further improve the location problem with penalties： The authors this problem. Combining with the greedy aug- previous ratio 3 to 1.8526.展开更多
Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is amo...Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is among the most important combinato- rial problems. An ACO algorithm based on scout characteristic is proposed for solving the stagnation behavior and premature con- vergence problem of the basic ACO algorithm on TSP. The main idea is to partition artificial ants into two groups： scout ants and common ants. The common ants work according to the search manner of basic ant colony algorithm, but scout ants have some differences from common ants, they calculate each route＇s muta- tion probability of the current optimal solution using path evaluation model and search around the optimal solution according to the mutation probability. Simulation on TSP shows that the improved algorithm has high efficiency and robustness.展开更多
The optimization problem is considered in which the objective function is pseudolinear（both pseudoconvex and pseudoconcave） and the constraints are linear. The general expression for the optimal solutions to the pro...The optimization problem is considered in which the objective function is pseudolinear（both pseudoconvex and pseudoconcave） and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions （if the uniqueness condition is not satisfied ） are provided. Finally, an illustrative example is also given.展开更多
Load of an automatic feed mechanism is composed of the stretching force of feed belt at the entrance to lower flexible guidance and the friction force between feed belt and flexible guidance. A mathematical model for ...Load of an automatic feed mechanism is composed of the stretching force of feed belt at the entrance to lower flexible guidance and the friction force between feed belt and flexible guidance. A mathematical model for computing the load was presented. An optimization problem was formulated to determine the attitude of the flexible guidance based on the principle that the potential energy stored in the system was the minimum at the equilibrium. Then the friction force was obtained according to the attitude of guide leaves and the moving velocity of the feed belt and the friction factor. Consequently, the load of the automatic feed mechanism can be calculated. Finally, an example was given to compute the load when the horizontal and elevating firing angles of the automation were respectively 45° and 30°. The computing result can be a criterion to determine the designing parameters of automat.展开更多
This paper establishes a mathematical model of the reliability optimization design for the safe-arming system of an air-faced missile, and presents a solving method for the model. The computational results provide a v...This paper establishes a mathematical model of the reliability optimization design for the safe-arming system of an air-faced missile, and presents a solving method for the model. The computational results provide a valuable reference for the reliability design for the safe-arming system of an air-faced missile.展开更多
Microseismic (MS) source location plays an important role in MS monitoring. This paper proposes a MS source location method based on particle swarm optimization (PSO) and multi-sensor arrays, where a free weight joint...Microseismic (MS) source location plays an important role in MS monitoring. This paper proposes a MS source location method based on particle swarm optimization (PSO) and multi-sensor arrays, where a free weight joints the P-wave first arrival data. This method adaptively adjusts the preference for “superior” arrays and leverages “inferior” arrays to escape local optima, thereby improving the location accuracy. The effectiveness and stability of this method were validated through synthetic tests, pencil-lead break (PLB) experiments, and mining engineering applications. Specifically, for synthetic tests with 1 μs Gaussian noise and 100 μs large noise in rock samples, the location error of the multi-sensor arrays jointed location method is only 0.30 cm, which improves location accuracy by 97.51% compared to that using a single sensor array. The average location error of PLB events on three surfaces of a rock sample is reduced by 48.95%, 26.40%, and 55.84%, respectively. For mine blast event tests, the average location error of the dual sensor arrays jointed method is 62.74 m, 54.32% and 14.29% lower than that using only sensor arrays 1 and 2, respectively. In summary, the proposed multi-sensor arrays jointed location method demonstrates good noise resistance, stability, and accuracy, providing a compelling new solution for MS location in relevant mining scenarios.展开更多
Using K-T optimality condition of nonsmooth optimization, we establish two equivalent systems of the nonsmooth equations for the constrained minimax problem directly. Then generalized Newton methods are applied to so...Using K-T optimality condition of nonsmooth optimization, we establish two equivalent systems of the nonsmooth equations for the constrained minimax problem directly. Then generalized Newton methods are applied to solve these systems of the nonsmooth equations. Thus a new approach to solving the constrained minimax problem is developed.展开更多
In equipment integrated logistics support(ILS), the supply capability of spare parts is a significant factor. There are lots of depots in the traditional support system, which makes too many redundant spare parts and ...In equipment integrated logistics support(ILS), the supply capability of spare parts is a significant factor. There are lots of depots in the traditional support system, which makes too many redundant spare parts and causes high cost of support. Meanwhile,the inconsistency among depots makes it difficult to manage spare parts. With the development of information technology and transportation, the supply network has become more efficient. In order to further improve the efficiency of supply-support work and the availability of the equipment system, building a system of one centralized depot with multiple depots becomes an appropriate way.In this case, location selection of the depots including centralized depots and multiple depots becomes a top priority in the support system. This paper will focus on the location selection problem of centralized depots considering ILS factors. Unlike the common location selection problem, depots in ILS require a higher service level. Therefore, it becomes desperately necessary to take the high requirement of the mission into account while determining location of depots. Based on this, we raise an optimal depot location model. First, the expected transportation cost is calculated.Next, factors in ILS such as response time, availability and fill rate are analyzed for evaluating positions of open depots. Then, an optimization model of depot location is developed with the minimum expected cost of transportation as objective and ILS factors as constraints. Finally, a numerical case is studied to prove the validity of the model by using the genetic algorithm. Results show that depot location obtained by this model can guarantee the effectiveness and capability of ILS well.展开更多
To improve the mainlainability design efficiency and quality, a layout optimization method for maintainability of multi-component systems was proposed. The impact of the component layout design on system maintainabili...To improve the mainlainability design efficiency and quality, a layout optimization method for maintainability of multi-component systems was proposed. The impact of the component layout design on system maintainability was analyzed, and the layout problem for maintainability was presented. It was formulated as an optimization problem, where maintainability, layout space and distance requirement were formulated as objective functions. A multi-objective particle swarm optimization algorithm, in which the constrained-domination relationship and the update strategy of the global best were simply modified, was then used to obtain Pareto optimal solutions for the maintainability layout design problem. Finally, application in oxygen generation system of a spacecraft was studied in detail to illustrate the effectiveness and usefulness of the proposed method. The results show that the concurrent maintainability design can be carried out during the layout design process by solving the layout optimization problem for maintainability.展开更多
This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for...This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for locating and setting of thyristor controlled series capacitor(TCSC) and static var compensator(SVC) using the multi-objective optimization approach named strength pareto multi-objective evolutionary algorithm(SPMOEA). Maximization of the static voltage stability margin(SVSM) and minimizations of real power losses(RPL) and load voltage deviation(LVD) are taken as the goals or three objective functions, when optimally locating multi-type FACTS devices. The performance and effectiveness of the proposed approach has been validated by the simulation results of the IEEE 30-bus and IEEE 118-bus test systems. The proposed approach is compared with non-dominated sorting particle swarm optimization(NSPSO) algorithm. This comparison confirms the usefulness of the multi-objective proposed technique that makes it promising for determination of combinatorial problems of FACTS devices location and setting in large scale power systems.展开更多
In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used t...In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.展开更多
As far as the weight digraph is considered, based on the table instead of the weightdigraph, an optimal spanning tree method called the Table Operations Method (TOM) is proposed.And the optimality is proved and a nume...As far as the weight digraph is considered, based on the table instead of the weightdigraph, an optimal spanning tree method called the Table Operations Method (TOM) is proposed.And the optimality is proved and a numerical example is demonstrated.展开更多
A new efficient coupling relationship description method has been developed to provide an automated and visualized way to multidisciplinary design optimization (MDO) modeling and solving. The disciplinary relation mat...A new efficient coupling relationship description method has been developed to provide an automated and visualized way to multidisciplinary design optimization (MDO) modeling and solving. The disciplinary relation matrix (DRM) is proposed to describe the coupling relationship according to disciplinary input/output variables, and the MDO definition has been reformulated to adopt the new interfaces. Based on these, a universal MDO solving procedure is proposed to establish an automated and efficient way for MDO modeling and solving. Through a simple and convenient initial configuration, MDO problems can be solved using any of available MDO architectures with no further effort. Several examples are used to verify the proposed MDO modeling and solving process. Result shows that the DRM method has the ability to simplify and automate the MDO procedure, and the related MDO framework can evaluate the MDO problem automatically and efficiently.展开更多
The casting nozzle location plays an important role in die casting. Improper location results in defects, such as cold shut, air cavity, shrinkage, etc. Therefore, it’s sure that the molten metal full fills the mould...The casting nozzle location plays an important role in die casting. Improper location results in defects, such as cold shut, air cavity, shrinkage, etc. Therefore, it’s sure that the molten metal full fills the mould cavity before it solidifies. And, it’s to be wished that no vortex occur during the filling process, because the vortex is a main source that induces gas entrapment. To get the high quality and performance product, the inlet and outlet locations must be set properly. This paper, an optimal design problem of nozzle and vent locations, which is constrained by nonlinear partial differential equations and boundary and initial conditions, is introduced to describe the location selection on die casting filling process. By numerical simulation, one can compare the filling time, flow pattern and temperature field at different inlet and outlet locations, then choose the most proper locations.展开更多
By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-H...By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-Hermitian generalized anti-Hamiltonian matrices, and obtain a general expression of the solution to this problem. By using the properties of the orthogonal projection matrix, we also obtain the expression of the solution to optimal approximate problem of an n× n complex matrix under spectral restriction.展开更多
To address the poor performance of commonly used intelligent optimization algorithms in solving location problems—specifically regarding effectiveness,efficiency,and stability—this study proposes a novel location al...To address the poor performance of commonly used intelligent optimization algorithms in solving location problems—specifically regarding effectiveness,efficiency,and stability—this study proposes a novel location allocation method for the delivery sites to deliver daily necessities during epidemic quarantines.After establishing the optimization objectives and constraints,we developed a relevant mathematical model based on the collected data and utilized traditional intelligent optimization algorithms to obtain Pareto optimal solutions.Building on the characteristics of these Pareto front solutions,we introduced an improved clustering algorithm and conducted simulation experiments using data from Changchun City.The results demonstrate that the proposed algorithm outperforms traditional intelligent optimization algorithms in terms of effectiveness,efficiency,and stability,achieving reductions of approximately 12%and 8%in time and labor costs,respectively,compared to the baseline algorithm.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.11371001
文摘develop a mentation This paper considers the priority facility primal-dual 3-approximation algorithm for procedure, the authors further improve the location problem with penalties： The authors this problem. Combining with the greedy aug- previous ratio 3 to 1.8526.
基金supported by the National Natural Science Foundation of China(60573159)
文摘Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is among the most important combinato- rial problems. An ACO algorithm based on scout characteristic is proposed for solving the stagnation behavior and premature con- vergence problem of the basic ACO algorithm on TSP. The main idea is to partition artificial ants into two groups： scout ants and common ants. The common ants work according to the search manner of basic ant colony algorithm, but scout ants have some differences from common ants, they calculate each route＇s muta- tion probability of the current optimal solution using path evaluation model and search around the optimal solution according to the mutation probability. Simulation on TSP shows that the improved algorithm has high efficiency and robustness.
文摘The optimization problem is considered in which the objective function is pseudolinear（both pseudoconvex and pseudoconcave） and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions （if the uniqueness condition is not satisfied ） are provided. Finally, an illustrative example is also given.
基金Project supported by the Seventh Research Institute of China State Shipbuilding Corporation
文摘Load of an automatic feed mechanism is composed of the stretching force of feed belt at the entrance to lower flexible guidance and the friction force between feed belt and flexible guidance. A mathematical model for computing the load was presented. An optimization problem was formulated to determine the attitude of the flexible guidance based on the principle that the potential energy stored in the system was the minimum at the equilibrium. Then the friction force was obtained according to the attitude of guide leaves and the moving velocity of the feed belt and the friction factor. Consequently, the load of the automatic feed mechanism can be calculated. Finally, an example was given to compute the load when the horizontal and elevating firing angles of the automation were respectively 45° and 30°. The computing result can be a criterion to determine the designing parameters of automat.
文摘This paper establishes a mathematical model of the reliability optimization design for the safe-arming system of an air-faced missile, and presents a solving method for the model. The computational results provide a valuable reference for the reliability design for the safe-arming system of an air-faced missile.
基金Project(SICGM2023301) supported by the State Key Laboratory of Strata Intelligent Control and Green Mining Co-founded by Shandong Province and the Ministry of Science and Technology,ChinaProject(SMDPC202202) supported by the Key Laboratory of Mining Disaster Prevention and Control,ChinaProject(U21A2030) supported by the National Natural Science Foundation of China。
文摘Microseismic (MS) source location plays an important role in MS monitoring. This paper proposes a MS source location method based on particle swarm optimization (PSO) and multi-sensor arrays, where a free weight joints the P-wave first arrival data. This method adaptively adjusts the preference for “superior” arrays and leverages “inferior” arrays to escape local optima, thereby improving the location accuracy. The effectiveness and stability of this method were validated through synthetic tests, pencil-lead break (PLB) experiments, and mining engineering applications. Specifically, for synthetic tests with 1 μs Gaussian noise and 100 μs large noise in rock samples, the location error of the multi-sensor arrays jointed location method is only 0.30 cm, which improves location accuracy by 97.51% compared to that using a single sensor array. The average location error of PLB events on three surfaces of a rock sample is reduced by 48.95%, 26.40%, and 55.84%, respectively. For mine blast event tests, the average location error of the dual sensor arrays jointed method is 62.74 m, 54.32% and 14.29% lower than that using only sensor arrays 1 and 2, respectively. In summary, the proposed multi-sensor arrays jointed location method demonstrates good noise resistance, stability, and accuracy, providing a compelling new solution for MS location in relevant mining scenarios.
文摘Using K-T optimality condition of nonsmooth optimization, we establish two equivalent systems of the nonsmooth equations for the constrained minimax problem directly. Then generalized Newton methods are applied to solve these systems of the nonsmooth equations. Thus a new approach to solving the constrained minimax problem is developed.
基金supported by the Science Challenge Project(TZ2018007)the National Natural Science Foundation of China(71671009+2 种基金 61871013 61573041 61573043)
文摘In equipment integrated logistics support(ILS), the supply capability of spare parts is a significant factor. There are lots of depots in the traditional support system, which makes too many redundant spare parts and causes high cost of support. Meanwhile,the inconsistency among depots makes it difficult to manage spare parts. With the development of information technology and transportation, the supply network has become more efficient. In order to further improve the efficiency of supply-support work and the availability of the equipment system, building a system of one centralized depot with multiple depots becomes an appropriate way.In this case, location selection of the depots including centralized depots and multiple depots becomes a top priority in the support system. This paper will focus on the location selection problem of centralized depots considering ILS factors. Unlike the common location selection problem, depots in ILS require a higher service level. Therefore, it becomes desperately necessary to take the high requirement of the mission into account while determining location of depots. Based on this, we raise an optimal depot location model. First, the expected transportation cost is calculated.Next, factors in ILS such as response time, availability and fill rate are analyzed for evaluating positions of open depots. Then, an optimization model of depot location is developed with the minimum expected cost of transportation as objective and ILS factors as constraints. Finally, a numerical case is studied to prove the validity of the model by using the genetic algorithm. Results show that depot location obtained by this model can guarantee the effectiveness and capability of ILS well.
基金Project(51005238)supported by the National Natural Science Foundation of China
文摘To improve the mainlainability design efficiency and quality, a layout optimization method for maintainability of multi-component systems was proposed. The impact of the component layout design on system maintainability was analyzed, and the layout problem for maintainability was presented. It was formulated as an optimization problem, where maintainability, layout space and distance requirement were formulated as objective functions. A multi-objective particle swarm optimization algorithm, in which the constrained-domination relationship and the update strategy of the global best were simply modified, was then used to obtain Pareto optimal solutions for the maintainability layout design problem. Finally, application in oxygen generation system of a spacecraft was studied in detail to illustrate the effectiveness and usefulness of the proposed method. The results show that the concurrent maintainability design can be carried out during the layout design process by solving the layout optimization problem for maintainability.
文摘This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for locating and setting of thyristor controlled series capacitor(TCSC) and static var compensator(SVC) using the multi-objective optimization approach named strength pareto multi-objective evolutionary algorithm(SPMOEA). Maximization of the static voltage stability margin(SVSM) and minimizations of real power losses(RPL) and load voltage deviation(LVD) are taken as the goals or three objective functions, when optimally locating multi-type FACTS devices. The performance and effectiveness of the proposed approach has been validated by the simulation results of the IEEE 30-bus and IEEE 118-bus test systems. The proposed approach is compared with non-dominated sorting particle swarm optimization(NSPSO) algorithm. This comparison confirms the usefulness of the multi-objective proposed technique that makes it promising for determination of combinatorial problems of FACTS devices location and setting in large scale power systems.
文摘In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.
文摘As far as the weight digraph is considered, based on the table instead of the weightdigraph, an optimal spanning tree method called the Table Operations Method (TOM) is proposed.And the optimality is proved and a numerical example is demonstrated.
基金supported by the National Natural Science Foundation of China(51505385)Shanghai Aerospace Science and Technology Innovation Foundation(SAST2015010)the Defense Basic Research Program(JCKY2016204B102)
文摘A new efficient coupling relationship description method has been developed to provide an automated and visualized way to multidisciplinary design optimization (MDO) modeling and solving. The disciplinary relation matrix (DRM) is proposed to describe the coupling relationship according to disciplinary input/output variables, and the MDO definition has been reformulated to adopt the new interfaces. Based on these, a universal MDO solving procedure is proposed to establish an automated and efficient way for MDO modeling and solving. Through a simple and convenient initial configuration, MDO problems can be solved using any of available MDO architectures with no further effort. Several examples are used to verify the proposed MDO modeling and solving process. Result shows that the DRM method has the ability to simplify and automate the MDO procedure, and the related MDO framework can evaluate the MDO problem automatically and efficiently.
文摘The casting nozzle location plays an important role in die casting. Improper location results in defects, such as cold shut, air cavity, shrinkage, etc. Therefore, it’s sure that the molten metal full fills the mould cavity before it solidifies. And, it’s to be wished that no vortex occur during the filling process, because the vortex is a main source that induces gas entrapment. To get the high quality and performance product, the inlet and outlet locations must be set properly. This paper, an optimal design problem of nozzle and vent locations, which is constrained by nonlinear partial differential equations and boundary and initial conditions, is introduced to describe the location selection on die casting filling process. By numerical simulation, one can compare the filling time, flow pattern and temperature field at different inlet and outlet locations, then choose the most proper locations.
基金Project(10171031) supported by the National Natural Science Foundation of China
文摘By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-Hermitian generalized anti-Hamiltonian matrices, and obtain a general expression of the solution to this problem. By using the properties of the orthogonal projection matrix, we also obtain the expression of the solution to optimal approximate problem of an n× n complex matrix under spectral restriction.
基金National Natural Science Foundation of China(62202477)。
文摘To address the poor performance of commonly used intelligent optimization algorithms in solving location problems—specifically regarding effectiveness,efficiency,and stability—this study proposes a novel location allocation method for the delivery sites to deliver daily necessities during epidemic quarantines.After establishing the optimization objectives and constraints,we developed a relevant mathematical model based on the collected data and utilized traditional intelligent optimization algorithms to obtain Pareto optimal solutions.Building on the characteristics of these Pareto front solutions,we introduced an improved clustering algorithm and conducted simulation experiments using data from Changchun City.The results demonstrate that the proposed algorithm outperforms traditional intelligent optimization algorithms in terms of effectiveness,efficiency,and stability,achieving reductions of approximately 12%and 8%in time and labor costs,respectively,compared to the baseline algorithm.
