首页 | 本学科首页   官方微博 | 高级检索  
     检索      


GENI Ants for the Traveling Salesman Problem
Authors:François-Xavier Le Louarn  Michel Gendreau  Jean-Yves Potvin
Institution:1. Centre de recherche sur les transports Département d'informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Québec, Canada, H3C 3J7
Abstract:In this paper, the probabilistic nearest neighbor heuristic, which is at the core of classical ant colony systems for the Traveling Salesman Problem, is replaced by an alternative insertion procedure known as the GENI heuristic. The benefits provided by GENI-based ants are empirically demonstrated on a set of benchmark problems, through a comparison with the classical ant colony system and an iterated GENI heuristic.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号