Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints

@article{RiquelmeRodrguez2014AdaptiveLN,
  title={Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints},
  author={Juan-Pablo Riquelme-Rodr{\'i}guez and Andr{\'e} Langevin and Michel Gamache},
  journal={Networks},
  year={2014},
  volume={64},
  pages={125-139}
}
This article describes the problem in which the edges of a network represent customers, and a quantity of material is delivered to them so that each one achieves a desired inventory level while finding the lowest-cost route of delivery. Routing and inventory decisions are made at the same time. An example of an application of this problem is dust suppression in open-pit mines. A fleet of trucks spray water along the roads of a mine. Humidity increases the effectiveness of dust-particle… CONTINUE READING