Applications of Non-Order-Preserving Path Selection of Hazmat Routing

David A. Nembhard and Chelsea C. White
Additional contact information
David A. Nembhard: Department of Management, Auburn University, Auburn, Alabama 36849-5241
Chelsea C. White: Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan 48109-2117

Transportation Science, 1997, vol. 31, issue 3, 262-271

Abstract: In this paper, we consider the problem of determining a path that maximizes a multi-attribute, non-order-preserving value function. The motivating application is the determination of a most preferred path for transporting hazardous materials based on transportation cost and risk to population. A sub-path of an optimal path may not be optimal for a non-order-preserving value function, implying that a traditional application of dynamic programming may intentionally or unintentionally produce sub-optimal paths. We consider two approximation procedures for two general cases, the q = 0 case and the q > 0 case, where q is the number of required intermediate stops between origin and destination. The first approximation procedure involves applying dynamic programming as if a sub-path of an optimal path were always optimal. The second approximation procedure involves determining a linear order-preserving criterion that approximates the non-order-preserving value function and then applying dynamic programming. We use the best-first search algorithm BU* to determine optimal routes for both the q = 0 and q

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.31.3.262 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:31:y:1997:i:3:p:262-271

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().