Please use this identifier to cite or link to this item:

http://hdl.handle.net/10609/91566
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBelloso, Javier-
dc.contributor.authorJuan Pérez, Ángel Alejandro-
dc.contributor.authorFaulin Fajardo, Francisco Javier-
dc.date.accessioned2019-02-12T07:29:14Z-
dc.date.available2019-02-12T07:29:14Z-
dc.date.issued2016-11-08-
dc.identifier.citationBelloso, J., Juan, A.A. & Faulín Fajardo, F. (2019). An iterative biased-randomized heuristic for the fleet size and mix vehicle-routing problem with backhauls. International Transactions in Operational Research, 26(1), 289-301. doi: 10.1111/itor.12379-
dc.identifier.issn0969-6016-
dc.identifier.urihttp://hdl.handle.net/10609/91566-
dc.description.abstractThis paper analyzes the fleet mixed vehicle-routing problem with backhauls, a rich and realistic variant of the popular vehicle-routing problem in which both delivery and pick-up customers are served from a central depot using a heterogeneous and configurable fleet of vehicles. After a literature review on the issue and a detailed description of the problem, a solution based on a multistart biased-randomized heuristic is proposed. Our algorithm uses an iterative method that relies on solving a series of smaller instances of the homogeneous-fleet version of the problem and then using these subsolutions as partial solutions for the original heterogeneous instance. In order to better guide the exploration of the solutions space, the algorithm employs several biased-randomized processes: a first one for selecting a vehicle type; a second one for sorting the savings list; and a third one to define the number of routes that must be selected from the homogenousfleet subsolution. The computational experiments show that our approach is competitive and able to provide 20 new best-known solutions for a 36-instance benchmark recently proposed in the literature.en
dc.format.mimetypeapplication/pdf-
dc.language.isoeng-
dc.publisherInternational Transactions in Operational Research-
dc.relation.urihttps://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.12379-
dc.rightscc-by-nc-nd-
dc.subjectvehicle-routing problem with backhaulsen
dc.subjectheuristicsen
dc.subjectbiased randomizationen
dc.subjectmultistart algorithmsen
dc.subjectfleet size and mix vehicle-routing problemen
dc.subjectruta para vehículoses
dc.subjectruta per a vehiclesca
dc.subjectheurísticaes
dc.subjectheurísticaca
dc.subjectaleatorización sesgadaes
dc.subjectaleatorització esbiaixadaca
dc.subjectalgoritmos multistartes
dc.subjectalgorismes multistartca
dc.subjectresolución de problemas reales de flotas de vehículos capacitadoes
dc.subjectresolució de problemes reals de flotes de vehicles capacitatca
dc.subject.lcshAlgorithmsen
dc.titleAn iterative biased-randomized heuristic for the fleet size and mix vehicle-routing problem with backhauls-
dc.typeinfo:eu-repo/semantics/article-
dc.typeinfo:eu-repo/semantics/acceptedVersion-
dc.subject.lemacAlgorismesca
dc.subject.lcshesAlgoritmoses
dc.rights.licensehttp://creativecommons.org/licenses/by-nc-nd/3.0/es/-
dc.rights.accessrightsinfo:eu-repo/semantics/openAccess-
dc.identifier.doi10.1111/itor.12379-
dc.relation.projectIDinfo:eu-repo/grantAgreement/TRA2013-48180-C3-P-
dc.relation.projectIDinfo:eu-repo/grantAgreement/TRA2015-71883-REDT-
dc.relation.projectIDinfo:eu-repo/grantAgreement/CYTED2014-515RT0489-
dc.relation.projectIDinfo:eu-repo/grantAgreement/2014-CTP-00001-
dc.relation.projectIDinfo:eu-repo/grantAgreement/CAN2014-3758-
dc.relation.projectIDinfo:eu-repo/grantAgreement/CAN2015-70473-
Appears in Collections:Articles
Articles cientÍfics

Files in This Item:
File Description SizeFormat 
itor.12379.pdf482.37 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons