Name
Abstract | ||
|---|---|---|
Given a transportation network, this paper considers the problem of finding a number of spatially dissimilar paths between an origin and a destination. A number of dissimilar paths can be useful in solving capacitated flow problems or in selecting routes for hazardous materials. A critical discussion of three existing methods for the generation of spatially dissimilar paths is offered, and computational experience using these methods is reported. As an alternative method, the generation of a large set of candidate paths, and the selection of a subset using a dispersion model which maximizes the minimum dissimilarity in the selected subset is proposed. Computational results with this method are encouraging. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0377-2217(99)00214-3 | European Journal of Operational Research |
Keywords | Field | DocType |
Transportation planning,Path selection,Dangerous goods,Heuristics,Risk management | Flow network,Dangerous goods,Mathematical optimization,Risk management,Heuristics,Transportation planning,Hazardous waste,Operations management,Mathematics | Journal |
Volume | Issue | ISSN |
121 | 2 | 0377-2217 |
Citations | PageRank | References |
53 | 2.77 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vedat Akgün | 1 | 62 | 3.39 |
| Erhan Erkut | 2 | 692 | 47.66 |
| Rajan Batta | 3 | 849 | 89.39 |