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:
| Autores principales: | , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN FR |
| Publicado: |
EDP Sciences
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/712c890c49d745f396539f0ad80e0273 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | 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. |
|---|