Tang Jia-fu

An optimization framework for reuse component selection in software product line

We tackle the problem that selecting a series of components (simple reuse, build in-house or COTS) to satisfy a set of requirements within a budgetary constraint while maximize quality is becoming more difficult in the requirements phase. We study two main issues, analysis of optimal framework component selection process and survey on the activities of the entire software development in product line. Our search results introduce the framework based on decision variables indicating the set of architectural components to reuse scenario in order to pursue the highest quality while assuring a certain degree of satisfaction of the system requirements with a given cost budget. It also extends the quality properties to the non-functional requirement, such as reliability and delivery time.

Based on low carbon emissions cost model and algorithm for vehicle routing and scheduling in picking up and delivering customers to airport service

The model and algorithm for Vehicle Routing and Scheduling Problem (VRSP) in picking up and delivering customers to airport service were presented in this paper. VRSP is an extension of the class Vehicle Routing Problem (VRP) with more resource constraints. Mathematical models are described for the VRSP with minimizing the cost based on low carbon emissions. The Bi-directional Optimization Heuristic Algorithm (BOHA) is developed for this model. The results verified the effectiveness of the model and Algorithm. The proposed model and algorithm can provide quantitative support and help the air ticket company decision-maker develop economical, punctual shuttle service with high satisfaction.

Cell Management Considering Parts Processed on Machines in Multiple Cells Based on Scatter Search Approach

A cell management problem in cellular manufacturing system considering parts with different routings processed on machines in multiple cells is studied. A nonlinear mathematical programming model of the problem is proposed by minimizing the flow time in a cellular manufacturing system. To solve the problem,a scatter search approach is developed. This scatter search approach improves diversification generator to generate a collection of diverse initial solutions,and develops the reference set update method,subset generation method,solution combination method and improvement method for the cell management problem. Compared with the benchmark optimization software CPLEX on a set of test problems,the simulation results show the effectiveness of the model and the approach.

Combined heuristics for determining order quantity under time-varying demands

Abstract The time-varying demands for a certain period are often assumed to be less than the basic economic order quantity (EOQ) so that total replenishment quantity rather than economic order quantity is normally considered by most of the heuristics. This acticle focuses on a combined heuristics method for determining order quantity under generalized time-varying demands. The independent policy (IP), abnormal independent policy (AIP) and dependent policies are studied and compared. Using the concepts of normal/abnormal periods and the properties of dependent policies, a dependent policy-based heuristics (DPH) is proposed for solving the order quantity problems with a kind of time-varying demands pattern under which the first period is normal. By merging the Silver-Meal (S-M) heuristics and the dependent policy-based heuristics (DPH), a combined heuristics (DPH/S-M) is developed for solving order quantity problems with generalized time-varying demands. The experimentation shows that (1) for the problem with one normal period, no matter which position the normal period stands, the DPH/S-M could not guarantee better than the S-M heuristics, however it is superior to the S-M heuristics in the case that the demands in the abnormal periods are in descending order, and (2) The DPH/S-M is superior to the S-M heuristics for problems with more than one normal period, and the more the number of normal periods, the greater the improvements.

The application of data mining in cigarette sensory quality evaluation: An experimental study

To study the effectiveness of classification algorithms in cigarette sensory quality evaluation, chemical components such as total sugar, protein, potassium, etc. are taken as condition attributes, and ID3, C4.5, rough set, BP neural network, support vector machine, and k-nearest-neighbor are adopted to predict cigarette sensory quality index, such as luster, aroma, harmony, offensive odor, irritation and aftertaste. The experimental results show that harmony reaches the best classification accuracy with about 95%, and the effectiveness of luster and offensive odor are slightly below the harmony with 85%-90% by SVM and KNN, while aroma has the worst result. In addition, offensive odor and aftertaste are fairly accurate with about 70%. As a whole, SVM and KNN have the better performance in the prediction of cigarette sensory quality than the other classification algorithms.

An approach to establish and evaluate pricing business process in electronic commerce

There are a lot of illogical factors in traditional pricing business process, such as low level of information, automation and poor net, which decrease pricing efficiency, especially in electronic commerce. To solve this problem, traditional pricing business process is analyzed, valued and reengineered with a method of business process quantitative analysis based on process algebra. Then a new pricing business process that is suitable for electronic commerce environment is established according to the principles of business process reengineering and the characteristics of pricing in electronic commerce environment. The evaluation criterions before and after process reengineering are investigated, and the results are satisfied. The results verify that the methods are practical.

A nonlinear multi-objective model of dynamic cell formation

The real advantage of dynamic cellular manufacturing system is the ability to operate under dynamic conditions required by todaypsilas production characters of short product life cycle, high production variety, unpredictable demand, and short delivery time, where the product mix and demand in each period is different. This paper addresses dynamic cell formation problem, and presents three major objectives for obtaining successful dynamic cell formation. Meanwhile, a nonlinear multi-objective mathematical model of dynamic cell formation is proposed, and the model comprises utilization rate of machines capacity, number of exceptional parts and other practical problems. The proposed model is verified by the commercial solver CPLEX software under a modest instance and computational results are reported.

Dynamic pricing model of digital knowledge commodity considering competition from congener commodity

The distinctive characteristics of digital knowledge commodity (DKC) make its pricing method different from traditional commoditypsilas. One hand, cost characteristic of DKC gives us more price choices. On the other hand, characteristics else of DKC bring us more difficulties to price. To solve this problem, the first-degree price discrimination is adopted, with respect to the stage in which the on-line sellerpsilas sale number does not exceed critical sale number. Then dynamic pricing model considering competition from congener commodity is built, in which commodity copyright cost, advertisement cost, competitorpsilas price, customerpsilas expectation of commodity and customer behavior are considered, for the sake of maximizing the sale and the profit of an on-line seller. In customer behavior model, the positive exterior influence of Web on customer purchase behavior is considered, and the influence of commodity brand, history sale number and price are quantized.

First-order contiguity constraint on Traffic Analysis Zone delineation problem

This paper presents a kind of constraint to ensure first-order contiguity of Traffic Analysis Zone delineation problem. Based on k-median facility location model, a 0-1 integer programming mathematical presentation of the problem, with objective of minimizing heterogeneity, is given. The proposed model is compared with other three ones in terms of model complexity and time consuming. The other three models have the characteristics of ensuring not only the first-order contiguity. It is concluded from the comparison that if zone number is smaller than certain value, the proposed model terminated without a feasible solution. Otherwise, the proposed model could obtain a satisfied solution within a reasonable time. An agglomerative hierarchical clustering based heuristic algorithm then is developed to deal with the non-solution situation. Finally, a case study shows the advantage of the proposed model for solving large scale problem.

A management platform for testing benchmarking and algorithm in weighted vehicle routing problems

So as to meet the demand of real-world cargo transportation problem, the loading weight of vehicles is brought into the objective function of traditional Vehicle Routing Problem (VRP), which creates the weighted VRP (WVRP). The WVRP Benchmark and Algorithm Management System in this paper, provide a substantial platform for data management, including both WVRP instances and algorithms. Most importantly, the implementation of the system enables the integration of WVRP instances and related algorithms, which can further test the effectiveness of WVRP algorithms and may prove the benefits of WVRP modeling in later research. This paper introduced the structure design and function modules of WVRP Benchmark System, and explained the detailed implement of the system. Specific examples are displayed to prove the system effectiveness. The system provides an instrument and technical support of WVRP research and may in turn be beneficial to WVRPs future study.