Revision as of 04:53, 12 April 2025 edit Altenmann (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 245,238 edits {{copyed\|from=Large-scale capacitated arc routing problem\|to=Capacitated arc routing problem}} ← Previous edit		Revision as of 04:55, 12 April 2025 edit undo Altenmann (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 245,238 edits →Large-scale capacitated arc routing problem Next edit →
Line 8: ==Large-scale capacitated arc routing problem== A ~~'''~~large-scale capacitated arc routing problem~~'''~~ (~~'''~~LSCARP~~'''~~) is a variant of the ~~[[capacitated arc routing problem]]~~CARP that covers 300 or more edges to model complex arc routing problems at large scales. Yi Mei et al. published an algorithm for solving the large-scale capacitated arc routing problem using a cooperative co-evolution algorithm.<ref name=":0">{{Cite journal \|last1=Mei \|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=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 \|access-date=2022-07-14 \|archive-date=2022-06-15 \|archive-url=https://web.archive.org/web/20220615183634/http://ieeexplore.ieee.org/document/6595573/ \|url-status=live }}</ref>

Capacitated arc routing problem: Difference between revisions