Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/17170
Título: | Generalized disaggregation algorithm for the vehicle routing problem with time windows and multiple routes |
Autor(es): | Macedo, Rita Hanafi, Said Clautiaux, François Alves, Cláudio Carvalho, J. M. Valério de |
Palavras-chave: | Vehicle routing problem Integer programming Combinatorial optimization Network flow model Vehicle Routing |
Data: | 2012 |
Resumo(s): | In this paper, we address the VRP with multiple routes and time windows. For this variant of the VRP, there is a time interval within which every customer must be visited. In addition, every vehicle is allowed to perform more than one route within the same planning period. Here, we propose a general disaggregation algorithm that improves the exact approach described in (Macedo et al., 2011). We describe a novel rounding rule and a new node disaggregation scheme based on different discretization units. We describe a new integer programming model for the problem, which can be used, with a slight modification, to exactly assess whether a given solution is feasible or not. Finally, we report some computational experiments performed on a set of instances from the literature. |
Tipo: | Artigo em ata de conferência |
URI: | https://hdl.handle.net/1822/17170 |
ISBN: | 9789898425973 |
Arbitragem científica: | yes |
Acesso: | Acesso restrito UMinho |
Aparece nas coleções: | LES/ALG - Textos completos em actas de encontros científicos internacionais com arbitragem |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
Generalized disaggregation algorithm for the vehicle routing problem with time windows and multiple routes.pdf Acesso restrito! | 255,88 kB | Adobe PDF | Ver/Abrir |