Location arc routing problem with inventory constraints

• Location and routing decisions are done simultaneously.
• A mathematical model combining location and routing decisions is proposed.
• Two methods for selecting the initial depot location.
• Two algorithms that modify the initial depot location and vehicle routing.

Dust suppression of hauling roads in open pit mines is done by periodically spraying water from a water truck. The objective of this paper is to present and compare two methods for locating water depots along the road network so that penalty costs for the lack of humidity in roads and routing costs are minimized. Because the demands are located on the arcs of the network and the arcs require service more than once in a time horizon, this problem belongs to the periodic capacitated arc routing domain. We compare two methods for finding the initial depot location. We then use an exchange algorithm to modify the initial location and an adaptive large neighborhood search algorithm to modify the initial routing of vehicles. This method is the first one used for depot location in periodic arc routing problems.