A tabu search approach for scheduling hazmat shipments (Articolo in rivista)

Type
Label
  • A tabu search approach for scheduling 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.004 (literal)
Alternative label
  • Carotenuto P., Giordani S., Ricciardelli S., Rismondo S. (2007)
    A tabu search approach for scheduling 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., Rismondo S. (literal)
Pagina inizio
  • 1328 (literal)
Pagina fine
  • 1350 (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
  • 23 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 5 (literal)
Note
  • Google Scholar (literal)
  • Scopu (literal)
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Istituto di Tecnologie Industriali e Automazione - Sede di Roma, Consiglio Nazionale delle Ricerche, Via del fosso del cavaliere 100, I-00133 Rome, Italy Dipartimento di Ingegneria dell'Impresa, Università di Roma \"Tor Vergata\", Via del Politechnico 1, I-00133 Rome, Italy (literal)
Titolo
  • A tabu search approach for scheduling hazmat shipments (literal)
Abstract
  • Vehicle routing and scheduling are two main issues in the hazardous material (hazmat) transportation problem. In this paper, we study the problem of managing a set of hazmat transportation requests in terms of hazmat shipment route selection and actual departure time definition. For each hazmat shipment, a set of minimum and equitable risk alternative routes from origin to destination points and a preferred departure time are given. The aim is to assign a route to each hazmat shipment and schedule these shipments on the assigned routes in order to minimize the total shipment delay, while equitably spreading the risk spatially and preventing the risk induced by vehicles traveling too close to each other. We model this hazmat shipment scheduling problem as a job-shop scheduling problem with alternative routes. No-wait constraints arise in the scheduling model as well, since, supposing that no safe area is available, when a hazmat vehicle starts traveling from the given origin it cannot stop until it arrives at the given destination. A tabu search algorithm is proposed for the problem, which is experimentally evaluated on a set of realistic test problems over a regional area, evaluating the provided solutions also with respect to the total route risk and length. (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