Exact methods based on node‐routing formulations for undirected arc‐routing problems

Quantifying the transport impacts of domestic waste collection strategies

“…Although exact algorithms for solving CVRP have been devised they cannot be used for large practical problems as they require too much computation time (Baldacci and Maniezzo, 2006). Consequently, a multitude of 'non-exact', heuristic solution methods have been proposed in the literature (Toth and Vigo, 2001).…”

Combinatorial optimization and Green Logistics

“…Pearn et al (1987) showed how a CARP with n edges can be converted into a corresponding Vehicle Routing Problem with (3n + 1) nodes. More recently Baldacci and Maniezzo (2006) showed how an equivalent node routing problem could be created by introducing a pair of nodes for each required edge and defining a new graph with distances between the nodes that have the required properties so that the solution of the node routing problem on the new graph will be equivalent to solving the CARP on the original graph. use a similar transformation of the graph but introduce additional constraints instead of changing the distances to produce an equivalent node routing problem.…”

A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

“…The capacitated arc routing problem (CARP) is one of the prototypical routing problems, asking a fleet of vehicles to service a set of clients which are distributed on the arcs of a road network. Every CARP instance can be transformed into an equivalent VRP instance with a number of nodes equal to the number of required arcs of the original CARP graph in case of directed instances [28], to twice that number in case of fully undirected instances [3], or to a combination thereof [29]. However, like most other efficient CARP algorithms we do not use this transformation.…”