Capacitated arc routing problem
id:
capacitated-arc-routing-problem-240-1942565
title:
Capacitated arc routing problem
text:
In mathematics, the capacitated arc routing problem (CARP) is that of finding the shortest tour with a minimum graph/travel distance of a mixed graph with undirected edges and directed arcs given capacity constraints for objects that move along the graph that represent snow-plowers, street sweeping machines, or winter gritters, or other real-world objects with capacity constraints. The constraint can be imposed for the length of time the vehicle is away from the central depot, or a total distanc
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Capacitated_arc_routing_problem
date created:
date modified:
2023-06-27T03:14:47Z
main entity:
{"identifier":"Q113331237","url":"https://www.wikidata.org/entity/Q113331237"}
image:
fields total:
13
integrity:
13