Revision as of 03:11, 30 October 2022 edit Michael Hardy (talk \| contribs) Administrators 210,596 edits m Michael Hardy moved page Capacitated Arc Routing Problem to Capacitated arc routing problem ← Previous edit		Revision as of 05:30, 13 February 2023 edit undo Citation bot (talk \| contribs) Bots 5,870,898 edits Alter: url. URLs might have been anonymized. Add: s2cid, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. \| Use this bot. Report bugs. \| Suggested by Corvus florensis \| #UCB_webform 293/3500 Next edit →
Line 9: The CARP can be solved with combinatorial optimization including [[convex hull]]s. The [[large-scale capacitated arc routing problem]] (LSCARP) 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~~last1=Mei \|~~first~~first1=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~~https://ieeexplore.ieee.org/document/6595573/ \|journal=IEEE Transactions on Evolutionary Computation \|volume=18 \|issue=3 \|pages=435–449 \|doi=10.1109/TEVC.2013.2281503 \|s2cid=4851980 \|issn=1089-778X}}</ref> == References ==

Capacitated arc routing problem: Difference between revisions