Solving the Shortest Path Problem with Interval Arcs

  • Authors:
  • Atanu Sengupta;Tapan Kumar Pal

  • Affiliations:
  • Department of Applied Mathematics with Oceanology & Computer Programming, Vidyasagar University, Medinipur, India 721 102;Department of Applied Mathematics with Oceanology & Computer Programming, Vidyasagar University, Medinipur, India 721 102

  • Venue:
  • Fuzzy Optimization and Decision Making
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an algorithm for the shortest path problem when the connected arcs in a transportation network are represented as interval numbers. The methodology proposed in this paper considers fuzzy preference ordering of intervals (Sengupta and Pal (2000), European Journal of Operational Research 127, 28---43) from pessimistic and optimistic decision maker's point of view.