Conference proceeding
HEURISTIC PATH SELECTIONS IN OR-GRAPHS WITH APPLICATION TO HAZMAT ROUTING
1994 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS - HUMANS, INFORMATION AND TECHNOLOGY, VOLS 1-3, pp.1536-1540
1994
DOI: 10.1109/ICSMC.1994.400065
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.< >
Details
- Title: Subtitle
- HEURISTIC PATH SELECTIONS IN OR-GRAPHS WITH APPLICATION TO HAZMAT ROUTING
- Creators
- D A NEMBHARDC C WHITE
- Resource Type
- Conference proceeding
- Publication Details
- 1994 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS - HUMANS, INFORMATION AND TECHNOLOGY, VOLS 1-3, pp.1536-1540
- DOI
- 10.1109/ICSMC.1994.400065
- Language
- English
- Date published
- 1994
- Academic Unit
- Business Analytics; Industrial and Systems Engineering
- Record Identifier
- 9984231940002771
Metrics
13 Record Views