Por favor, use este identificador para citar o enlazar este ítem:
http://www.repositorio.ufop.br/jspui/handle/123456789/9360
Título : | Limited memory Rank-1 cuts for vehicle routing problems. |
Autor : | Pecin, Diego Galindo Pessoa, Artur Alves Poggi, Marcus Barboza, Eduardo Uchoa Santos, Haroldo Gambini |
Palabras clave : | Set Partitioning Polyhedral combinatorics Branch-cut-and-price algorithms |
Fecha de publicación : | 2017 |
Citación : | PECIN, D. G. et al. Limited memory Rank-1 cuts for vehicle routing problems. Operations Research Letters, v. 45,p. 206-209, 2017. Disponível em: <https://www.sciencedirect.com/science/article/pii/S0167637717301049>. Acesso em: 16 jan. 2018. |
Resumen : | Pecin et al. (2016) introduced a ‘‘limited memory’’ technique that allows an efficient use of Rank-1 cuts in the Set Partitioning Formulation of Vehicle Routing Problems, motivating a deeper investigation of those cuts. This work presents a computational polyhedral study that determines the best possible sets of multipliers for cuts with up to 5 rows. Experiments with CVRP instances show that the new multipliers lead to significantly improved dual bounds and contributes decisively for solving an open instance with 420 customers. |
URI : | http://www.repositorio.ufop.br/handle/123456789/9360 |
metadata.dc.identifier.uri2: | https://www.sciencedirect.com/science/article/pii/S0167637717301049 |
metadata.dc.identifier.doi: | https://doi.org/10.1016/j.orl.2017.02.006 |
ISSN : | 0167-6377 |
Aparece en las colecciones: | DECOM - Artigos publicados em periódicos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
ARTIGO_LimitedMemoryRank.pdf Restricted Access | 388,47 kB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.