Large-scale capacitated arc routing problem
id:
large-scale-capacitated-arc-routing-problem-194-10789073
title:
Large-scale capacitated arc routing problem
text:
A large-scale capacitated arc routing problem (LSCARP) is a variant of the capacitated arc routing problem 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. LSCARP can be solved with a divide and conquer algorithm applied to route cutting off decomposition. The LSCARP can also be solved with an iterative local search that
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Large-scale_capacitated_arc_routing_problem
date created:
date modified:
2024-02-11T14:20:31Z
main entity:
{"identifier":"Q113331505","url":"https://www.wikidata.org/entity/Q113331505"}
image:
fields total:
13
integrity:
13