{"title":"Problems on Shortest k-Node Cycles and Paths","authors":"P. Stetsyuk, Dumitru Solomon, Maria Grygorak","doi":"10.34229/2707-451x.21.3.2","DOIUrl":null,"url":null,"abstract":"The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph. Such cycles and paths are called k-node, where 1<k <n, n is the number of nodes in the graph.\nSection 1 formulates two problems for finding the shortest k-node cycle – a mixed Boolean and linear programming problem and a discrete programming problem. Both problems include constraints from the classical assignment problem, describing a one-time entry into a node and a one-time exit from a node for those nodes through which the cycle passes. The cycle connectivity in the first problem is ensured by modeling the flow problem, and in the second problem, it is ensured by using the A. Tucker constraints for the travelling salesman problem. \nSection 2 establishes a connection between the formulations of both problems from Section 1 and the travelling salesman problem and investigates the efficiency of their solution using modern versions of gurobi and cplex programs and the AMPL modeling language.\nSection 3 contains the formulation of the shortest k-node path problem, which is represented by a mixed Boolean and linear programming problem. With its help, the optimal routes were found for visiting the wine-making points of the Malopolskie Wine Route in the direction Lviv-Wroclaw-Lviv (Section 4). Here a map for the 20 most visited wine-making points of the Malopolskie Wine Route and a table of the distances between them and the distances from them to Lviv and Wroclaw, calculated using the Google Maps web service, are presented.\nThe developed mathematical models of the problems of finding the shortest k-node paths and cycles and the developed software in the AMPL modeling language can be used for the design and arrangement of technical objects, optimization of the transportation of products, analysis and forecasting of economic processes, determination of optimal routes when planning passenger and freight traffic, optimal organization of the process of managing a set of transactions and queries during their implementation in network databases and other classes of applied optimization problems. Keywords: digraph, shortest path, Boolean variable, linear programming, Hamiltonian cycle, Hamiltonian path, travelling salesman problem, AMPL, gurobi, cplex.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kibernetika ta kompiuterni tekhnologiyi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34229/2707-451x.21.3.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph. Such cycles and paths are called k-node, where 1
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
