Utilize este identificador para referenciar este registo:
http://hdl.handle.net/10071/25895
Autoria: | Nunes, A. C. Mourão, M. C. Prins, C. |
Data: | 2009 |
Título próprio: | Heuristic Methods for the sectoring arc routing problem |
Título da revista: | European Journal of Operational Research |
Volume: | 196 |
Número: | 3 |
Paginação: | 856 - 868 |
Referência bibliográfica: | Nunes, A. C., Mourão, M. C. & Prins, C. (2009). Heuristic Methods for the sectoring arc routing problem. European Journal of Operational Research, 196(3), 856-868. https://dx.doi.org/10.1016/j.ejor.2008.04.025 |
ISSN: | 0377-2217 |
ISBN: | 0377-2217 |
DOI (Digital Object Identifier): | 10.1016/j.ejor.2008.04.025 |
Palavras-chave: | Routing Heuristics Districting Capacitated arc routing problem Mixed graph |
Resumo: | The sectoring arc routing problem (SARP) is introduced to model activities associated with the streets of large urban areas, like municipal waste collection. The aim is to partition the street network into a given number of sectors and to build a set of vehicle trips in each sector, to minimize the total duration of the trips. Two two-phase heuristics and one best insertion method are proposed. In the two-phase methods, phase 1 constructs the sectors using two possible heuristics, while phase 2 solves a mixed capacitated arc routing problem (MCARP) to compute the trips in each sector. The best insertion method determines sectors and trips simultaneously. In addition to solution cost, some evaluation criteria such as imbalance, diameter and dispersion measures are used to compare algorithms. Numerical results on large instances with up to 401 nodes and 1056 links (arcs or edges) are reported and analysed. |
Arbitragem científica: | yes |
Acesso: | Acesso Aberto |
Aparece nas coleções: | BRU-RI - Artigos em revistas científicas internacionais com arbitragem científica |
Ficheiros deste registo:
Ficheiro | Tamanho | Formato | |
---|---|---|---|
article_10316.pdf | 413,47 kB | Adobe PDF | Ver/Abrir |
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.