Dynamic services selection algorithm in Web services composition supporting cross-enterprises collaboration

Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.

Energy-Saving Scheduling in a Flexible Flow Shop Using a Hybrid Genetic Algorithm

Many researches discussing reduced energy consumption for environmental protection focus on machine efficiency or process redesign. To optimize the machine operation time can also save the energy, and these researches have received great interests in recent years. This study considers three different states of machines, among processing there are two different speeds, to solve the problem of minimizing energy costs under time-of-use tariff with no tardy jobs in flexible flow shop. This problem is basically NP-hard, we proposed a hybrid genetic algorithm (GA) to solve problems in reasonable timeliness. The result shows that to optimize different states of machines under time-of use tariff can reduce energy costs significantly in on-time delivery.

Collaboration Filtering Recommendation Algorithm Based on the Latent Factor Model and Improved Spectral Clustering

Due to the development of E-Commerce, collaboration filtering (CF) recommendation algorithm becomes popular in recent years. It has some limitations such as cold start, data sparseness and low operation efficiency. In this paper, a CF recommendation algorithm is propose based on the latent factor model and improved spectral clustering (CFRALFMISC) to improve the forecasting precision. The latent factor model was firstly adopted to predict the missing score. Then, the cluster validity index was used to determine the number of clusters. Finally, the spectral clustering was improved by using the FCM algorithm to replace the K-means in the spectral clustering. The simulation results show that CFRALFMISC can effectively improve the recommendation precision compared with other algorithms.

Distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm

A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm （NGA） is proposed. By using blackboard-based communication paradigm and shared data structure, multiple decision-makers （DMs） can collaboratively solve the tasks-platforms allocation scheduling problems dynamically through the coordinator. This methodo- logy combined with NGA maximizes tasks execution accuracy, also minimizes the weighted total workload of the DM which is measured in terms of intra-DM and inter-DM coordination. The intra-DM employs an optimization-based scheduling algorithm to match the tasks-platforms assignment request with its own platforms. The inter-DM coordinates the exchange of collaborative request information and platforms among DMs using the blackboard architecture. The numerical result shows that the proposed black- board DM framework based on NGA can obtain a near-optimal solution for the tasks-platforms collaborative planning problem. The assignment of platforms-tasks and the patterns of coordination can achieve a nice trade-off between intra-DM and inter-DM coordination workload.

Collaborative Filtering Algorithms Based on Kendall Correlation in Recommender Systems

In this work, Kendall correlation based collaborative filtering algorithms for the recommender systems are proposed. The Kendall correlation method is used to measure the correlation amongst users by means of considering the relative order of the users＇ ratings. Kendall based algorithm is based upon a more general model and thus could be more widely applied in e-commerce. Another discovery of this work is that the consideration of only positive correlated neighbors in prediction, in both Pearson and Kendall algorithms, achieves higher accuracy than the consideration of all neighbors, with only a small loss of coverage.

Solving flexible job shop scheduling problem by a multi-swarm collaborative genetic algorithm

The flexible job shop scheduling problem(FJSP),which is NP-hard,widely exists in many manufacturing industries.It is very hard to be solved.A multi-swarm collaborative genetic algorithm(MSCGA)based on the collaborative optimization algorithm is proposed for the FJSP.Multi-population structure is used to independently evolve two sub-problems of the FJSP in the MSCGA.Good operators are adopted and designed to ensure this algorithm to achieve a good performance.Some famous FJSP benchmarks are chosen to evaluate the effectiveness of the MSCGA.The adaptability and superiority of the proposed method are demonstrated by comparing with other reported algorithms.

Review Expert Collaborative Recommendation Algorithm Based on Topic Relationship

The project review information plays an important role in the recommendation of review experts. In this paper, we aim to determine review expert's rating by using the historical rating records and the final decision results on the previous projects, and by means of some rules, we construct a rating matrix for projects and experts. For the data sparseness problem of the rating matrix and the 'cold start' problem of new expert recommendation, we assume that those projects/experts with similar topics have similar feature vectors and propose a review expert collaborative recommendation algorithm based on topic relationship. Firstly, we obtain topics of projects/experts based on latent Dirichlet allocation (LDA) model, and build the topic relationship network of projects/experts. Then, through the topic relationship between projects/experts, we find a neighbor collection which shares the largest similarity with target project/expert, and integrate the collection into the collaborative filtering recommendation algorithm based on matrix factorization. Finally, by learning the rating matrix to get feature vectors of the projects and experts, we can predict the ratings that a target project will give candidate review experts, and thus achieve the review expert recommendation. Experiments on real data set show that the proposed method could predict the review expert rating more effectively, and improve the recommendation effect of review experts. © 2014 Chinese Association of Automation.

