dc.creatorVillegas Ramírez, Juan Guillermo
dc.creatorMendoza, Jorge E.
dc.date2023-04-02T18:29:03Z
dc.date2023-04-02T18:29:03Z
dc.date2011
dc.date.accessioned2024-04-23T18:02:27Z
dc.date.available2024-04-23T18:02:27Z
dc.identifierJorge E. Mendoza, Juan Villegas. A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. 2011. <hal-00629457>
dc.identifier1862-4472
dc.identifierhttps://hdl.handle.net/10495/34432
dc.identifier10.1007/s11590-012-0555-8
dc.identifier1862-4480
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/9230297
dc.descriptionABSTRACT: The vehicle routing problem with stochastic demands consists in designing transportation routes of minimal expected cost to satisfy a set of customers with random demands of known probability distributions. This paper proposes a simple yet effective heuristic approach that uses randomized heuristics for the traveling salesman problem, a tour partitioning procedure, and a set partitioning formulation to sample the solution space and find high-quality solutions for the problem. Computational experiments on benchmark instances from the literature show that the proposed approach is competitive with the state-of-the-art algorithm for the problem in terms of both accuracy and efficiency. In experiments conducted on a set of 40 instances, the proposed approach unveiled four new best-known solutions (BKSs) and matched another 24. For the remaining 12 instances, the heuristic reported average gaps with respect to the BKS ranging from 0.69 to 0.15 % depending on its configuration.
dc.descriptionCOL0031851
dc.format16
dc.formatapplication/pdf
dc.formatapplication/pdf
dc.languageeng
dc.publisherSpringer
dc.publisherALIADO - Analítica e Investigación para la Toma de Decisiones
dc.publisherBerlín, Alemania
dc.relationOptim. Lett.
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightshttp://creativecommons.org/licenses/by/2.5/co/
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.rightshttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectProgramación heurística
dc.subjectHeuristic programming
dc.subjectAnálisis estocástico
dc.subjectStochastic analysis
dc.titleA multi-space sampling heuristic for the vehicle routing problem with stochastic demands
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typehttp://purl.org/coar/resource_type/c_2df8fbb1
dc.typehttps://purl.org/redcol/resource_type/ART
dc.typeArtículo de investigación


Este ítem pertenece a la siguiente institución