Revealing a Rational Scheme of Level-By-Level Approximation to the Minimum Route

Starostin N.D.; Shipacheva Е.N.; Zaytsev Ya.A.

doi:10.1051/matecconf/202134603104

MATEC Web of Conferences (Jan 2021)

Revealing a Rational Scheme of Level-By-Level Approximation to the Minimum Route

Starostin N.D.,
Shipacheva Е.N.,
Zaytsev Ya.A.

Affiliations

Starostin N.D.: Ural Federal University named after the first President of Russia B.N. Yeltsin
Shipacheva Е.N.: Ural Federal University named after the first President of Russia B.N. Yeltsin
Zaytsev Ya.A.: Ural Federal University named after the first President of Russia B.N. Yeltsin

DOI: https://doi.org/10.1051/matecconf/202134603104
Journal volume & issue: Vol. 346
p. 03104

Abstract

Read online

For the problem of routing tool movements between processing zones, in a formulation close to the traveling salesman problem, a method for calculating the minimum route, as a rule, leading to an optimum on tests with dimensions of up to 150 zones, is proposed and tested.

Published in MATEC Web of Conferences

ISSN: 2261-236X (Online)
Publisher: EDP Sciences
Country of publisher: France
LCC subjects: Technology: Engineering (General). Civil engineering (General)
Website: http://www.matec-conferences.org

About the journal