To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,...To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.展开更多
The maximal entropy ordered weighted averaging (ME-OWA) operator is used to aggregate metasearch engine results, and its newly analytical solution is also applied. Within the current context of the OWA operator, the...The maximal entropy ordered weighted averaging (ME-OWA) operator is used to aggregate metasearch engine results, and its newly analytical solution is also applied. Within the current context of the OWA operator, the methods for aggregating metasearch engine results are divided into two kinds. One has a unique solution, and the other has multiple solutions. The proposed method not only has crisp weights, but also provides multiple aggregation results for decision makers to choose from. In order to prove the application of the ME-OWA operator method, under the context of aggregating metasearch engine results, an example is given, which shows the results obtained by the ME-OWA operator method and the minimax linear programming ( minimax-LP ) method. Comparison between these two methods are also made. The results show that the ME-OWA operator has nearly the same aggregation results as those of the minimax-LP method.展开更多
The car sequencing problem(CSP)concerns a production sequence of different types of cars in the mixed-model assembly line.A hybrid algorithm is proposed to find an assembly sequence of CSP with minimum violations.Firs...The car sequencing problem(CSP)concerns a production sequence of different types of cars in the mixed-model assembly line.A hybrid algorithm is proposed to find an assembly sequence of CSP with minimum violations.Firstly,the hybrid algorithm is based on the tabu search and large neighborhood search(TLNS),servicing as the framework.Moreover,two components are incorporated into the hybrid algorithm.One is the parallel constructive heuristic(PCH)that is used to construct a set of initial solutions and find some high quality solutions,and the other is the small neighborhood search(SNS)which is designed to improve the new constructed solutions.The computational results show that the proposed hybrid algorithm(PCH+TLNS+SNS)obtains100best known values out of109public instances,among these89instances get their best known values with100%success rate.By comparing with the well-known related algorithms,computational results demonstrate the effectiveness,efficiency and robustness of the proposed algorithm.展开更多
We present the design and performance of a home-built scanning tunneling microscope (STM), which is compact (66 mm tall and 25 mm in diameter), yet equipped with a 3D atomic precision piezoelectric motor in which ...We present the design and performance of a home-built scanning tunneling microscope (STM), which is compact (66 mm tall and 25 mm in diameter), yet equipped with a 3D atomic precision piezoelectric motor in which the Z coarse approach relies on a high simplic-ity friction-type walker (of our own invention) driven by an axially cut piezoelectric tube. The walker is vertically inserted in a piezoelectric scanner tube (PST) with its brim laying at on the PST end as the inertial slider (driven by the PST) for the XZ (sample plane) motion. The STM is designed to be capable of searching rare microscopic targets (defects, dopants, boundaries, nano-devices, etc.) in a macroscopic sample area (square millimeters) under extreme conditions (low temperatures, strong magnetic elds, etc.) in which it ts. It gives good atomic resolution images after scanning a highly oriented pyrolytic graphite sample in air at room temperature.展开更多
In view of the structure and action behavior of mechatronic systems,a method of searching fault propagation paths called maximum-probability path search(MPPS)is proposed,aiming to determine all possible failure propag...In view of the structure and action behavior of mechatronic systems,a method of searching fault propagation paths called maximum-probability path search(MPPS)is proposed,aiming to determine all possible failure propagation paths with their lengths if faults occur.First,the physical structure system,function behavior,and complex network theory are integrated to define a system structural-action network(SSAN).Second,based on the concept of SSAN,two properties of nodes and edges,i.e.,the topological property and reliability property,are combined to define the failure propagation property.Third,the proposed MPPS model provides all fault propagation paths and possible failure rates of nodes on these paths.Finally,numerical experiments have been implemented to show the accuracy and advancement compared with the methods of Function Space Iteration(FSI)and the algorithm of Ant Colony Optimization(ACO).展开更多
Social theorists have engaged religion as a social agent and submitted that it has the capacity to foster positive and negative changes in the society. Milton Yinger, Emile Durkheim, and Karl Marx lead the pack among ...Social theorists have engaged religion as a social agent and submitted that it has the capacity to foster positive and negative changes in the society. Milton Yinger, Emile Durkheim, and Karl Marx lead the pack among other sociologists. The need to therefore interrogate religion as an agent of social engineering cannot be overemphasized normatively and functionally. One of the implications of such engagement is that religion; study and practice need to respond to issues in the society. Basic challenges facing the Nigerian nation are issues of poverty, diseases, corruption, and illiteracy. However, in Nigerian universities, the situation posits that religion is studied with theological intentions based on the curriculum bequeathed by the missionaries that laid the foundation for the academic study of religion in Nigeria leading to exclusive and reductionist approaches to its study. There is also government policy that placed emphasis on science and management courses for development. The situation has led to reduction in students' enrolments for the study of religion in Nigerian universities. Therefore, this paper seeks explanations for the non-functional design(s) of the curriculum for the academic study of religion in universities, southwest of Nigeria. Descriptive and analytic methods were adopted in the study to pursue the thesis that the academic study of religion in Nigeria should be rebranded and repackaged to respond and interrogate social challenges/problems, such as the scourge of HIV/AIDS plaguing the society thereby recreating a new social identity and relevance for its study.展开更多
An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effecti...An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.展开更多
This study analyzes the public relations curricula of 44 American colleges that have a Public Relations (PR) Student Society of America (PRSSA) chapter. Through content analysis, this study examines general requir...This study analyzes the public relations curricula of 44 American colleges that have a Public Relations (PR) Student Society of America (PRSSA) chapter. Through content analysis, this study examines general requirements, core public relations courses, requirements of public relations programs and strategic communication programs, and optional public relations courses offered by the colleges. The findings of this study reveal that very few public relations programs offer courses involving new media, crisis communication, and PR ethics. In order to keep in touch with the fast-changing public relations landscape, more PR programs should require and integrate new media, crisis communication and ethics courses.展开更多
Based on flow loss, a new automatic pipe-routing algorithm is proposed for electromechanical product in 3D space, which consists of pre-processing and optimization search. Utilizing chaos theory, a chaos grid preproce...Based on flow loss, a new automatic pipe-routing algorithm is proposed for electromechanical product in 3D space, which consists of pre-processing and optimization search. Utilizing chaos theory, a chaos grid preprocessing model (CGPM) is established to efficiently pick up the solution space and reduce the search range in the pre-processing, which simplifies the optimization search. A modified particle swarm optimization (PSO) algorithm is presented to seek for an approximate optimal trajectory in the solution space in the optimization search based on standard PSO algorithm and migration characters of people. The comparison of experiments and analysis results shows that the modified PSO algorithm is capable of preventing prematurity effectively and searching for the optimal trajectory more efficiently. Theoretical analysis proves that the modified PSO algorithm converges at global optimum. The examples show that the automatic pipe-routing algorithm based on flow loss is effective and practical for eleetromechanieal product.展开更多
A new chaotic particle swarm algorithm is proposed in order to avoid the premature convergence of the particle swarm optimization and the shortcomings of the chaotic optimization, such as slow searching speed and low ...A new chaotic particle swarm algorithm is proposed in order to avoid the premature convergence of the particle swarm optimization and the shortcomings of the chaotic optimization, such as slow searching speed and low accuracy when used in the multivariable systems or in large search space. The new algorithm combines the particle swarm algorithm and the chaotic optimization, using randomness and ergodicity of chaos to overcome the premature convergence of the particle swarm optimization. At the same time, a new neural network feedback linearization control system is built to control the single-machine infinite-bus system. The network parameters are trained by the chaos particle swarm algorithm, which makes the control achieve optimization and the control law of prime mover output torque obtained. Finally, numerical simulation and practical application validate the effectiveness of the method.展开更多
This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment (TUC) problem in power plant optimization. The mathematical model of the TUC problem is established by a...This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment (TUC) problem in power plant optimization. The mathematical model of the TUC problem is established by analyzing the generating units in modem power plants. A novel immune-tabu hybrid algorithm is proposed to solve this complex problem. In the algorithm, the objective function of the TUC problem is considered as an antigen and the solutions are considered as antibodies, which are determined by the affinity computation. The code length of an antibody is shortened by encoding the continuous operating time, and the optimum searching speed is improved. Each feasible individual in the immune algorithm (IA) is used as the initial solution of the tabu search (TS) algorithm after certain generations of IA iteration. As examples, the proposed method has been applied to several thermal unit systems for a period of 24 h. The computation results demonstrate the good global optimum searching performance of the proposed immune-tabu hybrid algorithm. The presented algorithm can also be used to solve other optimization problems in fields such as the chemical industry and the power industry.展开更多
基金supported by Natural Science Foundation Project of Gansu Provincial Science and Technology Department(No.1506RJZA084)Gansu Provincial Education Department Scientific Research Fund Grant Project(No.1204-13).
文摘To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.
基金The National Natural Science Foundation of China(No.71171048)
文摘The maximal entropy ordered weighted averaging (ME-OWA) operator is used to aggregate metasearch engine results, and its newly analytical solution is also applied. Within the current context of the OWA operator, the methods for aggregating metasearch engine results are divided into two kinds. One has a unique solution, and the other has multiple solutions. The proposed method not only has crisp weights, but also provides multiple aggregation results for decision makers to choose from. In order to prove the application of the ME-OWA operator method, under the context of aggregating metasearch engine results, an example is given, which shows the results obtained by the ME-OWA operator method and the minimax linear programming ( minimax-LP ) method. Comparison between these two methods are also made. The results show that the ME-OWA operator has nearly the same aggregation results as those of the minimax-LP method.
基金Project(51435009) supported by the National Natural Science Foundation of ChinaProject(LQ14E080002) supported by the Zhejiang Provincial Natural Science Foundation of ChinaProject supported by the K.C.Wong Magna Fund in Ningbo University,China
文摘The car sequencing problem(CSP)concerns a production sequence of different types of cars in the mixed-model assembly line.A hybrid algorithm is proposed to find an assembly sequence of CSP with minimum violations.Firstly,the hybrid algorithm is based on the tabu search and large neighborhood search(TLNS),servicing as the framework.Moreover,two components are incorporated into the hybrid algorithm.One is the parallel constructive heuristic(PCH)that is used to construct a set of initial solutions and find some high quality solutions,and the other is the small neighborhood search(SNS)which is designed to improve the new constructed solutions.The computational results show that the proposed hybrid algorithm(PCH+TLNS+SNS)obtains100best known values out of109public instances,among these89instances get their best known values with100%success rate.By comparing with the well-known related algorithms,computational results demonstrate the effectiveness,efficiency and robustness of the proposed algorithm.
文摘We present the design and performance of a home-built scanning tunneling microscope (STM), which is compact (66 mm tall and 25 mm in diameter), yet equipped with a 3D atomic precision piezoelectric motor in which the Z coarse approach relies on a high simplic-ity friction-type walker (of our own invention) driven by an axially cut piezoelectric tube. The walker is vertically inserted in a piezoelectric scanner tube (PST) with its brim laying at on the PST end as the inertial slider (driven by the PST) for the XZ (sample plane) motion. The STM is designed to be capable of searching rare microscopic targets (defects, dopants, boundaries, nano-devices, etc.) in a macroscopic sample area (square millimeters) under extreme conditions (low temperatures, strong magnetic elds, etc.) in which it ts. It gives good atomic resolution images after scanning a highly oriented pyrolytic graphite sample in air at room temperature.
基金Project(2017JBZ103)supported by the Fundamental Research Funds for the Central Universities,China
文摘In view of the structure and action behavior of mechatronic systems,a method of searching fault propagation paths called maximum-probability path search(MPPS)is proposed,aiming to determine all possible failure propagation paths with their lengths if faults occur.First,the physical structure system,function behavior,and complex network theory are integrated to define a system structural-action network(SSAN).Second,based on the concept of SSAN,two properties of nodes and edges,i.e.,the topological property and reliability property,are combined to define the failure propagation property.Third,the proposed MPPS model provides all fault propagation paths and possible failure rates of nodes on these paths.Finally,numerical experiments have been implemented to show the accuracy and advancement compared with the methods of Function Space Iteration(FSI)and the algorithm of Ant Colony Optimization(ACO).
文摘Social theorists have engaged religion as a social agent and submitted that it has the capacity to foster positive and negative changes in the society. Milton Yinger, Emile Durkheim, and Karl Marx lead the pack among other sociologists. The need to therefore interrogate religion as an agent of social engineering cannot be overemphasized normatively and functionally. One of the implications of such engagement is that religion; study and practice need to respond to issues in the society. Basic challenges facing the Nigerian nation are issues of poverty, diseases, corruption, and illiteracy. However, in Nigerian universities, the situation posits that religion is studied with theological intentions based on the curriculum bequeathed by the missionaries that laid the foundation for the academic study of religion in Nigeria leading to exclusive and reductionist approaches to its study. There is also government policy that placed emphasis on science and management courses for development. The situation has led to reduction in students' enrolments for the study of religion in Nigerian universities. Therefore, this paper seeks explanations for the non-functional design(s) of the curriculum for the academic study of religion in universities, southwest of Nigeria. Descriptive and analytic methods were adopted in the study to pursue the thesis that the academic study of religion in Nigeria should be rebranded and repackaged to respond and interrogate social challenges/problems, such as the scourge of HIV/AIDS plaguing the society thereby recreating a new social identity and relevance for its study.
基金Projects(61174040,61104178,61374136) supported by the National Natural Science Foundation of ChinaProject(12JC1403400) supported by Shanghai Commission of Science and Technology,ChinaProject supported by the Fundamental Research Funds for the Central Universities,China
文摘An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.
文摘This study analyzes the public relations curricula of 44 American colleges that have a Public Relations (PR) Student Society of America (PRSSA) chapter. Through content analysis, this study examines general requirements, core public relations courses, requirements of public relations programs and strategic communication programs, and optional public relations courses offered by the colleges. The findings of this study reveal that very few public relations programs offer courses involving new media, crisis communication, and PR ethics. In order to keep in touch with the fast-changing public relations landscape, more PR programs should require and integrate new media, crisis communication and ethics courses.
文摘Based on flow loss, a new automatic pipe-routing algorithm is proposed for electromechanical product in 3D space, which consists of pre-processing and optimization search. Utilizing chaos theory, a chaos grid preprocessing model (CGPM) is established to efficiently pick up the solution space and reduce the search range in the pre-processing, which simplifies the optimization search. A modified particle swarm optimization (PSO) algorithm is presented to seek for an approximate optimal trajectory in the solution space in the optimization search based on standard PSO algorithm and migration characters of people. The comparison of experiments and analysis results shows that the modified PSO algorithm is capable of preventing prematurity effectively and searching for the optimal trajectory more efficiently. Theoretical analysis proves that the modified PSO algorithm converges at global optimum. The examples show that the automatic pipe-routing algorithm based on flow loss is effective and practical for eleetromechanieal product.
基金This work is supported by National Natural Science Foundation of China (50776005).
文摘A new chaotic particle swarm algorithm is proposed in order to avoid the premature convergence of the particle swarm optimization and the shortcomings of the chaotic optimization, such as slow searching speed and low accuracy when used in the multivariable systems or in large search space. The new algorithm combines the particle swarm algorithm and the chaotic optimization, using randomness and ergodicity of chaos to overcome the premature convergence of the particle swarm optimization. At the same time, a new neural network feedback linearization control system is built to control the single-machine infinite-bus system. The network parameters are trained by the chaos particle swarm algorithm, which makes the control achieve optimization and the control law of prime mover output torque obtained. Finally, numerical simulation and practical application validate the effectiveness of the method.
基金Project partially supported by the Lamar Research Enhancement Grant and the National Science Foundation Grant (No. DUE-0737173) to Dr. W. Zhu at Lamar University
文摘This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment (TUC) problem in power plant optimization. The mathematical model of the TUC problem is established by analyzing the generating units in modem power plants. A novel immune-tabu hybrid algorithm is proposed to solve this complex problem. In the algorithm, the objective function of the TUC problem is considered as an antigen and the solutions are considered as antibodies, which are determined by the affinity computation. The code length of an antibody is shortened by encoding the continuous operating time, and the optimum searching speed is improved. Each feasible individual in the immune algorithm (IA) is used as the initial solution of the tabu search (TS) algorithm after certain generations of IA iteration. As examples, the proposed method has been applied to several thermal unit systems for a period of 24 h. The computation results demonstrate the good global optimum searching performance of the proposed immune-tabu hybrid algorithm. The presented algorithm can also be used to solve other optimization problems in fields such as the chemical industry and the power industry.