### Abstract

This paper is concerned about the problem of locating a path for a shipment of dangerous goods between a pre-specified origin-destination pair on the plane. Minimization of risks during the transportation and cost of the path have been taken into account. The formulation of the main problem considered in this paper is the following: Given a source point a, a destination point b, a set S of demand sites (points in the plane) and a positive value l, we want to compute a path connecting a and b with length at most l such that the minimum distance to the points in S is maximized. We propose an approximate algorithm based on the bisection method to solve this problem. Our technique reduces the optimization problem to a decision problem, where one needs to compute the shortest path such that the minimum distance to the demand points is not smaller that a certain amount r. To solve the decision task, we transform the problem to the computation of the shortest path avoiding obstacles. This approach provides efficient algorithms to compute shortest obnoxious paths under several kinds of distances.

Original language | English (US) |
---|---|

Pages (from-to) | 293-298 |

Number of pages | 6 |

Journal | Journal of Food Engineering |

Volume | 70 |

Issue number | 3 |

DOIs | |

State | Published - Oct 1 2005 |

### Fingerprint

### Keywords

- Analysis of algorithms: Computational complexity
- Extensive facility location
- Hazardous material transportation

### ASJC Scopus subject areas

- Food Science

### Cite this

*Journal of Food Engineering*,

*70*(3), 293-298. https://doi.org/10.1016/j.jfoodeng.2004.05.076