Per accedir als documents amb el text complet, si us plau, seguiu el següent enllaç: http://hdl.handle.net/10609/90886
dc.contributor | Universitat Autònoma de Barcelona |
---|---|
dc.contributor | Universitat Oberta de Catalunya (UOC) |
dc.contributor.author | Guimarans, Daniel |
dc.contributor.author | Riera Terrén, Daniel |
dc.contributor.author | Juan Pérez, Ángel Alejandro |
dc.contributor.author | Ramos González, Juan José |
dc.date | 2019-01-30T13:35:03Z |
dc.date | 2019-01-30T13:35:03Z |
dc.date | 2011-06 |
dc.identifier.citation | Guimarans, D., Herrero, R., Riera-Terrén, D., Juan, A.A. & Ramos, J. (2011). Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the vehicle routing problem. Annals of Mathematics and Artificial Intelligence, 62(3), 299-315. doi: 10.1007/s10472-011-9261-y |
dc.identifier.citation | 1012-2443 |
dc.identifier.citation | 10.1007/s10472-011-9261-y |
dc.identifier.uri | http://hdl.handle.net/10609/90886 |
dc.format | application/pdf |
dc.language.iso | eng |
dc.publisher | Annals of Mathematics and Artificial Intelligence |
dc.relation | Annals of Mathematics and Artificial Intelligence, 2011, 62(3) |
dc.relation | https://link.springer.com/article/10.1007%2Fs10472-011-9261-y |
dc.relation | info:eu-repo/grantAgreement/HAROSA09 |
dc.rights | (c) Author/s & (c) Journal |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | hybrid algorithms |
dc.subject | variable neighborhood search |
dc.subject | vehicle routing problem |
dc.subject | probabilistic algorithms |
dc.subject | algoritmos híbridos |
dc.subject | problema de rutas de vehículos |
dc.subject | algoritmos probabilísticos |
dc.subject | búsqueda de vecindad variable |
dc.subject | algorismes híbrids |
dc.subject | problema de rutes de vehicles |
dc.subject | algorismes probabilístics |
dc.subject | cerca de veïnatge variable |
dc.subject | Algorithms |
dc.subject | Algorismes |
dc.subject | Algoritmos |
dc.title | Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the vehicle routing problem |
dc.type | info:eu-repo/semantics/article |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.description.abstract |