Network Models (Shortest Path)

[@kalleramazan3929]

hello, how I can solve shorest path problem with fuzzy flow via linear ranking function ,,please help me ................

[@coverCell]

Hello! I think it gets more complicated when the flow is fuzzy. The algoritm in this video (Dijkstra) is for non-fuzzy flows. However, perhaps you may find a modification to the algorithm (or another algorithm) such that it may handle the fuzzy flows. Good luck!

[@kalleramazan3929]

@@coverCell CAN YOU CONTACT ME PLEASE HELP ME IAM A STUDENT MASTER OF FUZZY

[@harishankarmorkonda5094]

How do u formulate the following problem? 8† A library must build shelving to shelve 200 4-inch high books, 100 8-inch high books, and 80 12-inch high books.Each book is 0.5 inch thick. The library has several ways to store the books. For example, an 8-inch high shelf may be built to store all books of height less than or equal to 8 inches, and a 12-inch high shelf may be built for the 12-inch books. Alternatively, a 12-inch high shelf might be built to store all books. The library believes it costs $2,300 to build a shelf and that a cost of $5 per square inch is incurred for book storage. (Assume that the area required to store a book is given by height of storage area times book’s thickness.) Formulate and solve a shortest-path problem that could be used to help the library determine how to shelve the books at minimum cost. (Hint: Have nodes 0, 4, 8, and 12, with cij being the total cost of shelving all books of height 􏰆 i and 􏰇 j on a single shelf.)

[@coverCell]

Hello! Focus on the hint: the nodes have been provided, so now we need to think about defining the cij and think about the possible arcs (from which node to which node). Good luck!