Feature Selection Method by Applying Parallel Collaborative Evolutionary Genetic Algorithm

Feature selection is one of the important topics in text classification. However, most of existing feature selection methods are serial and inefficient to be applied to massive text data sets. In this case, a feature selection method based on parallel collaborative evolutionary genetic algorithm is presented. The presented method uses genetic algorithm to select feature subsets and takes advantage of parallel collaborative evolution to enhance time efficiency, so it can quickly acquire the feature subsets which are more representative. The experimental results show that, for accuracy ratio and recall ratio, the presented method is better than information gain, x2 statistics, and mutual information methods; the consumed time of the presented method with only one CPU is inferior to that of these three methods, but the presented method is supe rior after using the parallel strategy.

Evaluation and selection of the ship collaborative design resources based on AHP and genetic and simulated annealing algorithm

The characteristics of the design resources in the ship collaborative design is described and the hierarchical model for the evaluation of the design resources is established. The comprehensive evaluation of the co-designers for the collaborative design resources has been done from different aspects using Analytic Hierarchy Process （AHP） ,and according to the evaluation results,the candidates are determined. Meanwhile,based on the principle of minimum cost,and starting from the relations between the design tasks and the corresponding co-designers,the optimizing selection model of the collaborators is established and one novel genetic combined with simulated annealing algorithm is proposed to realize the optimization. It overcomes the defects of the genetic algorithm which may lead to the premature convergenee and local optimization if used individually. Through the application of this method in the ship collaborative design system,it proves the feasibility and provides a quantitative method for the optimizing selection of the design resources.

Recommendation algorithm of cloud computing system based on random walk algorithm and collaborative filtering model

The traditional collaborative filtering recommendation technology has some shortcomings in the large data environment. To solve this problem, a personalized recommendation method based on cloud computing technology is proposed. The large data set and recommendation computation are decomposed into parallel processing on multiple computers. A parallel recommendation engine based on Hadoop open source framework is established, and the effectiveness of the system is validated by learning recommendation on an English training platform. The experimental results show that the scalability of the recommender system can be greatly improved by using cloud computing technology to handle massive data in the cluster. On the basis of the comparison of traditional recommendation algorithms, combined with the advantages of cloud computing, a personalized recommendation system based on cloud computing is proposed.

Research on Parameter Optimization in Collaborative Filtering Algorithm

Collaborative filtering algorithm is the most widely used and recommended algorithm in major e-commerce recommendation systems nowadays. Concerning the problems such as poor adaptability and cold start of traditional collaborative filtering algorithms, this paper is going to come up with improvements and construct a hybrid collaborative filtering algorithm model which will possess excellent scalability. Meanwhile, this paper will also optimize the process based on the parameter selection of genetic algorithm and demonstrate its pseudocode reference so as to provide new ideas and methods for the study of parameter combination optimization in hybrid collaborative filtering algorithm.

Static and dynamic collaborative optimization of ship hull structure

The goal of this effort was to provide a static and dynamic collaborative optimization （CO） model for the design of ship hull structure. The CO model integrated with static, mode and dynamic analyses. In the system-level optimization model, a new objective function was advised, integrating all the subsystem-levels＇ objective functions, so as to eliminate the effects of dimensions and magnitude order. The proposed CO architecture enabled multi-objectives of the system and subsystem-level to be considered at both levels during optimization. A bi-level optimization strategy was advised, using the multi-island genetic algorithm. The proposed model was demonstrated with a deck optimization problem of container ship stern. The analysis progress and results of example show that the CO strategy is not only feasible and reliable, but also well suited for use in actual optimization problems of ship design.

A New Time-Aware Collaborative Filtering Intelligent Recommendation System

Aiming at the problem that the traditional collaborative filtering recommendation algorithm does not fully consider the influence of correlation between projects on recommendation accuracy,this paper introduces project attribute fuzzy matrix,measures the project relevance through fuzzy clustering method,and classifies all project attributes.Then,the weight of the project relevance is introduced in the user similarity calculation,so that the nearest neighbor search is more accurate.In the prediction scoring section,considering the change of user interest with time,it is proposed to use the time weighting function to improve the influence of the time effect of the evaluation,so that the newer evaluation information in the system has a relatively large weight.The experimental results show that the improved algorithm improves the recommendation accuracy and improves the recommendation quality.

