The constraints and the operations play an important role in database generalization.They guide and govern database generalization.The constraints are translation of the required conditions that should take into accou...The constraints and the operations play an important role in database generalization.They guide and govern database generalization.The constraints are translation of the required conditions that should take into account not only the objects and relationships among objects but also spatial data schema (classification and aggregation hierarchy) associated with the final existing database.The operations perform the actions of generalization in support of data reduction in the database.The constraints in database generalization are still lack of research.There is still the lack of frameworks to express the constraints and the operations on the basis of object_oriented data structure in database generalization.This paper focuses on the frameworks for generalization operations and constraints on the basis of object_oriented data structure in database generalization.The constraints as the attributes of the object and the operations as the methods of the object can be encapsulated in classes.They have the inheritance and polymorphism property.So the framework of the constraints and the operations which are based on object_oriented data structure can be easily understood and implemented.The constraint and the operations based on object_oriented database are proposed based on object_oriented database.The frameworks for generalization operations,constraints and relations among objects based on object_oriented data structure in database generalization are designed.The categorical database generalization is concentrated on in this paper.展开更多
The Object-Attribute-Relationship(OAR)model provides a single model tocapture data structure,behavior properties and knowledge rules in the CAPP application.This paper focuses on how to integrate a variety of differen...The Object-Attribute-Relationship(OAR)model provides a single model tocapture data structure,behavior properties and knowledge rules in the CAPP application.This paper focuses on how to integrate a variety of different knowledge rules into the OARmodel and how to form transactions against the data structure with these rules in order toimplement intelligent process planning for designed components.The mapping from theOAR to Smalltalk can be directly carried out.It makes the implementation an entirely Ob-ject-Oriented approach.展开更多
In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty fu...In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a Pareto efficient solution (or a weakly-efficient solution) to UPOP is proved to be a Pareto efficient solution (or a weakly-efficient solution) to MP. The penalty function is proved to be exact under a stable condition. Then, we design an algorithm to solve MP and prove its convergence. Finally, numerical examples show that the algorithm may help decision makers to find a satisfactory solution to MP.展开更多
Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop sch...Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop scheduling problem (JSSP)describe the basic production environment, which have a single objective and limited constraints. However,a practical process of production is characterized by having multiple objectives,no-wait constraint,and limited storage. Thus this research focused on multiobjective,no-wait JSSP. To analyze the problem,it was further divided into two sub-problems, namely, sequencing and timetabling. Hybrid non-order strategy and modified complete local search with memory were used to solve each problem individually. A Pareto-based strategy for performing fitness assessment was presented in this study. Various experiments on benchmark problems proved the feasibility and effectiveness of the proposed algorithm.展开更多
In this paper we discuss about infeasibility diagnosis and infeasibility resolution, when the constraint method is used for solving multi objective linear programming problems. We propose an algorithm for resolution o...In this paper we discuss about infeasibility diagnosis and infeasibility resolution, when the constraint method is used for solving multi objective linear programming problems. We propose an algorithm for resolution of infeasibility, which is a combination of interactive, weighting and constraint methods.Numerical examples are provided to illustrate the techniques developed.展开更多
文摘The constraints and the operations play an important role in database generalization.They guide and govern database generalization.The constraints are translation of the required conditions that should take into account not only the objects and relationships among objects but also spatial data schema (classification and aggregation hierarchy) associated with the final existing database.The operations perform the actions of generalization in support of data reduction in the database.The constraints in database generalization are still lack of research.There is still the lack of frameworks to express the constraints and the operations on the basis of object_oriented data structure in database generalization.This paper focuses on the frameworks for generalization operations and constraints on the basis of object_oriented data structure in database generalization.The constraints as the attributes of the object and the operations as the methods of the object can be encapsulated in classes.They have the inheritance and polymorphism property.So the framework of the constraints and the operations which are based on object_oriented data structure can be easily understood and implemented.The constraint and the operations based on object_oriented database are proposed based on object_oriented database.The frameworks for generalization operations,constraints and relations among objects based on object_oriented data structure in database generalization are designed.The categorical database generalization is concentrated on in this paper.
文摘The Object-Attribute-Relationship(OAR)model provides a single model tocapture data structure,behavior properties and knowledge rules in the CAPP application.This paper focuses on how to integrate a variety of different knowledge rules into the OARmodel and how to form transactions against the data structure with these rules in order toimplement intelligent process planning for designed components.The mapping from theOAR to Smalltalk can be directly carried out.It makes the implementation an entirely Ob-ject-Oriented approach.
文摘In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a Pareto efficient solution (or a weakly-efficient solution) to UPOP is proved to be a Pareto efficient solution (or a weakly-efficient solution) to MP. The penalty function is proved to be exact under a stable condition. Then, we design an algorithm to solve MP and prove its convergence. Finally, numerical examples show that the algorithm may help decision makers to find a satisfactory solution to MP.
基金National Natural Science Foundations of China(Nos.61174040,61573144,11304200)Shanghai Commission of Science and Technology,China(No.12JC1403400)+1 种基金Shanghai Municipal Education Commission for Training Young Teachers,China(No.ZZSDJ15031)Shanghai Teaching and Reforming Experimental Undergraduate Majors Construction Program,China
文摘Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop scheduling problem (JSSP)describe the basic production environment, which have a single objective and limited constraints. However,a practical process of production is characterized by having multiple objectives,no-wait constraint,and limited storage. Thus this research focused on multiobjective,no-wait JSSP. To analyze the problem,it was further divided into two sub-problems, namely, sequencing and timetabling. Hybrid non-order strategy and modified complete local search with memory were used to solve each problem individually. A Pareto-based strategy for performing fitness assessment was presented in this study. Various experiments on benchmark problems proved the feasibility and effectiveness of the proposed algorithm.
文摘In this paper we discuss about infeasibility diagnosis and infeasibility resolution, when the constraint method is used for solving multi objective linear programming problems. We propose an algorithm for resolution of infeasibility, which is a combination of interactive, weighting and constraint methods.Numerical examples are provided to illustrate the techniques developed.
