<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
<record>
  <controlfield tag="001">123939</controlfield>
  <controlfield tag="005">20241125101123.0</controlfield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="2">doi</subfield>
    <subfield code="a">10.1111/itor.12951</subfield>
  </datafield>
  <datafield tag="024" ind1="8" ind2=" ">
    <subfield code="2">sideral</subfield>
    <subfield code="a">124392</subfield>
  </datafield>
  <datafield tag="037" ind1=" " ind2=" ">
    <subfield code="a">ART-2023-124392</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Calvete, H.I.</subfield>
    <subfield code="u">Universidad de Zaragoza</subfield>
    <subfield code="0">(orcid)0000-0001-7603-9380</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2023</subfield>
  </datafield>
  <datafield tag="506" ind1="0" ind2=" ">
    <subfield code="a">Access copy available to the general public</subfield>
    <subfield code="f">Unrestricted</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">The school bus routing problem (SBRP) involves interrelated decisions such as selecting the bus stops, allocating the students to the selected bus stops, and designing the routes for transporting the students to the school taking into account the bus capacity constraint, with the objective of minimizing the cost of the routes. This paper addresses the SBRP when the reaction of students to the selection of bus stops is taken into account, that is, when students are allowed to choose the selected bus stop that best suits them. A bilevel optimization model with multiple followers is formulated, and its transformation into a single-level mixed integer linear programming (MILP) model is proposed. A simple and effective metaheuristic algorithm is also developed to solve the problem. This algorithm involves solving four MILP problems at the beginning, which can be used to obtain tight upper bounds of the optimal solution. Extensive computational experiments on SBRP benchmark instances from the literature show the effectiveness of the proposed algorithm in terms of both the quality of the solution found and the required computing time.</subfield>
  </datafield>
  <datafield tag="536" ind1=" " ind2=" ">
    <subfield code="9">info:eu-repo/grantAgreement/ES/DGA/E41-17R</subfield>
    <subfield code="9">info:eu-repo/grantAgreement/ES/DGA/E41-20R</subfield>
    <subfield code="9">info:eu-repo/grantAgreement/ES/MICINN/PID2019-104263RB-C43</subfield>
    <subfield code="9">info:eu-repo/grantAgreement/ES/MINECO/ECO2016-76567-C4-3-R</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="9">info:eu-repo/semantics/openAccess</subfield>
    <subfield code="a">All rights reserved</subfield>
    <subfield code="u">http://www.europeana.eu/rights/rr-f/</subfield>
  </datafield>
  <datafield tag="590" ind1=" " ind2=" ">
    <subfield code="a">3.1</subfield>
    <subfield code="b">2023</subfield>
  </datafield>
  <datafield tag="591" ind1=" " ind2=" ">
    <subfield code="a">MANAGEMENT</subfield>
    <subfield code="b">171 / 407 = 0.42</subfield>
    <subfield code="c">2023</subfield>
    <subfield code="d">Q2</subfield>
    <subfield code="e">T2</subfield>
  </datafield>
  <datafield tag="591" ind1=" " ind2=" ">
    <subfield code="a">OPERATIONS RESEARCH &amp; MANAGEMENT SCIENCE</subfield>
    <subfield code="b">34 / 106 = 0.321</subfield>
    <subfield code="c">2023</subfield>
    <subfield code="d">Q2</subfield>
    <subfield code="e">T1</subfield>
  </datafield>
  <datafield tag="592" ind1=" " ind2=" ">
    <subfield code="a">1.027</subfield>
    <subfield code="b">2023</subfield>
  </datafield>
  <datafield tag="593" ind1=" " ind2=" ">
    <subfield code="a">Business and International Management</subfield>
    <subfield code="c">2023</subfield>
    <subfield code="d">Q1</subfield>
  </datafield>
  <datafield tag="593" ind1=" " ind2=" ">
    <subfield code="a">Computer Science Applications</subfield>
    <subfield code="c">2023</subfield>
    <subfield code="d">Q1</subfield>
  </datafield>
  <datafield tag="593" ind1=" " ind2=" ">
    <subfield code="a">Strategy and Management</subfield>
    <subfield code="c">2023</subfield>
    <subfield code="d">Q1</subfield>
  </datafield>
  <datafield tag="593" ind1=" " ind2=" ">
    <subfield code="a">Management Science and Operations Research</subfield>
    <subfield code="c">2023</subfield>
    <subfield code="d">Q1</subfield>
  </datafield>
  <datafield tag="593" ind1=" " ind2=" ">
    <subfield code="a">Management of Technology and Innovation</subfield>
    <subfield code="c">2023</subfield>
    <subfield code="d">Q2</subfield>
  </datafield>
  <datafield tag="594" ind1=" " ind2=" ">
    <subfield code="a">7.8</subfield>
    <subfield code="b">2023</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="4">
    <subfield code="a">info:eu-repo/semantics/article</subfield>
    <subfield code="v">info:eu-repo/semantics/publishedVersion</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Galé, C.</subfield>
    <subfield code="u">Universidad de Zaragoza</subfield>
    <subfield code="0">(orcid)0000-0002-5630-3719</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Iranzo, J.A.</subfield>
    <subfield code="u">Universidad de Zaragoza</subfield>
    <subfield code="0">(orcid)0000-0001-9993-9816</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Toth, P.</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="1">2007</subfield>
    <subfield code="2">265</subfield>
    <subfield code="a">Universidad de Zaragoza</subfield>
    <subfield code="b">Dpto. Métodos Estadísticos</subfield>
    <subfield code="c">Área Estadís. Investig. Opera.</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="g">30, 2 (2023), 1092-1119</subfield>
    <subfield code="p">Int. trans. oper. res.</subfield>
    <subfield code="t">INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH</subfield>
    <subfield code="x">0969-6016</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">462501</subfield>
    <subfield code="u">http://zaguan.unizar.es/record/123939/files/texto_completo.pdf</subfield>
    <subfield code="y">Versión publicada</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">2210400</subfield>
    <subfield code="u">http://zaguan.unizar.es/record/123939/files/texto_completo.jpg?subformat=icon</subfield>
    <subfield code="x">icon</subfield>
    <subfield code="y">Versión publicada</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zaguan.unizar.es:123939</subfield>
    <subfield code="p">articulos</subfield>
    <subfield code="p">driver</subfield>
  </datafield>
  <datafield tag="951" ind1=" " ind2=" ">
    <subfield code="a">2024-11-22-11:57:00</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">ARTICLE</subfield>
  </datafield>
</record>
</collection>