Cooperative Coevolution With Route Distance Grouping for Large-Scale Capacitated Arc Routing Problems

Abstract

In this paper, a divide-and-conquer approach is proposed to solve the large-scale capacitated arc routing problem (LSCARP) more effectively. Instead of considering the problem as a whole, the proposed approach adopts the cooperative coevolution (CC) framework to decompose it into smaller ones and solve them separately. An effective decomposition scheme… (More)
DOI: 10.1109/TEVC.2013.2281503

12 Figures and Tables

Topics

  • Presentations referencing similar topics