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

http://hdl.handle.net/10609/124086
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGuimarans Serrano, Daniel-
dc.contributor.authorHerrero, Rosa-
dc.contributor.authorRiera Terrén, Daniel-
dc.contributor.authorJuan Pérez, Ángel Alejandro-
dc.contributor.authorRamos González, Juan José-
dc.contributor.otherUniversitat Oberta de Catalunya (UOC)-
dc.contributor.otherUniversitat Autònoma de Barcelona-
dc.date.accessioned2020-10-20T15:15:26Z-
dc.date.available2020-10-20T15:15:26Z-
dc.date.issued2010-07-22-
dc.identifier.citationGuimarans, D., Herrero, R., Riera, D., Juan, A.A. & Ramos, J.J. (2010). Combining constraint programming, lagrangian relaxation and probabilistic algorithms to solve the vehicle routing problem. CEUR Workshop Proceedings, 616(), 1-18.-
dc.identifier.issn1613-0073MIAR
-
dc.identifier.urihttp://hdl.handle.net/10609/124086-
dc.description.abstractThis paper presents a hybrid approach that aims at solving the Capacitated Vehicle Routing Problem (CVRP) by means of combining Constraint Programming (CP) with Lagrangian Relaxation (LR) and Probabilistic Algorithms. After introducing the CVRP and reviewing the main literature in this area, the paper proposes the use of a multi-start hybrid Variable Neighbourhood Search (VNS) algorithm. This algorithm uses a randomised version of the classical Clarke and Wright savings heuristic to generate a starting solution to a given CVRP. This starting solution is then improved through a local search process which combines: (a) LR to optimise each individual route, and (b) CP to quickly verify the feasibility of new proposed solutions. Some results on well-known CVRP benchmarks are analysed and discussed.en
dc.format.mimetypeapplication/pdf-
dc.language.isoeng-
dc.publisherCEUR Workshop Proceedings-
dc.relation.ispartofseriesRCRA workshop, Bolonya, Itàlia, 10-11, juny de 2010-
dc.relation.urihttp://ceur-ws.org/Vol-616/-
dc.rights(c) Author/s & (c) Journal-
dc.subjectcapacitated vehicle routing problemen
dc.subjectconstraint programmingen
dc.subjectlagrangian relaxationen
dc.subjectprobabilistic algorithmsen
dc.subjectalgoritmos probabilísticoses
dc.subjectalgorismes probabilísticsca
dc.subjectproblema de enrutamiento de vehículos capacitadoses
dc.subjectproblema d'enrutament de vehicles capacitatsca
dc.subjectprogramació amb restriccionsca
dc.subjectprogramación con restriccioneses
dc.subjectrelajación lagrangianaes
dc.subjectrelaxació lagrangianaca
dc.subject.lcshAlgorithmsen
dc.titleCombining constraint programming, lagrangian relaxation and probabilistic algorithms to solve the vehicle routing problem-
dc.typeinfo:eu-repo/semantics/conferenceObject-
dc.subject.lemacAlgorismesca
dc.subject.lcshesAlgoritmoses
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess-
dc.relation.projectIDinfo:eu-repo/grantAgreement/HAROSA09-
Appears in Collections:Conference lectures

Files in This Item:
File SizeFormat 
Riera_Juan_CEUR_Combining.pdf175.71 kBAdobe PDFView/Open

Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.