Posts Tagged ‘Combinatorial optimization’:

Based on Particle Swarm Alorithm System Identification Methods Research and Simulation

Based on the modern industrial process, scholars have proposed many advanced control technologies, but most of the modern technologies are based on exact objects mathematical model. System identification is a kind of effective method to establish a mathematical model of the process object. At present, we already have perfect and mature traditional identification methods. At

(Read More…)

The Appling Research of University Course Scheduling Problem Based on Genetic Algorithms

The course scheduling problem is a most basic but also the largest workload and mosttedious task in the university’s teaching mission management. With the expansion of theUniversity scale,both the number of professional and student are rapid increased.If you arestill going to schedule by human in the case of a limited teaching resources,not only thepressure increases,but

(Read More…)

The Appling Research of University Course Scheduling Problem Based on Genetic Algorithms

The course scheduling problem is a most basic but also the largest workload and mosttedious task in the university’s teaching mission management. With the expansion of theUniversity scale,both the number of professional and student are rapid increased.If you arestill going to schedule by human in the case of a limited teaching resources,not only thepressure increases,but

(Read More…)

Research for the Train Operation Regulation of CBTC System Based on Ant Colony Optimization Algorithm

The urban rail transportation is taking more and more important role on releasing the urban traffic pressure. There are lots of advantages than other vehicles such as heavy capacity, fast speed, safety and less disturb. Generally, the train operation complies with the arranged timetable strictly. While, for some random reasons, it is hard to avoid

(Read More…)

Optimization Research Based on Genetic Algorithm

Researchers have been highly interested in heuristic algorithms since the 1960s. And these algorithms used to solve complicated optimization problems are inspired from natural evolution. Genetic algorithms, which have strong abilities of optimization and stochastic searching, are widely used in industry and engineering and have great impact on these practical fields.Traveling salesman problem(TSP) which is

(Read More…)

Optimization Research Based on Genetic Algorithm

Researchers have been highly interested in heuristic algorithms since the 1960s. And these algorithms used to solve complicated optimization problems are inspired from natural evolution. Genetic algorithms, which have strong abilities of optimization and stochastic searching, are widely used in industry and engineering and have great impact on these practical fields.Traveling salesman problem(TSP) which is

(Read More…)

An Improved Ant Colony Algorithm for Shortest Path

The shortest path problem (SP) is one of the classical optimal problems, so it has been widely studied for last semicentury. The shortest path problem is to find a path of two points with the minimum total weight. At present, the exact algorithm of SP has been perfect, while with the rapid development of information

(Read More…)

An Improved Ant Colony Algorithm for Shortest Path

The shortest path problem (SP) is one of the classical optimal problems, so it has been widely studied for last semicentury. The shortest path problem is to find a path of two points with the minimum total weight. At present, the exact algorithm of SP has been perfect, while with the rapid development of information

(Read More…)

An Improved Ant Colony Algorithm for Shortest Path

The shortest path problem (SP) is one of the classical optimal problems, so it has been widely studied for last semicentury. The shortest path problem is to find a path of two points with the minimum total weight. At present, the exact algorithm of SP has been perfect, while with the rapid development of information

(Read More…)

An Improved Ant Colony Algorithm for Shortest Path

The shortest path problem (SP) is one of the classical optimal problems, so it has been widely studied for last semicentury. The shortest path problem is to find a path of two points with the minimum total weight. At present, the exact algorithm of SP has been perfect, while with the rapid development of information

(Read More…)

© IT Research Paper