Solving the Shortest Path Problem with Interval Arcs

Authors: Sengupta, Atanu; Pal, Tapan

Source: Fuzzy Optimization and Decision Making, Volume 5, Number 1, January 2006 , pp. 71-89(19)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

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.

Keywords: interval arithmetic; order relation; fuzzy preference ordering; shortest path problem; Dijkstra's algorithm

Document Type: Research article

DOI: http://dx.doi.org/10.1007/s10700-005-4916-y

Affiliations: 1: Email: atanu_sgupta@yahoo.co.in

Publication date: 2006-01-01