<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445838485</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145336.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10951-010-0186-9</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10951-010-0186-9</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A combined CLP-MILP approach for scheduling commodities inapipeline</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[L. Magatão, L. Arruda, F. Neves-Jr]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This paper addresses the problem of developing an optimization model to aid the operational scheduling in a real-world pipeline scenario. The pipeline connects refinery and harbor, conveying different types of commodities (gasoline, diesel, kerosene, etc.). An optimization model was developed to determine pipeline scheduling with improved efficiency. This model combines constraint logic programming (CLP) and mixed integer linear programming (MILP) in a CLP-MILP approach. The proposed model uses decomposition strategies, continuous time representation, intervals that indicate time constraints (time windows), and a series of operational issues, such as the seasonal and hourly cost of electric energy (on-peak demand hours). Real cases were solved in a matter of seconds. The computational results have demonstrated that the model is able to define new operational points to the pipeline, providing significant cost savings. Indeed the CLP-MILP model is an efficient tool to aid operational decision-making within this real-world pipeline scenario.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media, LLC, 2010</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Constraint logic programming (CLP)</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Mixed integer linear programming (MILP)</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Scheduling</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Pipeline</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Magatão</subfield>
   <subfield code="D">L.</subfield>
   <subfield code="u">Graduate School in Electrical Engineering and Industrial Computer Science, Federal University of Technology—Paraná (UTFPR), Av. Sete de Setembro, 3165, 80230-901, Curitiba, PR, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Arruda</subfield>
   <subfield code="D">L.</subfield>
   <subfield code="u">Graduate School in Electrical Engineering and Industrial Computer Science, Federal University of Technology—Paraná (UTFPR), Av. Sete de Setembro, 3165, 80230-901, Curitiba, PR, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Neves-Jr</subfield>
   <subfield code="D">F.</subfield>
   <subfield code="u">Graduate School in Electrical Engineering and Industrial Computer Science, Federal University of Technology—Paraná (UTFPR), Av. Sete de Setembro, 3165, 80230-901, Curitiba, PR, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Scheduling</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">14/1(2011-02-01), 57-87</subfield>
   <subfield code="x">1094-6136</subfield>
   <subfield code="q">14:1&lt;57</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">14</subfield>
   <subfield code="o">10951</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10951-010-0186-9</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/s10951-010-0186-9</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">Magatão</subfield>
   <subfield code="D">L.</subfield>
   <subfield code="u">Graduate School in Electrical Engineering and Industrial Computer Science, Federal University of Technology—Paraná (UTFPR), Av. Sete de Setembro, 3165, 80230-901, Curitiba, PR, Brazil</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">Arruda</subfield>
   <subfield code="D">L.</subfield>
   <subfield code="u">Graduate School in Electrical Engineering and Industrial Computer Science, Federal University of Technology—Paraná (UTFPR), Av. Sete de Setembro, 3165, 80230-901, Curitiba, PR, Brazil</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">Neves-Jr</subfield>
   <subfield code="D">F.</subfield>
   <subfield code="u">Graduate School in Electrical Engineering and Industrial Computer Science, Federal University of Technology—Paraná (UTFPR), Av. Sete de Setembro, 3165, 80230-901, Curitiba, PR, Brazil</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">Journal of Scheduling</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">14/1(2011-02-01), 57-87</subfield>
   <subfield code="x">1094-6136</subfield>
   <subfield code="q">14:1&lt;57</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">14</subfield>
   <subfield code="o">10951</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>
