2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017, pages 270-275

Algorithm modification of the level-by-level approximation to the minimum route

Starostin N.D.
Publication typeProceedings Article
Publication date2017-12-01
Abstract
The algorithm modification of level-by-level route construction for the approximate solution of the traveling salesman problem is dicussed. Bypass objects can be specified either as a table of distances or values represented by a symmetric matrix, or as Cartesian coordinates (in applied cases of using CNC equipment). The algorithm was tested on many different examples. As a result of the calculations performed for examples from the TSPLIB library (defined through a full distance matrix or Cartesian coordinates) with a dimension of up to 100 cities, the ability of the algorithm to construct the optimal route was confirmed. For examples from other sources or for artificially constructed ones (up to 130 objects), in the testing of the algorithm, the declared record values of the route minimum length were also achieved or improved.

Citations by journals

1
Advances in Science, Technology and Engineering Systems, 1, 50%
Advances in Science, Technology and Engineering Systems
1 publication, 50%
MATEC Web of Conferences
MATEC Web of Conferences, 1, 50%
MATEC Web of Conferences
1 publication, 50%
1

Citations by publishers

1
ASTES Publishers, 1, 50%
ASTES Publishers
1 publication, 50%
EDP Sciences
EDP Sciences, 1, 50%
EDP Sciences
1 publication, 50%
1
  • We do not take into account publications that without a DOI.
  • Statistics recalculated only for publications connected to researchers, organizations and labs registered on the platform.
  • Statistics recalculated weekly.
Metrics
Share
Cite this
GOST |
Cite this
GOST Copy
Starostin N., Mironov K. V. Algorithm modification of the level-by-level approximation to the minimum route // 2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017. 2017. pp. 270-275.
GOST all authors (up to 50) Copy
Starostin N., Mironov K. V. Algorithm modification of the level-by-level approximation to the minimum route // 2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017. 2017. pp. 270-275.
RIS |
Cite this
RIS Copy
TY - CPAPER
DO - 10.1109/ISSPIT.2017.8388654
UR - https://doi.org/10.1109%2FISSPIT.2017.8388654
TI - Algorithm modification of the level-by-level approximation to the minimum route
T2 - 2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017
AU - Starostin, N.D.
AU - Mironov, K. V.
PY - 2017
DA - 2017/12/01 00:00:00
SP - 270-275
ER -
BibTex
Cite this
BibTex Copy
@inproceedings{2017_Starostin
author = {N.D. Starostin and K. V. Mironov},
title = {Algorithm modification of the level-by-level approximation to the minimum route},
year = {2017},
pages = {270--275},
month = {dec}
}
Found error?