Optimal Path on a Multigraph Network Involving Edge Weights of Multiple Parameters

In this paper, we discuss the concept of using multiple parameters to find the optimal path in the multigraph. Multiple parameters indicate the number of parameters used in compiling a network. To be compiled into an edge weight of a multigraph involves converting the parameters into the same quantity without losing meaning. Here, the interval-valued intuitionistic fuzzy approach is used to perform the conversion. We will obtain the optimal multigraph path using a multiple-parameter transportation problem.