As a new structure of solid matter quasicrystal brings profound new ideas to the traditional condensed matter physics, its elastic equations are more complicated than that of traditional crystal. A contact problem of ...As a new structure of solid matter quasicrystal brings profound new ideas to the traditional condensed matter physics, its elastic equations are more complicated than that of traditional crystal. A contact problem of decagonal two? dimensional quasicrystal material under the action of a rigid flat die is solved satisfactorily by introducing displacement function and using Fourier analysis and dual integral equations theory, and the analytical expressions of stress and displacement fields of the contact problem are achieved. The results show that if the contact displacement is a constant in the contact zone, the vertical contact stress has order -1/2 singularity on the edge of contact zone, which provides the important mechanics parameter for contact deformation of the quasicrystal.展开更多
A novel algorithm called Colony Location Algorithm (CLA) is proposed. It mimics the phenomena in biotic community that colonies of species could be located in the places most suitable to their growth. The factors work...A novel algorithm called Colony Location Algorithm (CLA) is proposed. It mimics the phenomena in biotic community that colonies of species could be located in the places most suitable to their growth. The factors working on the species location such as the nutrient of soil, resource competition between species, growth and decline process, and effect on environment were considered in CLA via the nutrient function, growth and decline rates, environment evaluation and fertilization strategy. CLA was applied to solve the classical assignment problems. The computation results show that CLA can achieve the optimal solution with higher possibility and shorter running time.展开更多
In this paper we survey the authors＇ and related work on two-dimensional Riemann problems for hyperbolic conservation laws, mainly those related to the compressible Euler equations in gas dynamics. It contains four s...In this paper we survey the authors＇ and related work on two-dimensional Riemann problems for hyperbolic conservation laws, mainly those related to the compressible Euler equations in gas dynamics. It contains four sections： 1. Historical review. 2. Scalar conservation laws. 3. Euler equations. 4. Simplified models.展开更多
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.展开更多
Traditional Hungarian method can only solve standard assignment problems, while can not solve competition assignment problems. This article emphatically discussed the difference between standard assignment problems an...Traditional Hungarian method can only solve standard assignment problems, while can not solve competition assignment problems. This article emphatically discussed the difference between standard assignment problems and competition assignment problems. The kinds of competition assignment problem algorithms based on Hungarian method and the solutions of them were studied.展开更多
With the rapid development of air transportation in recent years,airport operations have attracted a lot of attention.Among them,airport gate assignment problem(AGAP)has become a research hotspot.However,the real-time...With the rapid development of air transportation in recent years,airport operations have attracted a lot of attention.Among them,airport gate assignment problem(AGAP)has become a research hotspot.However,the real-time AGAP algorithm is still an open issue.In this study,a deep reinforcement learning based AGAP(DRL-AGAP)is proposed.The optimization object is to maximize the rate of flights assigned to fixed gates.The real-time AGAP is modeled as a Markov decision process(MDP).The state space,action space,value and rewards have been defined.The DRL-AGAP algorithm is evaluated via simulation and it is compared with the flight pre-assignment results of the optimization software Gurobiand Greedy.Simulation results show that the performance of the proposed DRL-AGAP algorithm is close to that of pre-assignment obtained by the Gurobi optimization solver.Meanwhile,the real-time assignment ability is ensured by the proposed DRL-AGAP algorithm due to the dynamic modeling and lower complexity.展开更多
This paper proposes an eigenfunction expansion method to solve twodimensional （2D） elasticity problems based on stress formulation. By introducing appropriate state functions, the fundamental system of partial diffe...This paper proposes an eigenfunction expansion method to solve twodimensional （2D） elasticity problems based on stress formulation. By introducing appropriate state functions, the fundamental system of partial differential equations of the above 2D problems is rewritten as an upper triangular differential system. For the associated operator matrix, the existence and the completeness of two normed orthogonal eigenfunction systems in some space are obtained, which belong to the two block operators arising in the operator matrix. Moreover, the general solution to the above 2D problem is given by the eigenfunction expansion method.展开更多
In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency s...In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency spectrum. In order to satisfy the increasing demand in such cellular mobile networks, we use a hybrid approach consisting of a Particle Swarm Optimization(PSO) combined with a Tabu Search(TS) algorithm. This approach takes both advantages of PSO efficiency in global optimization and TS in avoiding the premature convergence that would lead PSO to stagnate in a local minimum. Moreover, we propose a new efficient, simple, and inexpensive model for storing and evaluating solution's assignment. The purpose of this model reduces the solution's storage volume as well as the computations required to evaluate thesesolutions in comparison with the classical model. Our simulation results on the most known benchmarking instances prove the effectiveness of our proposed algorithm in comparison with previous related works in terms of convergence rate, the number of iterations, the solution storage volume and the running time required to converge to the optimal solution.展开更多
Recently, Yadaiah and Haragopal published in the American Journal of Operations Research a new approach to solving the unbalanced assignment problem. They also provide a numerical example which they solve with their a...Recently, Yadaiah and Haragopal published in the American Journal of Operations Research a new approach to solving the unbalanced assignment problem. They also provide a numerical example which they solve with their approach and get a cost of 1550 which they claim is optimum. This approach might be of interest;however, their approach does not guarantee the optimal solution. In this short paper, we will show that solving this same example from the Yadaiah and Haragopal paper by using a simple textbook formulation to balance the problem and then solve it with the classic Hungarian method of Kuhn yields the true optimal solution with a cost of 1520.展开更多
A new troubleshooting algorithm for solving assignment problem based on existing algorithms is proposed, and an analysis on the related theory is given. By applying the new troubleshooting algorithm to the Lagrange re...A new troubleshooting algorithm for solving assignment problem based on existing algorithms is proposed, and an analysis on the related theory is given. By applying the new troubleshooting algorithm to the Lagrange relaxation algorithm of the multi-dimensional assignment problem of data association for multi-passive-sensor multi-target location systems, and comparing the simulation results with that of the Hungarian algorithm which is the classical optimal solving algorithm, and the multi-layer ordersearching algorithm which is a sub-optimal solving algorithm, the performance and applying conditions of the new algorithm are summarized. Theory analysis and simulation results prove the effectiveness and superiority of the new algorithm.展开更多
In this paper we carried out a probabilistic analysis for a machine repair system with a general service-time distribution by means of generalized Markov renewal processes. Some formulas for the steady-state performan...In this paper we carried out a probabilistic analysis for a machine repair system with a general service-time distribution by means of generalized Markov renewal processes. Some formulas for the steady-state performance measures. such as the distribution of queue sizes, average queue length, degree of repairman utilization and so on. are then derived. Finally, the machine repair model and a multiple critcria decision-making method are applied to study machine assignment problem with a general service-time distribution to determine the optimum number of machines being serviced by one repairman.展开更多
The semi-Lagrangian relaxation （SLR）, a new exactmethod for combinatorial optimization problems with equality constraints,is applied to the quadratic assignment problem （QAP）.A dual ascent algorithm with finite co...The semi-Lagrangian relaxation （SLR）, a new exactmethod for combinatorial optimization problems with equality constraints,is applied to the quadratic assignment problem （QAP）.A dual ascent algorithm with finite convergence is developed forsolving the semi-Lagrangian dual problem associated to the QAP.We perform computational experiments on 30 moderately difficultQAP instances by using the mixed integer programming solvers,Cplex, and SLR＋Cplex, respectively. The numerical results notonly further illustrate that the SLR and the developed dual ascentalgorithm can be used to solve the QAP reasonably, but also disclosean interesting fact： comparing with solving the unreducedproblem, the reduced oracle problem cannot be always effectivelysolved by using Cplex in terms of the CPU time.展开更多
Spectrum management and resource allocation(RA)problems are challenging and critical in a vast number of research areas such as wireless communications and computer networks.The traditional approaches for solving such...Spectrum management and resource allocation(RA)problems are challenging and critical in a vast number of research areas such as wireless communications and computer networks.The traditional approaches for solving such problems usually consume time and memory,especially for large-size problems.Recently different machine learning approaches have been considered as potential promising techniques for combinatorial optimization problems,especially the generative model of the deep neural networks.In this work,we propose a resource allocation deep autoencoder network,as one of the promising generative models,for enabling spectrum sharing in underlay device-to-device(D2D)communication by solving linear sum assignment problems(LSAPs).Specifically,we investigate the performance of three different architectures for the conditional variational autoencoders(CVAE).The three proposed architecture are the convolutional neural network(CVAECNN)autoencoder,the feed-forward neural network(CVAE-FNN)autoencoder,and the hybrid(H-CVAE)autoencoder.The simulation results show that the proposed approach could be used as a replacement of the conventional RA techniques,such as the Hungarian algorithm,due to its ability to find solutions of LASPs of different sizes with high accuracy and very fast execution time.Moreover,the simulation results reveal that the accuracy of the proposed hybrid autoencoder architecture outperforms the other proposed architectures and the state-of-the-art DNN techniques.展开更多
Using a polarization method, the scattering problem for a two-dimensional inclusion embedded in infinite piezoelectric/piezomagnetic matrices is investigated. To achieve the purpose, the polarization method for a two-...Using a polarization method, the scattering problem for a two-dimensional inclusion embedded in infinite piezoelectric/piezomagnetic matrices is investigated. To achieve the purpose, the polarization method for a two-dimensional piezoelectric/piezomagnetic ＂comparison body＂ is formulated. For simple harmonic motion, kernel of the polarization method reduces to a 2-D time-harmonic Green＇s function, which is obtained using the Radon transform. The expression is further simplified under conditions of low frequency of the incident wave and small diameter of the inclusion. Some analytical expressions are obtained. The analytical solutions for generalized piezoelectric/piezomagnetic anisotropic composites are given followed by simplified results for piezoelectric composites. Based on the latter results, two numerical results are provided for an elliptical cylindrical inclusion in a PZT-5H-matrix, showing the effect of different factors including size, shape, material properties, and piezoelectricity on the scattering cross-section.展开更多
We are concerned with global solutions of multidimensional(M-D)Riemann problems for nonlinear hyperbolic systems of conservation laws,focusing on their global configurations and structures.We present some recent devel...We are concerned with global solutions of multidimensional(M-D)Riemann problems for nonlinear hyperbolic systems of conservation laws,focusing on their global configurations and structures.We present some recent developments in the rigorous analysis of two-dimensional(2-D)Riemann problems involving transonic shock waves through several prototypes of hyperbolic systems of conservation laws and discuss some further M-D Riemann problems and related problems for nonlinear partial differential equations.In particular,we present four different 2-D Riemann problems through these prototypes of hyperbolic systems and show how these Riemann problems can be reformulated/solved as free boundary problems with transonic shock waves as free boundaries for the corresponding nonlinear conservation laws of mixed elliptic-hyperbolic type and related nonlinear partial differential equations.展开更多
This paper studies the eigenfunction expansion method to solve the two dimensional （2D） elasticity problems based on the stress formulation. The fundamental system of partial differential equations of the 2D problem...This paper studies the eigenfunction expansion method to solve the two dimensional （2D） elasticity problems based on the stress formulation. The fundamental system of partial differential equations of the 2D problems is rewritten as an upper tri angular differential system based on the known results, and then the associated upper triangular operator matrix matrix is obtained. By further research, the two simpler com plete orthogonal systems of eigenfunctions in some space are obtained, which belong to the two block operators arising in the operator matrix. Then, a more simple and conve nient general solution to the 2D problem is given by the eigenfunction expansion method. Furthermore, the boundary conditions for the 2D problem, which can be solved by this method, are indicated. Finally, the validity of the obtained results is verified by a specific example.展开更多
System reliability optimization problem of multi-source multi-sink flow network is defined by searching the optimal components that maximize the reliability and minimize the total assignment cost. Therefore, a genetic...System reliability optimization problem of multi-source multi-sink flow network is defined by searching the optimal components that maximize the reliability and minimize the total assignment cost. Therefore, a genetic-based approach is proposed to solve the components assignment problem under budget constraint. The mathematical model of the optimization problem is presented and solved by the proposed genetic-based approach. The proposed approach is based on determining the optimal set of lower boundary points that maximize the system reliability such that the total assignment cost does not exceed the specified budget. Finally, to evaluate our approach, we applied it to various network examples with different numbers of available components;two-source two-sink network and three-source two-sink network.展开更多
Assignment of jobs to workers, contract to contractors undergoing a bidding process, assigning nurses to duty post, or time tabling for teachers in school and many more have become a growing concern to both management...Assignment of jobs to workers, contract to contractors undergoing a bidding process, assigning nurses to duty post, or time tabling for teachers in school and many more have become a growing concern to both management and sector leaders alike. Hungarian algorithm has been the most successful tool for solving such problems. The authors have proposed a heuristic method for solving assignment problems with less computing time in comparison with Hungarian algorithm that gives comparable results with an added advantage of easy implementation. The proposed heuristic method is used to compute some bench mark problems.展开更多
In this paper, we discuss a new approach for solving an unbalanced assignment problem. A Lexi-search algorithm is used to assign all the jobs to machines optimally. The results of new approach are compared with existi...In this paper, we discuss a new approach for solving an unbalanced assignment problem. A Lexi-search algorithm is used to assign all the jobs to machines optimally. The results of new approach are compared with existing approaches, and this approach outperforms other methods. Finally, numerical example (Table 1) has been given to show the efficiency of the proposed methodology.展开更多
文摘As a new structure of solid matter quasicrystal brings profound new ideas to the traditional condensed matter physics, its elastic equations are more complicated than that of traditional crystal. A contact problem of decagonal two? dimensional quasicrystal material under the action of a rigid flat die is solved satisfactorily by introducing displacement function and using Fourier analysis and dual integral equations theory, and the analytical expressions of stress and displacement fields of the contact problem are achieved. The results show that if the contact displacement is a constant in the contact zone, the vertical contact stress has order -1/2 singularity on the edge of contact zone, which provides the important mechanics parameter for contact deformation of the quasicrystal.
基金This work was supported by the National Natural Science Foundation of China (No. 70171056)the Key Lab Foundation of Education Ministry,Santou University, China
文摘A novel algorithm called Colony Location Algorithm (CLA) is proposed. It mimics the phenomena in biotic community that colonies of species could be located in the places most suitable to their growth. The factors working on the species location such as the nutrient of soil, resource competition between species, growth and decline process, and effect on environment were considered in CLA via the nutrient function, growth and decline rates, environment evaluation and fertilization strategy. CLA was applied to solve the classical assignment problems. The computation results show that CLA can achieve the optimal solution with higher possibility and shorter running time.
基金supported by 973 Key program and the Key Program from Beijing Educational Commission with No. KZ200910028002Program for New Century Excellent Talents in University (NCET)+4 种基金Funding Project for Academic Human Resources Development in Institutions of Higher Learning Under the Jurisdiction of Beijing Municipality (PHR-IHLB)The research of Sheng partially supported by NSFC (10671120)Shanghai Leading Academic Discipline Project: J50101The research of Zhang partially supported by NSFC (10671120)The research of Zheng partially supported by NSF-DMS-0603859
文摘In this paper we survey the authors＇ and related work on two-dimensional Riemann problems for hyperbolic conservation laws, mainly those related to the compressible Euler equations in gas dynamics. It contains four sections： 1. Historical review. 2. Scalar conservation laws. 3. Euler equations. 4. Simplified models.
文摘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.
文摘Traditional Hungarian method can only solve standard assignment problems, while can not solve competition assignment problems. This article emphatically discussed the difference between standard assignment problems and competition assignment problems. The kinds of competition assignment problem algorithms based on Hungarian method and the solutions of them were studied.
基金Supported by the National Natural Science Foundation of China(No.U1633115)the Science and Technology Foundation of Beijing Municipal Commission of Education(No.KM201810005027)。
文摘With the rapid development of air transportation in recent years,airport operations have attracted a lot of attention.Among them,airport gate assignment problem(AGAP)has become a research hotspot.However,the real-time AGAP algorithm is still an open issue.In this study,a deep reinforcement learning based AGAP(DRL-AGAP)is proposed.The optimization object is to maximize the rate of flights assigned to fixed gates.The real-time AGAP is modeled as a Markov decision process(MDP).The state space,action space,value and rewards have been defined.The DRL-AGAP algorithm is evaluated via simulation and it is compared with the flight pre-assignment results of the optimization software Gurobiand Greedy.Simulation results show that the performance of the proposed DRL-AGAP algorithm is close to that of pre-assignment obtained by the Gurobi optimization solver.Meanwhile,the real-time assignment ability is ensured by the proposed DRL-AGAP algorithm due to the dynamic modeling and lower complexity.
基金Project supported by the National Natural Science Foundation of China (No. 10962004)the Special-ized Research Fund for the Doctoral Program of Higher Education of China (No. 20070126002)+1 种基金the Chunhui Program of Ministry of Education of China (No. Z2009-1-01010)the Natural Science Foundation of Inner Mongolia (No. 2009BS0101)
文摘This paper proposes an eigenfunction expansion method to solve twodimensional （2D） elasticity problems based on stress formulation. By introducing appropriate state functions, the fundamental system of partial differential equations of the above 2D problems is rewritten as an upper triangular differential system. For the associated operator matrix, the existence and the completeness of two normed orthogonal eigenfunction systems in some space are obtained, which belong to the two block operators arising in the operator matrix. Moreover, the general solution to the above 2D problem is given by the eigenfunction expansion method.
文摘In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency spectrum. In order to satisfy the increasing demand in such cellular mobile networks, we use a hybrid approach consisting of a Particle Swarm Optimization(PSO) combined with a Tabu Search(TS) algorithm. This approach takes both advantages of PSO efficiency in global optimization and TS in avoiding the premature convergence that would lead PSO to stagnate in a local minimum. Moreover, we propose a new efficient, simple, and inexpensive model for storing and evaluating solution's assignment. The purpose of this model reduces the solution's storage volume as well as the computations required to evaluate thesesolutions in comparison with the classical model. Our simulation results on the most known benchmarking instances prove the effectiveness of our proposed algorithm in comparison with previous related works in terms of convergence rate, the number of iterations, the solution storage volume and the running time required to converge to the optimal solution.
文摘Recently, Yadaiah and Haragopal published in the American Journal of Operations Research a new approach to solving the unbalanced assignment problem. They also provide a numerical example which they solve with their approach and get a cost of 1550 which they claim is optimum. This approach might be of interest;however, their approach does not guarantee the optimal solution. In this short paper, we will show that solving this same example from the Yadaiah and Haragopal paper by using a simple textbook formulation to balance the problem and then solve it with the classic Hungarian method of Kuhn yields the true optimal solution with a cost of 1520.
基金supported by the National Natural Science Foundation of China(61170161)the Natural Science Foundation of S handong (ZR2009GM002)the Technology Projects of Shandong University (J09LG01)
文摘A new troubleshooting algorithm for solving assignment problem based on existing algorithms is proposed, and an analysis on the related theory is given. By applying the new troubleshooting algorithm to the Lagrange relaxation algorithm of the multi-dimensional assignment problem of data association for multi-passive-sensor multi-target location systems, and comparing the simulation results with that of the Hungarian algorithm which is the classical optimal solving algorithm, and the multi-layer ordersearching algorithm which is a sub-optimal solving algorithm, the performance and applying conditions of the new algorithm are summarized. Theory analysis and simulation results prove the effectiveness and superiority of the new algorithm.
文摘In this paper we carried out a probabilistic analysis for a machine repair system with a general service-time distribution by means of generalized Markov renewal processes. Some formulas for the steady-state performance measures. such as the distribution of queue sizes, average queue length, degree of repairman utilization and so on. are then derived. Finally, the machine repair model and a multiple critcria decision-making method are applied to study machine assignment problem with a general service-time distribution to determine the optimum number of machines being serviced by one repairman.
基金supported by the National Natural Science Foundation of China(71401106)the Innovation Program of Shanghai Municipal Education Commission(14YZ090)+4 种基金the Shanghai Natural Science Foundation(14ZR1418700)the Shanghai First-class Academic Discipline Project(S1201YLXK)the Hujiang Foundation of China(A14006)the grant S2009/esp-1594 from the Comunidad de Madrid(Spain)the grant MTM2012-36163-C06-06 from the Spanish government
文摘The semi-Lagrangian relaxation （SLR）, a new exactmethod for combinatorial optimization problems with equality constraints,is applied to the quadratic assignment problem （QAP）.A dual ascent algorithm with finite convergence is developed forsolving the semi-Lagrangian dual problem associated to the QAP.We perform computational experiments on 30 moderately difficultQAP instances by using the mixed integer programming solvers,Cplex, and SLR＋Cplex, respectively. The numerical results notonly further illustrate that the SLR and the developed dual ascentalgorithm can be used to solve the QAP reasonably, but also disclosean interesting fact： comparing with solving the unreducedproblem, the reduced oracle problem cannot be always effectivelysolved by using Cplex in terms of the CPU time.
基金supported in part by the China NSFC Grant 61872248Guangdong NSF 2017A030312008+1 种基金Fok Ying-Tong Education Foundation for Young Teachers in the Higher Education Institutions of China (Grant No.161064)GDUPS (2015)
文摘Spectrum management and resource allocation(RA)problems are challenging and critical in a vast number of research areas such as wireless communications and computer networks.The traditional approaches for solving such problems usually consume time and memory,especially for large-size problems.Recently different machine learning approaches have been considered as potential promising techniques for combinatorial optimization problems,especially the generative model of the deep neural networks.In this work,we propose a resource allocation deep autoencoder network,as one of the promising generative models,for enabling spectrum sharing in underlay device-to-device(D2D)communication by solving linear sum assignment problems(LSAPs).Specifically,we investigate the performance of three different architectures for the conditional variational autoencoders(CVAE).The three proposed architecture are the convolutional neural network(CVAECNN)autoencoder,the feed-forward neural network(CVAE-FNN)autoencoder,and the hybrid(H-CVAE)autoencoder.The simulation results show that the proposed approach could be used as a replacement of the conventional RA techniques,such as the Hungarian algorithm,due to its ability to find solutions of LASPs of different sizes with high accuracy and very fast execution time.Moreover,the simulation results reveal that the accuracy of the proposed hybrid autoencoder architecture outperforms the other proposed architectures and the state-of-the-art DNN techniques.
基金supported by the National Natural Science Foundation of China (Nos. 10732100, 10572155)the Science and Technology Planning Project of Guangdong Province of China (No. 2006A11001002)the Ph. D. Programs Foundation of Ministry of Education of China (No. 2006300004111179)
文摘Using a polarization method, the scattering problem for a two-dimensional inclusion embedded in infinite piezoelectric/piezomagnetic matrices is investigated. To achieve the purpose, the polarization method for a two-dimensional piezoelectric/piezomagnetic ＂comparison body＂ is formulated. For simple harmonic motion, kernel of the polarization method reduces to a 2-D time-harmonic Green＇s function, which is obtained using the Radon transform. The expression is further simplified under conditions of low frequency of the incident wave and small diameter of the inclusion. Some analytical expressions are obtained. The analytical solutions for generalized piezoelectric/piezomagnetic anisotropic composites are given followed by simplified results for piezoelectric composites. Based on the latter results, two numerical results are provided for an elliptical cylindrical inclusion in a PZT-5H-matrix, showing the effect of different factors including size, shape, material properties, and piezoelectricity on the scattering cross-section.
基金The research of Gui-Qiang G.Chen was supported in part by the UK Engineering and Physical Sciences Research Council Awards EP/L015811/1,EP/V008854/1,EP/V051121/1the Royal Society-Wolfson Research Merit Award WM090014.
文摘We are concerned with global solutions of multidimensional(M-D)Riemann problems for nonlinear hyperbolic systems of conservation laws,focusing on their global configurations and structures.We present some recent developments in the rigorous analysis of two-dimensional(2-D)Riemann problems involving transonic shock waves through several prototypes of hyperbolic systems of conservation laws and discuss some further M-D Riemann problems and related problems for nonlinear partial differential equations.In particular,we present four different 2-D Riemann problems through these prototypes of hyperbolic systems and show how these Riemann problems can be reformulated/solved as free boundary problems with transonic shock waves as free boundaries for the corresponding nonlinear conservation laws of mixed elliptic-hyperbolic type and related nonlinear partial differential equations.
基金supported by the Specialized Research Fund for the Doctoral Program of Higher Education of China (No. 20070126002)the National Natural Science Foundation of China (No. 10962004)
文摘This paper studies the eigenfunction expansion method to solve the two dimensional （2D） elasticity problems based on the stress formulation. The fundamental system of partial differential equations of the 2D problems is rewritten as an upper tri angular differential system based on the known results, and then the associated upper triangular operator matrix matrix is obtained. By further research, the two simpler com plete orthogonal systems of eigenfunctions in some space are obtained, which belong to the two block operators arising in the operator matrix. Then, a more simple and conve nient general solution to the 2D problem is given by the eigenfunction expansion method. Furthermore, the boundary conditions for the 2D problem, which can be solved by this method, are indicated. Finally, the validity of the obtained results is verified by a specific example.
文摘System reliability optimization problem of multi-source multi-sink flow network is defined by searching the optimal components that maximize the reliability and minimize the total assignment cost. Therefore, a genetic-based approach is proposed to solve the components assignment problem under budget constraint. The mathematical model of the optimization problem is presented and solved by the proposed genetic-based approach. The proposed approach is based on determining the optimal set of lower boundary points that maximize the system reliability such that the total assignment cost does not exceed the specified budget. Finally, to evaluate our approach, we applied it to various network examples with different numbers of available components;two-source two-sink network and three-source two-sink network.
文摘Assignment of jobs to workers, contract to contractors undergoing a bidding process, assigning nurses to duty post, or time tabling for teachers in school and many more have become a growing concern to both management and sector leaders alike. Hungarian algorithm has been the most successful tool for solving such problems. The authors have proposed a heuristic method for solving assignment problems with less computing time in comparison with Hungarian algorithm that gives comparable results with an added advantage of easy implementation. The proposed heuristic method is used to compute some bench mark problems.
文摘In this paper, we discuss a new approach for solving an unbalanced assignment problem. A Lexi-search algorithm is used to assign all the jobs to machines optimally. The results of new approach are compared with existing approaches, and this approach outperforms other methods. Finally, numerical example (Table 1) has been given to show the efficiency of the proposed methodology.
