Please use this identifier to cite or link to this item:
Title: Location-arc routing problem: Heuristic approaches and test instances
Author: Lopes, Rui Borges
Plastria, Frank
Ferreira, Carlos
Sousa Santos, Beatriz
Keywords: Location-routing;Arc routing;Heuristics;Test instances
Issue Date: 2014
Publisher: Elsevier
Abstract: Location-routing is a branch of locational analysis that takes into account distribution aspects. The locationarc routing problem (LARP) considers scenarios where the demand is on the edges rather than being on the nodes of a network (usually a road network is assumed). Examples of such scenarios include locating facilities for postal delivery, garbage collection, road maintenance, winter gritting and street sweeping. This paper presents some heuristic approaches to tackle the LARP, as well as some proposals for benchmark instances (and corresponding results). New constructive and improvement methods are presented and used within different metaheuristic frameworks. Test instances were obtained from the capacitated arc routing problem (CARP) literature and adapted to address the LARP
Peer review: yes
DOI: 10.1016/j.cor.2013.10.003
ISSN: 0305-0548
Appears in Collections:CIDMA - Artigos
DEGEIT - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
Paper.pdf1.32 MBAdobe PDF    Request a copy

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.