![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
Abstract
Optimal selection of multiple parallel paths connecting the starting and arrival nodes is considered. The objective is to minimize the length of the longest path among multiple paths. The constraint is that duplication of the nodes belonging to each path is not allowed. The basic idea of the proposed method is to decompose the network into several subnetworks and to obtain the shortest path for each subnetwork. The genetic algorithm is applied for the decomposition procedure. It is observed from numerical results that the proposed method is efficient from the viewpoints of the accuracy of the solution and the computation time