Finding minimum and equitable risk routes for hazmat shipments (Articolo in rivista)

Type
Label
  • Finding minimum and equitable risk routes for hazmat shipments (Articolo in rivista) (literal)
Anno
  • 2007-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1016/j.cor.2005.06.003 (literal)
Alternative label
  • Carotenuto P., Giordani S., Ricciardelli S. (2007)
    Finding minimum and equitable risk routes for hazmat shipments
    in Computers & operations research; Pergamon-Elsevier Science Ltd., Oxford (Regno Unito)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Carotenuto P., Giordani S., Ricciardelli S. (literal)
Pagina inizio
  • 1304 (literal)
Pagina fine
  • 1327 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 34 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • Special Issue: Hazardous Materials Transportation (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 24 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 5 (literal)
Note
  • Scopu (literal)
  • ISI Web of Science (WOS) (literal)
  • Google Scholar (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Istituto di Tecnologie Industriali e Automazione - Sezione di Roma, Consiglio Nazionale delle Ricerche, Via del fosso del cavaliere 100, I-00133 Roma, Italy Dipartimento di Ingegneria dell’Impresa, Università di Roma \"Tor Vergata\", Via del Politecnico 1, I-00133 Roma, Italy (literal)
Titolo
  • Finding minimum and equitable risk routes for hazmat shipments (literal)
Abstract
  • This paper deals with the generation of minimal risk paths for the road transportation of hazardous materials between an origin–destination pair of a given regional area. The main considered issue is the selection of paths that minimize the total risk of hazmat shipments while spreading the risk induced on the population in an equitable way. The problem is mathematically formulated, and two heuristic algorithms are proposed for its solution. Substantially, these procedures are modified versions of Yen's algorithm for the k-shortest path problem, which take into due consideration the risk propagation resulting from close paths and spread the risk equitably among zones of the geographical region in which the transportation network is embedded. Furthermore, a lower bound based on a Lagrangean relaxation of the given mathematical formulation is also provided. Finally, a series of computational tests, referring to a regional area is reported. (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Autore CNR di
Prodotto
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Editore di
Insieme di parole chiave di
data.CNR.it