A5031875001- Advanced Computational Techniques and Applications
- Rough Sets and Fuzzy Logic
- Advanced Manufacturing and Logistics Optimization
- Environmental and Agricultural Sciences
- Advanced Decision-Making Techniques
- Vehicle Routing Optimization Methods
- Advanced Control Systems Optimization
- Evaluation and Optimization Models
- Metaheuristic Optimization Algorithms Research
- Advanced Algorithms and Applications
- Scheduling and Optimization Algorithms
- Fault Detection and Control Systems
- Computer Graphics and Visualization Techniques
- Environmental Quality and Pollution
- Safety and Risk Management
- Extenics and Innovation Methods
- Industrial Vision Systems and Defect Detection
- Research studies in Vietnam
- Spam and Phishing Detection
- Simulation and Modeling Applications
- Optimization and Packing Problems
- Risk and Portfolio Optimization
- Environmental Changes in China
- Advanced Statistical Process Monitoring
- Water resources management and optimization
China Jiliang University
2023
Shanghai University
2013-2017
Dalian Maritime University
2011-2013
Guangxi University
2009-2012
Research Center for Eco-Environmental Sciences
2011
Chinese Academy of Sciences
2011
University of Science and Technology of China
2009
Yangzhou University
2005-2007
In this paper, we develop an algorithm that is able to quickly obtain optimal solution TSP from a huge search space. This based upon the use of Genetic Algorithm techniques. The employs roulette wheel selection mechanism, survival-of-the-fittest strategy, heuristic crossover operator, and inversion operator. To illustrate it more clearly, program on has been implemented, which presents changing process route iteration in intuitive way. Finally, apply into problem with fifty cities. By...
Traveling salesman problem, a very famous NP-hard has attracted lot of attention in recent years. People focus on how to quickly get the optimal solution. In this paper, we first give basic description TSP, and then introduce main idea mechanisms ant colony algorithm detail. After that, paper makes further discussion steps principles application TSP. Finally, illustrate it more clearly, program based been implemented. Through experiments result graphics, is clearly showed that can...
In order to solve the total-path-shortest Multiple Traveling Salesman Problem (MTSP), an improved grouping genetic algorithm is proposed. This employs a new encoding scheme called ordered encoding, which makes adjusted individuals corresponding one by valid solutions of MTSP. According features scheme, fast crossover operator constructed for sake reducing running time algorithm. For enhancing its local search ability, combines greedy and 2-opt design operator. The comparison results shows...
According to the discernibility function constructed by matrix, in this paper a new method is proposed that can be easily understood and programmed get minimal disjunctive normal form item item. This proved theorems approach certainly all of reductions. An example shows correct valid. The adapts dynamic information system with objects gradually increasing.
Multiobjective optimization problems (MOPs) are prevalent in machine learning, with applications multi-task learning under fairness or robustness constraints, etc. Instead of reducing multiple objective functions into a scalar objective, MOPs aim to optimize for the so-called Pareto optimality set which involves optimizing more than one function simultaneously, over models thousands / millions parameters. Existing benchmark libraries mainly focus on evolutionary algorithms, most zeroth-order...
A control chart pattern recognition method based on transfer learning and SVM is proposed for the problem of differences in distribution energy meter batch data meters. Small-scale used to achieve compensation value voltage gaining with different distributions according ISO7870-2:2013 Control charts-Part 2: Shewhart charts. large amount from related fields effectively included training process through migration learning. The learning-based classification algorithm mainly consists two...
This paper discusses a single-machine scheduling problem with uncertain processing times, which are described by scenario approach. A new robust optimization model is built based on the concept of bad-scenario set. The objective aims to minimize performance deviation compared corresponding optimal solution. To obtain solution problem, branch and bound algorithm developed, pruning rule method getting upper lower values designed. large number instances were tested, computational results...
In interval-valued information system, the rough entropy to Multi granularity set is presented , quality of described by dominance relation, Condition raised discuss nature, example used analysis specific.