A novel model for arc territory design: promoting Eulerian districts

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International transactions in operational research Ročník 23; číslo 3; s. 433 - 458
Hlavní autori: Garcia Ayala, Gariela, González Velarde, José Luis, Rios Mercados, Roger, Fernández Aréizaga, Elena
Médium: Journal Article Publikácia
Jazyk:English
Vydavateľské údaje: Oxford Blackwell Publishing Ltd 01.05.2016
Predmet:
05 Combinatorics
05B Designs and configurations
Arc services
Classificació AMS
Combinatorial analysis
Combinatorial optimization
Combinatòria
Computer networks
Configuracions i dissenys combinatoris
Districting
Garbage collection
Integer linear programming
Integer programming
Linear programming
Matemàtica discreta
Matemàtiques i estadística
Meters
Networks
Operational research
Operations research
Parity
Partitions
Reduction
Route choice
Studies
Àrees temàtiques de la UPC
ISSN:0969-6016, 1475-3995
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 Eulerian districts is introduced. Series of instances were solved to assess the impact of these parity constraints on the objective function and deadhead distance. Networks with up to 401 nodes and 764 edges were successfully solved. The model is useful at a tactical level as it can be used to promote workload balance, compactness, deadhead distance reduction and parity in districts.
Bibliografia:istex:6EB44DB2C446C9000311DE52617610B5034D45F0
ark:/67375/WNG-8DC274VC-J
ArticleID:ITOR12219
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0969-6016
1475-3995
DOI:10.1111/itor.12219