Collaborative Simulation Method with Spatiotemporal Synchronization Process Control

When designing a complex mechatronics system, such as high speed trains, it is relatively difficult to effectively simulate the entire system＇s dynamic behaviors because it involves multi-disciplinary subsystems. Currently, a most practical approach for multi-disciplinary simulation is interface based coupling simulation method, but it faces a twofold challenge： spatial and time unsynchronizations among multi-directional coupling simulation of subsystems. A new collaborative simulation method with spatiotemporal synchronization process control is proposed for coupling simulating a given complex mechatronics system across multiple subsystems on different platforms. The method consists of 1） a coupler-based coupling mechanisms to define the interfacing and interaction mechanisms among subsystems, and 2） a simulation process control algorithm to realize the coupling simulation in a spatiotemporal synchronized manner. The test results from a case study show that the proposed method 1） can certainly be used to simulate the sub-systems interactions under different simulation conditions in an engineering system, and 2） effectively supports multi-directional coupling simulation among multi-disciplinary subsystems. This method has been successfully applied in China high speed train design and development processes, demonstrating that it can be applied in a wide range of engineering systems design and simulation with improved efficiency and effectiveness.

An Improved Genetic Algorithm for Berth Scheduling at Bulk Terminal

Berth and loading and unloading machinery are not only the mainfactors that affecting the terminal operation, but also the main starting point ofenergy saving and emission reduction. In this paper, a genetic Algorithm Framework is designed for the berth allocation with low carbon and high efficiency atbulk terminal. In solving the problem, the scheduler’s experience is transformedinto a regular way to obtain the initial solution. The individual is represented as achromosome, and the sub-chromosomes are encoded as integers, the roulettewheel method is used for selection, the two-point crossing method is used forcross, and the exchange variation method is used for variation in the procedureof designing the Algorithm. Considering the complexity of berth schedulingproblem and the diversity of constraints and boundary conditions, the geneticalgorithm combines with system simulation to get the final scheme of berthallocation. This model and algorithm are verified to be practical by analyzingmultiple sets of examples of shorelines with different lengths. When comparedwith the traditional algorithms in three aspects which includes berth offsetdistance, departure delay cost and energy consumption of portal crane, the resultindicates that the improved algorithm is more effective and feasible. The studywill help to lower energy consumption and resource waste, reduce environmentalpollution, and provide a reference for low-carbon, green and sustainable development of the terminal.

WWW COLLABORATIVE RECOMMENDATION BASED ON RELIABILITY

Collaborative filtering recommender systems often suffer from the 'Matchmaker' problem, which comes from the false assumption that users are counted only based on their similarity, and high similarity means good advisers. In order to find good advisers for every user, a matchmaker's reliability mode based on the algorithm deriving from Hits is constructed, and it is applied in the proposed World Wide Web (WWW) collaborative recommendation system. Comparative experimental results also show that our approach obviously improves the substantial performance.

Collaborative production planning between supply chain partners by Lagrangian relaxation

A collaborative planning framework based on the Lagrangian Relaxation was developed to coordinate and optimize the production planning of independent partners in multiple tier supply chains. Linking constraints and dependent demand constraints were added to the monolithic Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP). MLCLSP was Lagrangian relaxed and decomposed into facility-separable subproblems. Surrogate gradient algorithm was used to update Lagrangian multipliers, which coordinate decentralized decisions of the facilities. Production planning of independent partners could be appropriately coordinated and optimized by this framework without intruding their decisionities and private information. Experimental results show that the proposed coordination mechanism and procedure come close to optimal results as obtained by central coordination.

Multi-Knapsack Model of Collaborative Portfolio Configurations in Multi-Strategy Oriented

Aiming at constructing the multi-knapsack model of collaborative portfolio configurations in multi-strategy oriented, the hybrid evolutionary algorithm was designed based on greedy method, combining with the organization of the multiple strategical guidance and multi-knapsack model. Furthermore, the organizing resource utility and risk management of portfolio were considered. The experiments were conducted on three main technological markets which contain communication, transportation and industry. The results demonstrated that the proposed model and algorithm were feasible and reliable.