A model for solving vehicle scheduling problems: a case study

Vista sencilla de ítem
dc.citation.journalTitleREVISTA FACULTAD DE INGENIERIA-UNIVERSIDAD DE ANTIOQUIA
dc.contributor.authorGulnara Baldoquin, Maria
dc.contributor.authorJose Rengifo-Campo, Alvaro
dc.contributor.departmentUniversidad EAFIT. Departamento de Cienciasspa
dc.contributor.researchgroupMatemáticas y Aplicacionesspa
dc.creatorGulnara Baldoquin, Maria
dc.creatorJose Rengifo-Campo, Alvaro
dc.date.accessioned2021-04-12T14:04:23Z
dc.date.available2021-04-12T14:04:23Z
dc.date.issued2018-09-01
dc.description.abstractIn this work we formulate a model to solve a type of vehicle scheduling problem, derived from the operation of the mass transit system (MIO) in Cali city, Colombia. Four companies operate the system with 3 types of buses and four depots. Two kinds of tasks should be assigned to operators' buses. A task is a sequence of consecutive travels of a route between two stations: initial and final. Each task should start and should finish in a depot, not necessarily the same. There are two main objectives defined by the operators. One objective is to minimize the total deadhead kilometers between depots and stations where tasks should start or end. The other objective is to minimize the maximum deviation of kilometers (commercial and deadhead) assigned to the operators regarding the ideal quantity of kilometers that they should have, according to the number of their buses in the fleet. We have implemented the proposed model in AMPL using Gurobi solver and we validate it using nine representative instances, generated with real data obtained from the system operation. The results obtained, in all cases, improve the solutions proposed by the company. Model variations are proposed to deal with new desirable constraints for the company.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=8299
dc.identifier.doi10.17533/udea.redin.n88a03
dc.identifier.issn01206230
dc.identifier.issn24222844
dc.identifier.otherWOS;000444753500002
dc.identifier.otherSCOPUS;2-s2.0-85062288785
dc.identifier.urihttp://hdl.handle.net/10784/27716
dc.language.isospaeng
dc.publisherIMPRENTA UNIV ANTIOQUIA
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85062288785&doi=10.17533%2fUDEA.REDIN.N88A03&partnerID=40&md5=6f044e2bf76374d5d7388dbbdd749787
dc.rightshttps://v2.sherpa.ac.uk/id/publication/issn/0120-6230
dc.sourceREVISTA FACULTAD DE INGENIERIA-UNIVERSIDAD DE ANTIOQUIA
dc.subjectVehicle schedulingeng
dc.subjectmathematical programmingeng
dc.subjectpublic transporteng
dc.titleA model for solving vehicle scheduling problems: a case studyeng
dc.typearticleeng
dc.typeinfo:eu-repo/semantics/articleeng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.localArtículospa

Archivos

Colecciones

Artículos