TOOL USE BASED ON THREE-DIMENSIONAL DATA STRUCTURES IN THE TRANSPORT ASPECT OF THE SYSTEM MUNICIPAL WASTE MANAGEMENT
DOI:
https://doi.org/10.36773/1818-1112-2022-128-2-168-172Keywords:
traveling salesman problem, branch and bound method, Little's algorithm, automation, Visual Basic for ApplicationAbstract
This article discusses how to apply the branch and bound method in the form of Little's algorithm to find the shortest route for a given distance matrix. The authors of the article automated the method in the form of procedures and functions created in the Visual Basic for Application of Microsoft Excel using three-dimensional arrays.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Brest State Technical University
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The work is provided under the terms of Creative Commons public license Attribution-NonCommercial 4.0 International (CC BY-NC 4.0). This license allows an unlimited number of persons to reproduce and share the Licensed Material in all media and formats. Any use of the Licensed Material shall contain an identification of its Creator(s) and must be for non-commercial purposes only. Users may not prevent other individuals from taking any actions allowed by the license.