This HTML5 document contains 73 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n20https://global.dbpedia.org/id/
n10http://www.gerad.ca/~alainh/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n19http://www.lancaster.ac.uk/lums/search/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Arc_routing
rdf:type
yago:PsychologicalFeature100023100 yago:Algorithm105847438 dbo:Election yago:Activity100407535 yago:Rule105846932 yago:Event100029378 yago:Act100030358 yago:Procedure101023820 yago:WikicatRoutingAlgorithms yago:YagoPermanentlyLocatedEntity yago:Abstraction100002137
rdfs:label
Arc routing
rdfs:comment
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 s
dct:subject
dbc:Travelling_salesman_problem dbc:Routing_algorithms
dbo:wikiPageID
14040362
dbo:wikiPageRevisionID
1124945282
dbo:wikiPageWikiLink
dbr:Branch_and_bound dbr:NP-hardness dbr:Travelling_salesman_problem dbr:List_of_graph_theory_problems dbr:Route_inspection_problem dbr:Eulerian_path dbr:Mail dbr:Street_sweeper dbr:Cutting-plane_method dbr:Dead_mileage dbr:Convex_hull dbr:Leonhard_Euler dbr:Held–Karp_algorithm dbr:Snow_plow_routing_problem dbr:Heuristic_(computer_science) dbr:School_bus dbr:Snow_removal dbr:Kaliningrad dbr:Waste_collection dbr:Capacitated_arc_routing_problem dbr:Salt dbr:Dynamic_programming dbr:Lagrange_multiplier dbr:Winter_service_vehicle dbr:Chinese_Postman_Problem_Complexity_List dbr:Alexander_Rinnooy_Kan dbr:Deicing dbr:Snowplough dbc:Travelling_salesman_problem dbc:Routing_algorithms dbr:Pregolya dbr:Convex_optimization dbr:Branch_and_cut dbr:Königsberg dbr:NP-complete dbr:NP-hard dbr:Jan_Karel_Lenstra dbr:Province_of_Burgos dbr:Integer_programming dbr:Seven_Bridges_of_Königsberg dbr:Vehicle_routing_problem dbr:Mixed_Chinese_postman_problem dbr:Polynomial-time
dbo:wikiPageExternalLink
n10:Trends.pdf n19:%3Fq=arc+routing+problems
owl:sameAs
freebase:m.03crtcz wikidata:Q4785038 yago-res:Arc_routing n20:4S2Y2
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Short_description
dbo:abstract
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).
gold:hypernym
dbr:Process
prov:wasDerivedFrom
wikipedia-en:Arc_routing?oldid=1124945282&ns=0
dbo:wikiPageLength
39526
foaf:isPrimaryTopicOf
wikipedia-en:Arc_routing