Capacitated ARC Routing Problem with Extensons

The objective of Arc Routing Problem (ARP) is to find out the most efficient route to traverse the arc of a network. This paper describes how ARP has many practical applications such as street sweepers, snow plowing and salting, postal delivery, meter reading, etc. Capacitated Arc Routing Problem is a capacitated version of the ARP that has vehicle capacity constraints associated with satisfying arc demands. Several improvement methods for solving the CARP suggested and embedded in a heuristic procedure are shown in the paper. The results of implementation of the procedure on benchmark test problems look very promising as compared to other existing algorithms. The case study application indicates that the proposed procedure has the capability of solving real world problems and obtaining good solutions. Sensitivity analysis with respect to various important parameters in case study show that the procedure performs as expected with respect to changes in these parameters and can be applied to analyze depot locations.


  • English

Media Info

  • Media Type: Print
  • Features: Figures; References; Tables;
  • Pagination: pp 649-671
  • Monograph Title: Transportation and Traffic Theory. Flow, Dynamics and Human Interaction. 16th International Symposium on Transportation and Traffic Theory

Subject/Index Terms

Filing Info

  • Accession Number: 01002771
  • Record Type: Publication
  • ISBN: 0080446809
  • Files: TRIS
  • Created Date: Aug 5 2005 9:56AM