首页> 外文会议>Latin American Computer Conference >Heuristics for the Mirrored Tournament Traveling Tournament Problem Based on the Home-Away Swap Neighborhood
【24h】

Heuristics for the Mirrored Tournament Traveling Tournament Problem Based on the Home-Away Swap Neighborhood

机译:基于本土交换街区的镜像锦标赛旅游锦标赛的启发式锦标赛

获取原文

摘要

In this paper we present a detailed experimental analysis of the existing neighborhoods in the literature using a few quality criteria and propose new heuristics for the Mirrored Traveling Tournament Problem. Based on the Home-Away Swap, the proposed heuristics are able to search the solution space from an infeasible solution and obtaining a feasible one in the end. We also describe a estrategy for reduce the amount of visited neighborhoods in the local search process without drastically affect the solution, consequently we managed to obtain feasible solutions with reduced computation time, as shown through empirical analysis.
机译:在本文中,我们对文献中的现有社区进行了详细的实验分析,使用少数质量标准提出了对镜像旅行锦标赛问题的新启发式。基于家庭交换,拟议的启发式能力能够从一个不可行的解决方案搜索解决方案空间并最终获得可行的解决方案。我们还描述了一个eStrategy,用于减少本地搜索过程中访问的社区的数量,而不会大幅影响解决方案,因此我们设法通过经验分析所示获得减少计算时间的可行解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号