There is an old saying,“Give a man a fish,and he will eat for a day.Teach a man to fish,and he will eat for the rest of his life.”In clinical teaching,students should not only be taught about diseases,but their inte...There is an old saying,“Give a man a fish,and he will eat for a day.Teach a man to fish,and he will eat for the rest of his life.”In clinical teaching,students should not only be taught about diseases,but their intelligence should also be cultivated,along with their analytical,comprehension,and independent learning skills.The ability to solve problems enables students to think independently and acquire knowledge.This is known as the heuristic method of teaching.In this study,we mainly analyze the application value of the heuristic method in the clinical teaching of internal medicine.展开更多
The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved i...The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper we propose two approaches to attack the hardness of this problem. The first approach is based on genetic algorithms and it yield to good results comparing to another work based also on genetic algorithms. The second approach is based on a new randomized algorithm which we call 'Multiple Impulse Method (MIM)', where the principle is to search codewords locally around the all-zero codeword perturbed by a minimum level of noise, anticipating that the resultant nearest nonzero codewords will most likely contain the minimum Hamming-weight codeword whose Hamming weight is equal to the minimum distance of the linear code.展开更多
A job shop scheduling problem with a combination processing in complex production environment is proposed. Based on the defining of ＂non-elastic combination processing relativity＂ and ＂virtual process＂, the proble...A job shop scheduling problem with a combination processing in complex production environment is proposed. Based on the defining of ＂non-elastic combination processing relativity＂ and ＂virtual process＂, the problem can be simplified and transformed to a traditional one. On the basis of the dispatching rules select engine and considered factors of complex production environment, a heuristic method is designed. The algorithm has been applied to a mould enterprise in Shenzhen for half a year. The practice showed that by using the method suggested the number of delayed orders was decreased about 20% and the productivity was increased by 10 to 20%.展开更多
In this study, Imperialistic Competitive Algorithm（ICA） is utilized for locating the critical failure surface and computing the factor of safety（FOS） in a slope stability analysis based on the limit equilibrium ap...In this study, Imperialistic Competitive Algorithm（ICA） is utilized for locating the critical failure surface and computing the factor of safety（FOS） in a slope stability analysis based on the limit equilibrium approach. The factor of safety relating to each trial slip surface is calculated using a simplified algorithm of the Morgenstern-Price method, which satisfies both the force and the moment equilibriums. General slip surface is considered non-circular in this study that is constituted by linking random straight lines.To explore the performance of the proposed algorithm, four benchmark test problems are analyzed. The results demonstrate that the present techniques can provide reliable, accurate and efficient solutions for locating the critical failure surface and relating FOS. Moreover, in contrast with previous studies the present algorithm could reach the lower value of FOS and reached more exact solutions.展开更多
On the basis of sensitivity analysis, an algorithm presented in this paper does a multi dimensional heuristic search for the optimal solution of complex systems in the feasible intervals of components reliability. Com...On the basis of sensitivity analysis, an algorithm presented in this paper does a multi dimensional heuristic search for the optimal solution of complex systems in the feasible intervals of components reliability. Compared with some existing methods, the algorithm both has heuristic speciality that it is modest and easy to implement, and obtains the optimal solution as exact methods do.展开更多
Software reverse engineering and reengineering techniques are most often applied to reconstruct the software archi-tecture with respect to quality constraints, or non-functional requirements such as maintainability or...Software reverse engineering and reengineering techniques are most often applied to reconstruct the software archi-tecture with respect to quality constraints, or non-functional requirements such as maintainability or reusability. In this paper, the performance improvement of distributed software is modeled as a search problem that is solved by heuristic search algorithms such as genetic search methods. To achieve this, firstly, all aspects of the distributed execution of a software is specified by an analytical performance evaluation function that not only evaluates the current deployment of the software from the performance perspective but also can be applied to propose the near-optimal object deploy-ment for that software. This analytical function is applied as the Heuristic search objective function. In this paper a novel statement reordering method is also presented which is used to generate the search objective function such that the best solution in the search space can be found.展开更多
The study aims to propose using a universal heuristic evaluation model （UHEM） to improve the functional and physical performance of residential buildings. Since, ＂everyone should be able to enter and use any part o...The study aims to propose using a universal heuristic evaluation model （UHEM） to improve the functional and physical performance of residential buildings. Since, ＂everyone should be able to enter and use any part of the built environment as independently and naturally as possible＂, the old buildings should be revitalized with respect to an inclusive approach. However, research on current design practice showed that there is a lack of systematic evaluation and revitalization methods. Hence, the main objective of the proposed UHEM model is to evaluate existing residential environments and requalify them with respect to an inclusive approach. The study concludes by highlighting the importance of UHEM from two points of view： （i） the importance of a systematic evaluation approach to effectively deal with the challenge of requalifying the residential environments and （ii） the designers＇ key role during the revitalization process.展开更多
This paper studies the solution technique to solve the DRAMA spares allocation optimization problem. DRAMA model is an analytic spare optimization model of a multi-item, multi-location, and two-echelon inventory syste...This paper studies the solution technique to solve the DRAMA spares allocation optimization problem. DRAMA model is an analytic spare optimization model of a multi-item, multi-location, and two-echelon inventory system. The computation of its system spares availability is much complicated. The objective function and constraint functions of DRAMA model could be written as the separable forms. A new bound heuristic algorithm has been presented by improving the bound heuristic algorithm for solving the reliability redundancy optimization problem (BHA in short). With the results, the proposed algorithm has been found to be more economical and effective than BHA to obtain the solutions of large DRAMA model. The new algorithm could be used to solve reliability redundancy optimization problems with the separable forms.展开更多
This study examines the multicriteria scheduling problem on a single machine to minimize three criteria: the maximum cost function, denoted by maximum late work (V<sub>max</sub>), maximum tardy job, denote...This study examines the multicriteria scheduling problem on a single machine to minimize three criteria: the maximum cost function, denoted by maximum late work (V<sub>max</sub>), maximum tardy job, denoted by (T<sub>max</sub>), and maximum earliness (E<sub>max</sub>). We propose several algorithms based on types of objectives function to be optimized when dealing with simultaneous minimization problems with and without weight and hierarchical minimization problems. The proposed Algorithm (3) is to find the set of efficient solutions for 1//F (V<sub>max</sub>, T<sub>max</sub>, E<sub>max</sub>) and 1//(V<sub>max</sub> + T<sub>max</sub> + E<sub>max</sub>). The Local Search Heuristic Methods (Descent Method (DM), Simulated Annealing (SA), Genetic Algorithm (GA), and the Tree Type Heuristics Method (TTHM) are applied to solve all suggested problems. Finally, the experimental results of Algorithm (3) are compared with the results of the Branch and Bound (BAB) method for optimal and Pareto optimal solutions for smaller instance sizes and compared to the Local Search Heuristic Methods for large instance sizes. These results ensure the efficiency of Algorithm (3) in a reasonable time.展开更多
针对传统的跳点搜索(jump point search, JPS)算法在移动机器人路径规划时,存在路径拐点以及中间跳点过多,路径规划时间较长等问题,提出了改进的跳点搜索算法I-JPS。I-JPS算法通过改进代价函数、引入叉积公式,来剔除冗余节点、增加机器...针对传统的跳点搜索(jump point search, JPS)算法在移动机器人路径规划时,存在路径拐点以及中间跳点过多,路径规划时间较长等问题,提出了改进的跳点搜索算法I-JPS。I-JPS算法通过改进代价函数、引入叉积公式,来剔除冗余节点、增加机器人与障碍物之间的安全距离。同时引入了动态窗口法(dynamic window approach, DWA)作局部路径规划,用于机器人临时避障和路径平滑化,并通过改进DWA提高多机器人之间的避障优先级。最后引入了多机器人协同路径规划,多机器人可以共同合作并完成复杂的任务,机器人之间还可以共享信息、协调行动,并通过分工合作来解决问题,提高任务的完成效率。最后,实验仿真结果表明改进后的算法相较于改进前的,在各方面都得到了极大的提升。展开更多
文摘There is an old saying,“Give a man a fish,and he will eat for a day.Teach a man to fish,and he will eat for the rest of his life.”In clinical teaching,students should not only be taught about diseases,but their intelligence should also be cultivated,along with their analytical,comprehension,and independent learning skills.The ability to solve problems enables students to think independently and acquire knowledge.This is known as the heuristic method of teaching.In this study,we mainly analyze the application value of the heuristic method in the clinical teaching of internal medicine.
文摘The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper we propose two approaches to attack the hardness of this problem. The first approach is based on genetic algorithms and it yield to good results comparing to another work based also on genetic algorithms. The second approach is based on a new randomized algorithm which we call 'Multiple Impulse Method (MIM)', where the principle is to search codewords locally around the all-zero codeword perturbed by a minimum level of noise, anticipating that the resultant nearest nonzero codewords will most likely contain the minimum Hamming-weight codeword whose Hamming weight is equal to the minimum distance of the linear code.
基金Supported by Research Fund for the Doctoral Program of Higher Education of China(20060487072)National Key Technology R&D Program(2006BAF01A43)
文摘A job shop scheduling problem with a combination processing in complex production environment is proposed. Based on the defining of ＂non-elastic combination processing relativity＂ and ＂virtual process＂, the problem can be simplified and transformed to a traditional one. On the basis of the dispatching rules select engine and considered factors of complex production environment, a heuristic method is designed. The algorithm has been applied to a mould enterprise in Shenzhen for half a year. The practice showed that by using the method suggested the number of delayed orders was decreased about 20% and the productivity was increased by 10 to 20%.
文摘In this study, Imperialistic Competitive Algorithm（ICA） is utilized for locating the critical failure surface and computing the factor of safety（FOS） in a slope stability analysis based on the limit equilibrium approach. The factor of safety relating to each trial slip surface is calculated using a simplified algorithm of the Morgenstern-Price method, which satisfies both the force and the moment equilibriums. General slip surface is considered non-circular in this study that is constituted by linking random straight lines.To explore the performance of the proposed algorithm, four benchmark test problems are analyzed. The results demonstrate that the present techniques can provide reliable, accurate and efficient solutions for locating the critical failure surface and relating FOS. Moreover, in contrast with previous studies the present algorithm could reach the lower value of FOS and reached more exact solutions.
文摘On the basis of sensitivity analysis, an algorithm presented in this paper does a multi dimensional heuristic search for the optimal solution of complex systems in the feasible intervals of components reliability. Compared with some existing methods, the algorithm both has heuristic speciality that it is modest and easy to implement, and obtains the optimal solution as exact methods do.
文摘Software reverse engineering and reengineering techniques are most often applied to reconstruct the software archi-tecture with respect to quality constraints, or non-functional requirements such as maintainability or reusability. In this paper, the performance improvement of distributed software is modeled as a search problem that is solved by heuristic search algorithms such as genetic search methods. To achieve this, firstly, all aspects of the distributed execution of a software is specified by an analytical performance evaluation function that not only evaluates the current deployment of the software from the performance perspective but also can be applied to propose the near-optimal object deploy-ment for that software. This analytical function is applied as the Heuristic search objective function. In this paper a novel statement reordering method is also presented which is used to generate the search objective function such that the best solution in the search space can be found.
文摘The study aims to propose using a universal heuristic evaluation model （UHEM） to improve the functional and physical performance of residential buildings. Since, ＂everyone should be able to enter and use any part of the built environment as independently and naturally as possible＂, the old buildings should be revitalized with respect to an inclusive approach. However, research on current design practice showed that there is a lack of systematic evaluation and revitalization methods. Hence, the main objective of the proposed UHEM model is to evaluate existing residential environments and requalify them with respect to an inclusive approach. The study concludes by highlighting the importance of UHEM from two points of view： （i） the importance of a systematic evaluation approach to effectively deal with the challenge of requalifying the residential environments and （ii） the designers＇ key role during the revitalization process.
文摘This paper studies the solution technique to solve the DRAMA spares allocation optimization problem. DRAMA model is an analytic spare optimization model of a multi-item, multi-location, and two-echelon inventory system. The computation of its system spares availability is much complicated. The objective function and constraint functions of DRAMA model could be written as the separable forms. A new bound heuristic algorithm has been presented by improving the bound heuristic algorithm for solving the reliability redundancy optimization problem (BHA in short). With the results, the proposed algorithm has been found to be more economical and effective than BHA to obtain the solutions of large DRAMA model. The new algorithm could be used to solve reliability redundancy optimization problems with the separable forms.
文摘This study examines the multicriteria scheduling problem on a single machine to minimize three criteria: the maximum cost function, denoted by maximum late work (V<sub>max</sub>), maximum tardy job, denoted by (T<sub>max</sub>), and maximum earliness (E<sub>max</sub>). We propose several algorithms based on types of objectives function to be optimized when dealing with simultaneous minimization problems with and without weight and hierarchical minimization problems. The proposed Algorithm (3) is to find the set of efficient solutions for 1//F (V<sub>max</sub>, T<sub>max</sub>, E<sub>max</sub>) and 1//(V<sub>max</sub> + T<sub>max</sub> + E<sub>max</sub>). The Local Search Heuristic Methods (Descent Method (DM), Simulated Annealing (SA), Genetic Algorithm (GA), and the Tree Type Heuristics Method (TTHM) are applied to solve all suggested problems. Finally, the experimental results of Algorithm (3) are compared with the results of the Branch and Bound (BAB) method for optimal and Pareto optimal solutions for smaller instance sizes and compared to the Local Search Heuristic Methods for large instance sizes. These results ensure the efficiency of Algorithm (3) in a reasonable time.
