A Scalable Approach to Capacitated Arc Routing Problems Based on Hierarchical Decomposition

@article{Tang2017ASA,
  title={A Scalable Approach to Capacitated Arc Routing Problems Based on Hierarchical Decomposition},
  author={Ke Tang and Juan Wang and Xiaodong Li and Xin Yao},
  journal={IEEE Transactions on Cybernetics},
  year={2017},
  volume={47},
  pages={3928-3940}
}
The capacitated arc routing problem (CARP) is a challenging optimization problem with lots of applications in the real world. Numerous approaches have been proposed to tackle this problem. Most of these methods, albeit showing good performance on CARP instances of small and median sizes, do not scale well to large-scale CARPs, e.g., taking at least a few hours to achieve a satisfactory solution on a CARP instance with thousands of tasks. In this paper, an efficient and scalable approach is… CONTINUE READING

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 45 REFERENCES

Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems

  • IEEE Transactions on Evolutionary Computation
  • 2009
VIEW 22 EXCERPTS
HIGHLY INFLUENTIAL

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

  • IEEE Transactions on Evolutionary Computation
  • 2014
VIEW 19 EXCERPTS
HIGHLY INFLUENTIAL