Iteration Multilevel Method for the Travelling Salesman Problem

被引：0
作者：
Starostin, Nikolay V. [1 ]
Klyuev, Ilya V. [1 ]
机构：
[1] Lobachevsky State Univ, Dept Computat Math & Cybernet, Chair Informat & Sci Res Automat, Nizhnii Novgorod, Russia
来源：
KNOWLEDGE-BASED SOFTWARE ENGINEERING, JCKBSE 2014 | 2014年 / 466卷
关键词：
Travelling salesman problem; Iteration method; Multilevel optimization; ALGORITHM;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This document presents iteration multilevel method of solving the travelling salesman problem. The multilevel method reduces graph dimension (reduction phase), searches for a solution with a coarse graph and consistently restores the obtained solution on the source graph (restoration phase). The suggested iteration approach allows to improve the originally obtained cycle through multiple reduction and restoring the problem. The results obtained during testing testify of perspective of this approach.
引用
收藏
页码：477 / 482
页数：6
相关论文
共 13 条
12