Zobrazit v EDS

A novel model for arc territory design: promoting Eulerian districts

Uloženo v:
Podrobná bibliografie
Název: A novel model for arc territory design: promoting Eulerian districts
Autoři: Garcia Ayala, Gariela, González Velarde, José Luis, Rios Mercados, Roger, Fernández Aréizaga, Elena
Přispěvatelé: Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa, Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
Zdroj: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Informace o vydavateli: Wiley, 2015.
Rok vydání: 2015
Témata: Combinatorial analysis, Combinatorial optimization, 05 Combinatorics::05B Designs and configurations [Classificació AMS], 0211 other engineering and technologies, Matemàtiques i estadística::Matemàtica discreta::Combinatòria [Àrees temàtiques de la UPC], 02 engineering and technology, Classificació AMS::05 Combinatorics::05B Designs and configurations, 3. Good health, 12. Responsible consumption, Configuracions i dissenys combinatoris, Integer linear programming, Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria, 11. Sustainability, 0202 electrical engineering, electronic engineering, information engineering, Arc services, Districting
Popis: 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.
Druh dokumentu: Article
Popis souboru: application/pdf
Jazyk: English
ISSN: 1475-3995
0969-6016
DOI: 10.1111/itor.12219
Přístupová URL adresa: https://upcommons.upc.edu/bitstream/2117/82920/1/paperR3.pdf
http://hdl.handle.net/2117/82920
https://dblp.uni-trier.de/db/journals/itor/itor23.html#Garcia-AyalaVRF16
https://core.ac.uk/display/41826967
http://yalma.fime.uanl.mx/~roger/work/Papers/report/report-pisis-2013-03.pdf
https://produccioncientifica.uca.es/documentos/600eee11f179b17b49331366
https://upcommons.upc.edu/bitstream/2117/82920/1/paperR3.pdf
https://upcommons.upc.edu/handle/2117/82920
Rights: Wiley Online Library User Agreement
CC BY NC ND
Přístupové číslo: edsair.doi.dedup.....07337a55e70ab39c7741437307f3082d
Databáze: OpenAIRE
Popis
Abstrakt: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.
ISSN:14753995
09696016
DOI:10.1111/itor.12219