Ítem
Solo Metadatos

A two-phase method to periodic vehicle routing problem with variable service frequency

Mostrar el registro sencillo de la publicación
dc.creatorLópez-Santana E.spa
dc.creatorFranco Franco, Carlos Albertospa
dc.creatorGiraldo G.M.spa
dc.date.accessioned2020-05-25T23:56:48Z
dc.date.available2020-05-25T23:56:48Z
dc.date.created2018spa
dc.description.abstractThis paper presents a method to solve the periodic vehicle routing problem with service frequency. The problem consists in finding a set of paths for a crew of vehicles to deliver products or services to a set of customers in a discrete planning horizon subject to constraints as vehicle capacity, distance-time constraints, time windows, and the variable demand that implies a not defined frequency. Our method solves iteratively two mixed integer programming models. The first one assigns customers to be visited on the planning horizon. The second finds paths to visit the customers for each period. However, in case of non-feasibility a set of rules modify the allocation and the process starts again until the solution is obtained. We present an example to illustrate the method. © Springer International Publishing AG, part of Springer Nature 2018.eng
dc.format.mimetypeapplication/pdf
dc.identifier.doihttps://doi.org/10.1007/978-3-319-95165-2_37
dc.identifier.urihttps://repository.urosario.edu.co/handle/10336/22525
dc.language.isoengspa
dc.publisherSpringer Verlagspa
dc.relation.citationEndPage538
dc.relation.citationStartPage525
dc.relation.citationTitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.relation.citationVolumeVol. 10961 LNCS
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.10961 LNCS,(2018); pp. 525-538spa
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85049994124&doi=10.1007%2f978-3-319-95165-2_37&partnerID=40&md5=633a710c674a1866219b6115db8f8191spa
dc.rights.accesRightsinfo:eu-repo/semantics/openAccess
dc.rights.accesoAbierto (Texto Completo)spa
dc.source.instnameinstname:Universidad del Rosariospa
dc.source.reponamereponame:Repositorio Institucional EdocURspa
dc.subject.keywordInteger programmingspa
dc.subject.keywordIterative methodsspa
dc.subject.keywordOptimizationspa
dc.subject.keywordSalesspa
dc.subject.keywordVehiclesspa
dc.subject.keywordMixed integer programming modelspa
dc.subject.keywordPeriodic vehicle routing problemspa
dc.subject.keywordPlanning horizonsspa
dc.subject.keywordService frequencyspa
dc.subject.keywordSet of customersspa
dc.subject.keywordTwo phase methodspa
dc.subject.keywordVariable demandsspa
dc.subject.keywordVehicle capacityspa
dc.subject.keywordVehicle routingspa
dc.subject.keywordOptimizationspa
dc.subject.keywordService frequencyspa
dc.subject.keywordVehicle routingspa
dc.titleA two-phase method to periodic vehicle routing problem with variable service frequencyspa
dc.typeconferenceObjecteng
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersion
dc.type.spaDocumento de conferenciaspa
Archivos
Colecciones
Artículos