<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>2477-9075</journal-id>
<journal-title><![CDATA[Revista Economía y Política]]></journal-title>
<abbrev-journal-title><![CDATA[Revista Economía y Política]]></abbrev-journal-title>
<issn>2477-9075</issn>
<publisher>
<publisher-name><![CDATA[Universidad de Cuenca]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S2477-90752017000100061</article-id>
<article-id pub-id-type="doi">10.25097/rep.n25.2017.04</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Towards integrating retiming in vehicle type scheduling problem]]></article-title>
<article-title xml:lang="es"><![CDATA[Hacía la integración de la resincronización en el problema de programación por tipo de vehículo]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Borenstein]]></surname>
<given-names><![CDATA[Denis]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Campoverde]]></surname>
<given-names><![CDATA[Jorge A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Naula Sigua]]></surname>
<given-names><![CDATA[Freddy B.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Federal Rio Grande de Sur  ]]></institution>
<addr-line><![CDATA[Porto Alegre ]]></addr-line>
<country>Brazil</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad de Cuenca  ]]></institution>
<addr-line><![CDATA[Cuenca ]]></addr-line>
<country>Ecuador</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad de Cuenca  ]]></institution>
<addr-line><![CDATA[Cuenca ]]></addr-line>
<country>Ecuador</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2017</year>
</pub-date>
<numero>25</numero>
<fpage>61</fpage>
<lpage>77</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.senescyt.gob.ec/scielo.php?script=sci_arttext&amp;pid=S2477-90752017000100061&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.senescyt.gob.ec/scielo.php?script=sci_abstract&amp;pid=S2477-90752017000100061&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.senescyt.gob.ec/scielo.php?script=sci_pdf&amp;pid=S2477-90752017000100061&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract In this paper, we propose an integer linear programming (ILP) aiming at optimizing timetabling generation and the Vehicle Type Scheduling Problem (VTSP), based on a time-space network (TSN). The model was defined as Vehicle Type Scheduling Problem with Sequential Changes of timetable (VTSP- SCT). Additionally, we developed a new methodology to insert time window to the proposed problem based on small changes on the TSN structure, with easy computational implementation and optimal solution at low computation run-times. By including small changes to the timetable and/or including time windows for timetabling trips, we introduced flexibility levels in the departure times of trips, resulting in operational advantages for the service provider. Since we use a very short time window interval, the current timetable is only slightly modified, minimally changing the passenger routines. The developed approaches were tested using random instances based on a Brazilian city. The VTSP-SCT with and without time windows have resulted in relevant savings in the daily operations of the public transportation service, reducing the required number of scheduled vehicles to carry out the historic demand.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen En este documento, proponemos una programación lineal entera (ILP) con el objetivo de optimizar la generación de horarios y el problema de programación de tipo de vehículo (VTSP), basado en una red de tiempo y espacio (TSN). El modelo se definió como un problema de programación de tipo de vehículo con cambios secuenciales de horario (VTSP-SCT). Además, desarrollamos una nueva metodología para insertar una ventana de tiempo al problema propuesto en base a pequeños cambios en la estructura TSN, con una implementación computacional sencilla y una solución óptima en tiempos de ejecución de computación bajos. Al incluir pequeños cambios en el cronograma y / o incluir ventanas de tiempo para programar viajes, introdujimos niveles de flexibilidad en los horarios de salida de los viajes, lo que resulta en ventajas operacionales para el proveedor del servicio. Dado que usamos un intervalo de ventana de tiempo muy corto, el horario actual solo se modifica ligeramente, cambiando mínimamente las rutinas de los pasajeros. Los enfoques desarrollados fueron probados usando instancias aleatorias basadas en una ciudad brasileña. El VTSP-SCT con y sin ventanas de tiempo ha resultado en ahorros relevantes en las operaciones diarias del servicio de transporte público, reduciendo el número requerido de vehículos programados para llevar a cabo la demanda histórica.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[scheduling vehicle]]></kwd>
<kwd lng="en"><![CDATA[logistic]]></kwd>
<kwd lng="en"><![CDATA[public transport]]></kwd>
<kwd lng="en"><![CDATA[operations research]]></kwd>
<kwd lng="en"><![CDATA[timetabling]]></kwd>
<kwd lng="es"><![CDATA[programación de vehículos]]></kwd>
<kwd lng="es"><![CDATA[logística]]></kwd>
<kwd lng="es"><![CDATA[transporte público]]></kwd>
<kwd lng="es"><![CDATA[investigación de operaciones]]></kwd>
<kwd lng="es"><![CDATA[programación de horarios]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Planning, operation, and control of bus transport systems: A literature review]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ibarra-Rojas]]></surname>
<given-names><![CDATA[O. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Delgado]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Giesen]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Muñoz]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transp. Res. Part B Methodol]]></source>
<year>2015</year>
<volume>77</volume>
<page-range>38-75</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An overview on vehicle scheduling models]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bunte]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Kliewer]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Public Transp]]></source>
<year>2009</year>
<volume>1</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>299-317</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Public-transport vehicle scheduling with multi vehicle type]]></article-title>
<collab>A. (Avi) Ceder</collab>
<source><![CDATA[Transp. Res. Part C Emerg. Technol]]></source>
<year>2011</year>
<volume>19</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>485-97</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Multiple depot vehicle scheduling with controlled trip shifting]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Desfontaines]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Desaulniers]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Les Cah. du GERAD]]></source>
<year>2017</year>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Multi-depot vehicle scheduling problems with time windows and waiting costs]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Desaulniers]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Lavigne]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Soumis]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Eur. J. Oper. Res]]></source>
<year>1998</year>
<volume>111</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>479-94</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hadjar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Soumis]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Comput. Oper. Res.]]></source>
<year>2009</year>
<volume>36</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>2160-72</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kramkowski]]></surname>
<given-names><![CDATA[S. K. N. M. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Heuristic Methods for Increasing Delay-Tolerance of Vehicle Schedules in Public Bus Transport]]></source>
<year>2009</year>
<page-range>1-9</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Integrated timetabling and vehicle scheduling with balanced departure times]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schmid]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Ehmke]]></surname>
<given-names><![CDATA[J. F.]]></given-names>
</name>
</person-group>
<source><![CDATA[OR Spectr.]]></source>
<year>2015</year>
<volume>37</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>903-28</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Multi-objective integration of timetables, vehicle schedules and user routings in a transit network]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laporte]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Ortega]]></surname>
<given-names><![CDATA[F. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pozo]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Puerto]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transp. Res. Part B Methodol]]></source>
<year>2017</year>
<volume>98</volume>
<page-range>94-112</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Integrated Public Transport Timetable Synchronization and Vehicle Scheduling with Demand Assignment: A Bi-objective Bi-level Model Using Deficit Function Approach]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Ceder]]></surname>
<given-names><![CDATA[A. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transp. Res. Procedia]]></source>
<year>2017</year>
<volume>23</volume>
<page-range>341-61</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A new solution model for multi-depot multi-vehicle-type vehicle scheduling in (sub)urban public transport]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kliewer]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Mellouli]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Suhl]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proc. 13th Mini-EURO Conf. 9th Meet. EURO Work. Gr. Transp]]></source>
<year>2002</year>
<numero>May 2014</numero>
<issue>May 2014</issue>
<page-range>604-9</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A time-space network based exact optimization model for multi-depot bus scheduling]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kliewer]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Mellouli]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Suhl]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>2006</year>
<volume>175</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>1616-27</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Multiple depot vehicle and crew scheduling with time windows for scheduled trips]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kliewer]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Amberg]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Amberg]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Public Transp]]></source>
<year>2012</year>
<volume>3</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>213-44</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A Time-Space Network Approach for the Integrated Vehicle- and Crew-Scheduling Problem with Multiple Depots]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Steinzen]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Gintner]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Suhl]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Kliewer]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transp. Sci]]></source>
<year>2010</year>
<volume>44</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>367-82</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A branch and bound algorithm for the multiple depot vehicle scheduling problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carpaneto]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Dell&#8217;amico]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Fischetti]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Toth]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Networks]]></source>
<year>1989</year>
<volume>19</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>531-48</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Integrating timetabling and vehicle scheduling in public bus transportation]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Van den Heuvel]]></surname>
<given-names><![CDATA[a. P. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Van den Akker]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Van Kooten Niekerk]]></surname>
<given-names><![CDATA[M. E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Inf.]]></source>
<year>2008</year>
<numero>February</numero>
<issue>February</issue>
<page-range>17</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[ON THE COMPLEXITY OF TIMETABLE AND MULTICOMMODITY FLOW PROBLEMS]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Even S]]></surname>
<given-names><![CDATA[S. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Itai]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[16th Annu. Sytnposiultl Found. Cotnputer Sci]]></source>
<year>1976</year>
<volume>5</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>691-703</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[On Some Matching Problems Arising in Vehicle Scheduling Models]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bertossi]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Carraresi]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Gallo]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Networks]]></source>
<year>1987</year>
<volume>17</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>271-81</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Time windows for scheduled trips in multiple depot vehicle scheduling]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kliewer]]></surname>
<given-names><![CDATA[L. S. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Mellouli]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[11 th Meet. Proc. EURO Work. Gr. Transp]]></source>
<year>2006</year>
<page-range>340-6</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
