The Capacitated Arc Routing Problem with Refill Points (CARP-RP) is a new variant of the Capacitated Arc Routing Problem (CARP). In a CARP situation, the vehicle servicing arcs has a finite capacity, and hence has to return to the depot or a secondary station to be refilled (or emptied). In contrast, in the CARP-RP, the vehicle servicing arcs must be refilled on the spot by using a second vehic...

This article explores a structural neighborhood decomposition for arc routing problems, in which the decisions about traversal orientations during services are made optimally as part of neighbor evaluation procedures. Using memory structures, bidirectional dynamic programming, and lower bounds, we show that a large neighborhood involving classical moves on the sequences of services along with o...

using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customerst...

The Capacitated Arc Routing Problem (CARP) is a challenging combinatorial optimization problem with many real-world applications, e.g., salting route optimization and fleet management. There have been many attempts at solving CARP using heuristic and meta-heuristic approaches, including evolutionary algorithms. However, almost all such attempts formulate CARP as a single-objective problem altho...

Mixed Capacitated Arc Routing Problem (MCARP) models arise in distribution or collecting problems where activities are performed by vehicles, with limited capacity, and are continuously distributed along some predefined links (routes, streets) of an associated network. Considering directed as well as undirected required links, it is a generalization of the well known Capacitated Arc Routing pro...