Metraipolis › archive › dc_e2fd9534d7f2
Arc routing — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Arc_routing
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-09T18:50:46.949Z
- SHA-256 of the archived text
1ff45a607a236707d615ba4f03785c8e444249b70175b4f29461e965602e6d8b- Stable URL of this page
https://metraipolis.com/documento/dc_e2fd9534d7f2
How to cite
Arc routing — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Arc_routing (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_e2fd9534d7f2 (Metraipolis archive dc_e2fd9534d7f2, sha256 1ff45a607a236707d615ba4f03785c8e444249b70175b4f29461e965602e6d8b)
BibTeX
@misc{dce2fd9534d7f2,
title = {Arc routing — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Arc_routing},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_e2fd9534d7f2; sha256 1ff45a607a236707d615ba4f03785c8e444249b70175b4f29461e965602e6d8b},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Arc_routing. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Arc routing problems (ARP) are a category of general routing problems (GRP), which also includes node routing problems (NRP). The objective in ARPs and NRPs is to traverse the edges and nodes of a graph, respectively. The objective of arc routing problems involves minimizing the total distance and time, which often involves minimizing deadheading time, the time it takes to reach a destination. Arc routing problems can be applied to garbage collection, school bus route planning, package and newspaper delivery, deicing and snow removal with winter service vehicles that sprinkle salt on the road, mail delivery, network maintenance, street sweeping, police and security guard patrolling, and snow ploughing. Arc routings problems are NP hard, as opposed to route inspection problems that can be solved in polynomial-time. For a real-world example of arc routing problem solving, Cristina R. Delgado Serna & Joaquín Pacheco Bonrostro applied approximation algorithms to find the best school bus routes in the Spanish province of Burgos secondary school system. The researchers minimized the number of routes that took longer than 60 minutes to traverse first. They also minimized the duration of the longest route with a fixed maximum number of vehicles. There are generalizations of arc routing problems that introduce multiple mailmen, for example the k Chinese Postman Problem (KCPP). Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico). Fonte: Wikipedia in inglese, voce «Arc routing» — https://en.wikipedia.org/wiki/Arc_routing Wikidata Q4785038: «category of routing problem minimizing total distance and time» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4785038 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Arc_routing?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1375309783, consultata il 2026-11-09T18:47:11.393Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: d45a18da4a9bf62f20e935d437ba9da3a660bc5233d1ea56f41e6c2f222f800b