Results (2)
Search Parameters:
Keyword: Traveling salesman problemOpen AccessArticle
6 Pages, 828 KB 
Simulated Annealing for Traveling Salesman Problem with Hotel Selection for a Distribution Company Based in Mexico
Abstract:
A distribution company in Mexico covers the travel expenses for 21 sales representatives. Currently, the routes they follow are not established clearly, which can lead to high costs in this subject. A reduction of such cost is sought after, by optimizing the routes for each one of them. The following research finds an improvement on…
Read More(This article belongs to the SP10 (Special Issue on Multidisciplinary Sciences and Engineering 2020-21) & Section Engineering Management (EMM))
Open AccessArticle
14 Pages, 1,361 KB
Strategies of the Level-By-Level Approach to the Minimal Route
Abstract:
The task of optimal path planning for drilling tool with numerical control is considered. Such tools are used in the production of printed circuit boards. The algorithm modification of level-by-level route construction for the approximate solution of the traveling salesman problem is discussed. Bypass objects can be specified either as a table of distances or…
Read More(This article belongs to the SP6 (Special Issue on Recent Advances in Engineering Systems 2018-19) & Section Interdisciplinary Applications of Computer Science (CSI))