<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">467928592</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406152936.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170328e20060901xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11067-006-9283-x</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11067-006-9283-x</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Bell</subfield>
   <subfield code="D">Michael</subfield>
   <subfield code="u">Department of Civil and Environmental Engineering, Imperial College, Exhibition Road, SW7 2BU, London, UK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Mixed Route Strategies for the Risk-Averse Shipment of Hazardous Materials</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Michael Bell]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Previous work on the risk-averse routing of hazardous materials has focussed on ways of finding the safest route between a pair of points. For repeated shipments where the arc incident probabilities are unknown, it is shown that the safest strategy is in general to use a mix of routes. Starting with a simple two-route example, it is shown that exposure can be significantly reduced by sharing shipments between routes. In order to determine the safest set of routes and the safest share of traffic between these routes, a minmax problem is formulated. The properties of the optimality conditions are explored. A simple solution heuristic based on a shortest path algorithm and the method of successive averages is proposed. Connections to game theory provide useful insights into the nature of the solution.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science + Business Media, LLC, 2006</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Network reliability</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Hazmats</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Uncertainty</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Networks and Spatial Economics</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">6/3-4(2006-09-01), 253-265</subfield>
   <subfield code="x">1566-113X</subfield>
   <subfield code="q">6:3-4&lt;253</subfield>
   <subfield code="1">2006</subfield>
   <subfield code="2">6</subfield>
   <subfield code="o">11067</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11067-006-9283-x</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s11067-006-9283-x</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Bell</subfield>
   <subfield code="D">Michael</subfield>
   <subfield code="u">Department of Civil and Environmental Engineering, Imperial College, Exhibition Road, SW7 2BU, London, UK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Networks and Spatial Economics</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">6/3-4(2006-09-01), 253-265</subfield>
   <subfield code="x">1566-113X</subfield>
   <subfield code="q">6:3-4&lt;253</subfield>
   <subfield code="1">2006</subfield>
   <subfield code="2">6</subfield>
   <subfield code="o">11067</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
