Title :
Heuristic path selection in OR-graphs with application to HAZMAT routing
Author :
Nembhard, David A. ; White, Chelsea C., III
Author_Institution :
Dept. of Ind. & Oper. Eng., Michigan Univ., Ann Arbor, MI, USA
Abstract :
Considers the problem of path selection for a generalized HAZMAT routing problem where there are multiple destinations and where there are multiple and nonseparable objectives. This problem may be modeled as an OR-graph where the authors assume that arc cost estimates are given but actual arc cost determination requires some computational effort. To solve this problem the authors use two related algorithms, BU* and DU*, which are guaranteed to terminate with the optimal path given an admissible heuristic set. Computational results indicate that the algorithms´ graph-pruning power significantly reduces both the number of arc cost determination steps and node expansion steps
Keywords :
graph theory; transportation; BU*; DU*; HAZMAT routing; OR-graph; OR-graphs; arc cost; graph-pruning power; heuristic path selection; Artificial intelligence; Computational efficiency; Computer industry; Cost function; Costs; Hazardous materials; Heuristic algorithms; Routing; Shipbuilding industry; Traveling salesman problems; Vehicles;
Conference_Titel :
Systems, Man, and Cybernetics, 1994. Humans, Information and Technology., 1994 IEEE International Conference on
Conference_Location :
San Antonio, TX
Print_ISBN :
0-7803-2129-4
DOI :
10.1109/ICSMC.1994.400065