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

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.

Guardado en:

Detalles Bibliográficos
Autores principales:	Starostin N.D., Shipacheva Е.N., Zaytsev Ya.A.
Formato:	article
Lenguaje:	EN FR
Publicado:	EDP Sciences 2021
Materias:	Engineering (General). Civil engineering (General) TA1-2040
Acceso en línea:	https://doaj.org/article/712c890c49d745f396539f0ad80e0273
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:712c890c49d745f396539f0ad80e0273
record_format	dspace
spelling	oai:doaj.org-article:712c890c49d745f396539f0ad80e02732021-11-08T15:20:44ZRevealing a Rational Scheme of Level-By-Level Approximation to the Minimum Route2261-236X10.1051/matecconf/202134603104https://doaj.org/article/712c890c49d745f396539f0ad80e02732021-01-01T00:00:00Zhttps://www.matec-conferences.org/articles/matecconf/pdf/2021/15/matecconf_icmtmte2021_03104.pdfhttps://doaj.org/toc/2261-236XFor 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.Starostin N.D.Shipacheva Е.N.Zaytsev Ya.A.EDP SciencesarticleEngineering (General). Civil engineering (General)TA1-2040ENFRMATEC Web of Conferences, Vol 346, p 03104 (2021)
institution	DOAJ
collection	DOAJ
language	EN FR
topic	Engineering (General). Civil engineering (General) TA1-2040
spellingShingle	Engineering (General). Civil engineering (General) TA1-2040 Starostin N.D. Shipacheva Е.N. Zaytsev Ya.A. Revealing a Rational Scheme of Level-By-Level Approximation to the Minimum Route
description	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.
format	article
author	Starostin N.D. Shipacheva Е.N. Zaytsev Ya.A.
author_facet	Starostin N.D. Shipacheva Е.N. Zaytsev Ya.A.
author_sort	Starostin N.D.
title	Revealing a Rational Scheme of Level-By-Level Approximation to the Minimum Route
title_short	Revealing a Rational Scheme of Level-By-Level Approximation to the Minimum Route
title_full	Revealing a Rational Scheme of Level-By-Level Approximation to the Minimum Route
title_fullStr	Revealing a Rational Scheme of Level-By-Level Approximation to the Minimum Route
title_full_unstemmed	Revealing a Rational Scheme of Level-By-Level Approximation to the Minimum Route
title_sort	revealing a rational scheme of level-by-level approximation to the minimum route
publisher	EDP Sciences
publishDate	2021
url	https://doaj.org/article/712c890c49d745f396539f0ad80e0273
work_keys_str_mv	AT starostinnd revealingarationalschemeoflevelbylevelapproximationtotheminimumroute AT shipachevaen revealingarationalschemeoflevelbylevelapproximationtotheminimumroute AT zaytsevyaa revealingarationalschemeoflevelbylevelapproximationtotheminimumroute
_version_	1718441760872464384

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

Ejemplares similares