】This paper proposes an Ant Colony Algorithm based on Heuristic Mutation(ACAHM), combining with the advantage of the traditionalAnt Colony Algorithm(ACA) and the genetic mutation algorithm. ACA is used to find a globally near optimal solution, and then it is optimized bythe heuristic mutation.

基于启发式变异的蚁群算法.pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．