Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/124086
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Guimarans, Daniel | - |
dc.contributor.author | Herrero, Rosa | - |
dc.contributor.author | Riera Terrén, Daniel | - |
dc.contributor.author | Juan, Angel A. | - |
dc.contributor.author | Ramos González, Juan José | - |
dc.contributor.other | Universitat Oberta de Catalunya (UOC) | - |
dc.contributor.other | Universitat Autònoma de Barcelona (UAB) | - |
dc.date.accessioned | 2020-10-20T15:15:26Z | - |
dc.date.available | 2020-10-20T15:15:26Z | - |
dc.date.issued | 2010-07-22 | - |
dc.identifier.citation | Guimarans, 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.issn | 1613-0073MIAR | - |
dc.identifier.uri | http://hdl.handle.net/10609/124086 | - |
dc.description.abstract | This 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.mimetype | application/pdf | - |
dc.language.iso | eng | - |
dc.publisher | CEUR Workshop Proceedings | - |
dc.relation.ispartofseries | RCRA workshop, Bolonya, Itàlia, 10-11, juny de 2010 | - |
dc.relation.uri | http://ceur-ws.org/Vol-616/ | - |
dc.rights | (c) Author/s & (c) Journal | - |
dc.subject | capacitated vehicle routing problem | en |
dc.subject | constraint programming | en |
dc.subject | lagrangian relaxation | en |
dc.subject | probabilistic algorithms | en |
dc.subject | algoritmos probabilísticos | es |
dc.subject | algorismes probabilístics | ca |
dc.subject | problema de enrutamiento de vehículos capacitados | es |
dc.subject | problema d'enrutament de vehicles capacitats | ca |
dc.subject | programació amb restriccions | ca |
dc.subject | programación con restricciones | es |
dc.subject | relajación lagrangiana | es |
dc.subject | relaxació lagrangiana | ca |
dc.subject.lcsh | Algorithms | en |
dc.title | Combining constraint programming, lagrangian relaxation and probabilistic algorithms to solve the vehicle routing problem | - |
dc.type | info:eu-repo/semantics/conferenceObject | - |
dc.subject.lemac | Algorismes | ca |
dc.subject.lcshes | Algoritmos | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | - |
dc.relation.projectID | info:eu-repo/grantAgreement/HAROSA09 | - |
Aparece en las colecciones: | Conferències |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
Riera_Juan_CEUR_Combining.pdf | 175,71 kB | Adobe PDF | Visualizar/Abrir |
Comparte:
Los ítems del Repositorio están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.