Hongquan Xue

  • Citations Per Year
Learn More
The traveling salesman problem (TSP) is a wellknown NP-hard problem and extensively studied problems in combinatorial optimization. Ant colony optimization algorithm (ACOA) has been used to solve many optimization problems in various fields of engineering. In this paper, a new algorithm was presented for solving TSP using ACOA based on immunity and multiple(More)
Flexible job-shop scheduling problem derived from the job-shop scheduling problem, and is more realistic than the job-shop scheduling problem in the manufacturing enterprise. It should be utilized with high efficiency. But it is a multi-objective optimal problem. Three minimization objectives (Maximum completion time (makespan), Total workload of machines(More)
  • 1