Revision as of 23:11, 14 July 2022 edit WalkingRadiance (talk \| contribs) Extended confirmed users 2,428 edits create article capacitated arc routing problem Tag: Visual edit		Revision as of 23:13, 14 July 2022 edit undo WalkingRadiance (talk \| contribs) Extended confirmed users 2,428 edits source to journal article added Tag: Visual edit Next edit →
Line 8: The CARP can be solved with combinatorial optimization including convex hulls. The Large Scale Capacitated Arc Routing Problem is a variant of the Capacitated Arc Routing Problem that applies to hundreds of edges and nodes to realistically simulate and model large complex environments.<ref>{{Cite journal \|last=Mei \|first=Yi \|last2=Li \|first2=Xiaodong \|last3=Yao \|first3=Xin \|date=June 2014 \|title=Cooperative Coevolution With Route Distance Grouping for Large-Scale Capacitated Arc Routing Problems \|url=http://ieeexplore.ieee.org/document/6595573/ \|journal=IEEE Transactions on Evolutionary Computation \|volume=18 \|issue=3 \|pages=435–449 \|doi=10.1109/TEVC.2013.2281503 \|issn=1089-778X}}</ref> == References ==

Capacitated arc routing problem: Difference between revisions