This paper considers a Capacitated Location-Arc Routing Problem (CLARP) with Deadlines (CLARPD) and a fleet of capacitated heterogeneous vehicles. The proposed mixed integer programming model determines a subset of potential depots to be opened. the served roads within predefined deadlines. and the vehicles assigned to each open depot. https://ashleyshomestores.shop/product-category/backsplash-kit/