Location-arc routing problem: Heuristic approaches and test instances

Authors:
Rui Borges Lopes;Frank Plastria;Carlos Ferreira;Beatriz Sousa Santos
Affiliations:
-;-;-;-
Venue:
Computers and Operations Research
Year:
2014

Citing 10
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Transforming arc routing into node routing problems

Computers and Operations Research
Routing winter gritting vehicles

CO89 Selected papers of the conference on Combinatorial Optimization
Variable neighborhood search

Computers and Operations Research
Exact methods based on node-routing formulations for undirected arc-routing problems

Networks
Lower and upper bounds for the mixed capacitated arc routing problem

Computers and Operations Research
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

Journal of Heuristics
Solving capacitated arc routing problems using a transformation to the CVRP

Computers and Operations Research
Metaheuristics: From Design to Implementation

Metaheuristics: From Design to Implementation
The capacitated arc routing problem with refill points

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

Location-routing is a branch of locational analysis that takes into account distribution aspects. The location-arc 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.