Search
The purpose of this paper is to develop a data-driven matheuristic for the Commodity-Split Multi-Compartment Capacitated Arc Routing Problem (CSMC-CARP). This problem arises in curbside waste collection, where there are...
We model and solve several families of location-arc routing problems on an undirected graph. These problems extend the multidepot rural postman problem to the case where the depots are not fixed. The aim is to select the...
The purpose of this paper is to solve a multi-period garbage collection problem involving several garbage types called fractions, such as general and organic waste, paper and carboard, glass and metal, and plastic. The study...
The purpose of this paper is to solve a multi-period garbage collection problem involving several garbage types called fractions, such as general and organic waste, paper and carboard, glass and metal, and plastic. The study...
The purpose of this paper is to develop a fast heuristic called FastCARP for the solution of large-scale capacitated arc routing problems, with or without duration constraints. This study is motivated by a waste collection...
The purpose of this paper is to develop a fast heuristic called FastCARP for the solution of large-scale capacitated arc routing problems, with or without duration constraints. This study is motivated by a waste collection...
The purpose of this paper is to develop a data-driven matheuristic for the Commodity-Split Multi-Compartment Capacitated Arc Routing Problem (CSMC-CARP). This problem arises in curbside waste collection, where there are...
This paper studies the target visitation arc routing problem on an undirected graph. This problem combines the well-known undirected rural postman problem and the linear ordering problem. In this problem, there is a set of...
We model and solve several families of location-arc routing problems on an undirected graph. These problems extend the multidepot rural postman problem to the case where the depots are not fixed. The aim is to select the...
This paper studies the target visitation arc routing problem on an undirected graph. This problem combines the well-known undirected rural postman problem and the linear ordering problem. In this problem, there is a set of...