{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T20:49:23Z","timestamp":1761252563709},"reference-count":0,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Transportation Science"],"published-print":{"date-parts":[[1997,8]]},"abstract":"<jats:p> 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 &gt; 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 &lt; 0 cases. We examine the frequency and magnitude of the resulting sub-optimalities for a multi-attribute value model based on a six-county road network that includes Cleveland, Ohio. Numerical results show that if one of the two approximations is used, significant sub-optimalities can occur over a wide range of decision maker preferences. Both approximations can produce sub-optimality error magnitudes of over 50%. <\/jats:p>","DOI":"10.1287\/trsc.31.3.262","type":"journal-article","created":{"date-parts":[[2008,10,31]],"date-time":"2008-10-31T22:50:20Z","timestamp":1225493420000},"page":"262-271","source":"Crossref","is-referenced-by-count":15,"title":["Applications of Non-Order-Preserving Path Selection of Hazmat Routing"],"prefix":"10.1287","volume":"31","author":[{"given":"David A.","family":"Nembhard","sequence":"first","affiliation":[{"name":"Department of Management, Auburn University, Auburn, Alabama 36849-5241"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"Chelsea C.","family":"White","sequence":"additional","affiliation":[{"name":"Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan 48109-2117"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"109","container-title":["Transportation Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/pubsonline.informs.org\/doi\/pdf\/10.1287\/trsc.31.3.262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T21:13:27Z","timestamp":1680470007000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/pubsonline.informs.org\/doi\/10.1287\/trsc.31.3.262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["10.1287\/trsc.31.3.262"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1287\/trsc.31.3.262","relation":{},"ISSN":["0041-1655","1526-5447"],"issn-type":[{"value":"0041-1655","type":"print"},{"value":"1526-5447","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}