Adaptive memory programming for the vehicle routing problem with multiple trip

dc.creatorOlivera, Alfredo
dc.creatorViera, Omar
dc.date.accessioned2014-12-02T16:07:11Z
dc.date.accessioned2022-10-28T19:22:13Z
dc.date.available2014-12-02T16:07:11Z
dc.date.available2022-10-28T19:22:13Z
dc.date.created2014-12-02T16:07:11Z
dc.date.issued2004
dc.identifierOLIVERA, A., VIERA, O. "Adaptive memory programming for the vehicle routing problem with multiple trip". Reportes Técnicos 04-11. UR. FI – INCO, 2004.
dc.identifier0797-6410
dc.identifierhttp://hdl.handle.net/20.500.12008/3509
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4959887
dc.description.abstractThe Vehicle Routing Problem with Multiple Trips is an extension of the classical Vehicle Routing Problem in which each vehicle may perform several routes in the same planning period. In this paper, an adaptive memory algorithm to solve this problem is proposed. The algorithm was run over a set of benchmark problem instances, consistently finding high-quality solutions.
dc.publisherUR. FI – INCO.
dc.relationReportes Técnicos 04-11
dc.rightsLicencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0)
dc.rightsLas obras depositadas en el Repositorio se rigen por la Ordenanza de los Derechos de la Propiedad Intelectual de la Universidad De La República. (Res. Nº 91 de C.D.C. de 8/III/1994 – D.O. 7/IV/1994) y por la Ordenanza del Repositorio Abierto de la Universidad de la República (Res. Nº 16 de C.D.C. de 07/10/2014)
dc.subjectRUTEO DE VEHICULOS
dc.subjectVEHICLE ROUTING
dc.subjectMULTIPLE TRIPS
dc.subjectADAPTIVE MEMORY PROCEDURE
dc.titleAdaptive memory programming for the vehicle routing problem with multiple trip
dc.typeReporte técnico


Este ítem pertenece a la siguiente institución