<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605470235</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100326.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150801xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00500-014-1427-1</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00500-014-1427-1</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Developing equilibrium optimization methods for hub location problems</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Kai Yang, Yankui Liu]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This paper develops three new equilibrium optimization models for $$p$$ p -hub center problem, in which the travel times are characterized by fuzzy random variables. The proposed equilibrium optimization methods are to find the locations of hub facilities and demand nodes so as to maximize equilibrium service levels of uncertain travel times. Under mild assumptions, we first handle equilibrium service levels and reduce them to their equivalent probability constraints. According to structural characteristics of equivalent stochastic programming models, we design a new parametric decomposition-based hybrid tabu search (PD-HTS) algorithm that incorporates parametric decomposition (PD), sample average approximation and tabu search algorithm. To demonstrate the effectiveness of designed solution method, we conduct some numerical experiments by using Australian Post data set and randomly generated data set. The comparison study shows that the PD-HTS algorithm exhibits better performance than the parametric decomposition-based hybrid genetic algorithm.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag Berlin Heidelberg, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Hub location problem</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Equilibrium service level</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Stochastic programming</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Parametric decomposition</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Sample average approximation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Tabu search algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Yang</subfield>
   <subfield code="D">Kai</subfield>
   <subfield code="u">Risk Management and Financial Engineering Lab, College of Mathematics and Computer Science, Hebei University, 071002, Baoding, Hebei, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Liu</subfield>
   <subfield code="D">Yankui</subfield>
   <subfield code="u">Risk Management and Financial Engineering Lab, College of Mathematics and Computer Science, Hebei University, 071002, Baoding, Hebei, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/8(2015-08-01), 2337-2353</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:8&lt;2337</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00500-014-1427-1</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</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/s00500-014-1427-1</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">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Yang</subfield>
   <subfield code="D">Kai</subfield>
   <subfield code="u">Risk Management and Financial Engineering Lab, College of Mathematics and Computer Science, Hebei University, 071002, Baoding, Hebei, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Liu</subfield>
   <subfield code="D">Yankui</subfield>
   <subfield code="u">Risk Management and Financial Engineering Lab, College of Mathematics and Computer Science, Hebei University, 071002, Baoding, Hebei, China</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">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/8(2015-08-01), 2337-2353</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:8&lt;2337</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
 </record>
</collection>
