Computing shortest paths for transportation of hazardous materials in continuous spaces

Journal of Food Engineering

Volumn 70, Issue 3, 2005, Pages 293-298

  Diaz Banez J M ^a   Gomez F ^b   Toussaint, G T ^c  

^a UNIVERSITY OF SEVILLE   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

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

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION MAKING; OPTIMIZATION; PROBLEM SOLVING; RISK MANAGEMENT; THEOREM PROVING; WATERWAY TRANSPORTATION;

ANALYSIS OF ALGORITHMS; EXTENSIVE FACILITY LOCATION; HAZARDOUS MATERIAL TRANSPORTATION; SHIPMENT;

HAZARDOUS MATERIALS;

EID: 17944369869     PISSN: 02608774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jfoodeng.2004.05.076     Document Type: Article

References (15)

1. J.A. Barcia, J.M. Díaz-Báñez, A. Lozano, and I. Ventura Computing an obnoxious anchored segment Operations Research Letters. 31 2003 293 300
2. J.M. Díaz-Báñez, F. Hurtado, H. Meijer, D. Rappaport, and J.A. Sellarès The largest empty annulus problem International Journal of Computational Geometry and Applications. 13 4 2003 317 325
3. J.M. Díaz-Báñez, J.A. Mesa, and A. Shöbel Continuous location of dimensional structures European Journal of Operational Research. 152 2004 22 44
4. Z. Drezner, and G.O. Wesolowsky Location of an obnoxious route Journal of Operational Research 40 1989 1011 1018
5. E. Erkut, and V. Verter Hazardous materials logistics Z. Drezner Facility location: a survey of applications and methods 1995 Springer-Verlag 467 506
6. E. Erkut, and V. Verter Modelling of transport risk for hazardous materials Operations Research 46 5 1998 625 642
7. F. Follert, E. Schömer, J. Sellen, M. Smid, and C. Thiel Computing a largest empty anchored cylinder and related problems International Journal of Computational Geometry and Applications 7 1997 563 580
8. H. Imai, M. Iri, and K. Murota Voronoi diagrams in the Laguerre geometry and its applications SIAM Journal of Computing 14 1 1985 93 105
9. J.S.B. Mitchell Geometric shortest paths and network optimization J.R. Sack J. Urrutia Handbook of computational geometry 2000 Elsevier Science 633 701
10. J. Nievergelt, and F.P. Preparata Plane-sweep algorithms for intersecting geometric figures Communications of the ACM 25 10 1982 739 747
11. A. Okabe, B. Boots, and K. Sugihara Spatial tesselations: concepts and applications of Voronoi diagrams 1992 Wiley
12. F.P. Preparata, and M.I. Shamos Computational geometry: an introduction 1985 Springer-Verlag New York
13. Shamos, M. I., Hoey, D. (1975). Closest-point problems, In Proceedings of the 16th IEEE symposium on foundations of computer science, Berkeley, California (pp. 151-162)
14. J.A. Storer, and J.H. Reif Shortest paths in the plane with polygonal obstacles Journal of ACM 41 5 1994 982 1012
15. V. Verter, and E. Erkut Hazardous materials logistics: an annotated bibliography C. Carraro A. Haurie Operations research and environmental management 1996 Kluwer Academic Publishers 221 267