2015
DOI: 10.1111/itor.12219
|View full text |Cite
|
Sign up to set email alerts
|

A novel model for arc territory design: promoting Eulerian districts

Abstract: The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be implemented within the region. This problem arises in numerous applications such as postal delivery, meter readings, winter gritting, road maintenance, and municipal solid waste collection. An integer linear programming model is proposed where a novel set of node parity constraints to favor Eule… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(10 citation statements)
references
References 23 publications
0
9
0
Order By: Relevance
“…The sectoring arc-routing problem appears when the detailed routing is considered (Mourão et al, 2009). However, some other districting applications foster some properties of the districts (contiguity, compactness, Eulerian properties of the resulting graph, among other) but do not consider explicitly the routing decisions (García-Ayala et al, 2016). There are several districting applications in waste collection planning (Gonela et al, 2020).…”
Section: Literature Reviewmentioning
confidence: 99%
“…The sectoring arc-routing problem appears when the detailed routing is considered (Mourão et al, 2009). However, some other districting applications foster some properties of the districts (contiguity, compactness, Eulerian properties of the resulting graph, among other) but do not consider explicitly the routing decisions (García-Ayala et al, 2016). There are several districting applications in waste collection planning (Gonela et al, 2020).…”
Section: Literature Reviewmentioning
confidence: 99%
“…García‐Ayala et al. (2016) study a districting model based on edge districting rather than node districting. They propose a novel model that attempts to deal with both districting and routing decisions.…”
Section: Related Workmentioning
confidence: 99%
“…García‐Ayala et al , also motivated by arc territory design, proposed a new formulation where new parity constraints on nodes are derived to favor the identification of Eulerian districts, that is, districts as close to Eulerian graphs as possible. Arc partitions inducing odd degree nodes are therefore penalized.…”
Section: Multiple Vehicle Arc Routing Problems (K‐arps)mentioning
confidence: 99%