Mixed Capacitated Arc Routing Problems (MCARP) aim to identify a set of vehicle trips that, starting and ending at a depot node, serve a given number of links, regarding the vehicles capacity, and minimizing a cost function. If both profits and costs on arcs are considered, the Profitable Mixed Capacitated Arc Routing Problem (PMCARP) may be defined. We present compact flow based models for the...

We propose a new algorithm for the Capacitated Arc Routing Problem (CARP). Our motivation to deal with this problem is related to its application in several real world scenarios such as street sweeping, urban waste collection and electric meter reading just to mention a few. Based on BRKGA metaheuristic, our algorithm introduces a new random key encoding for CARP, mutation to random keys string...

The soft-clustered capacitated arc-routing problem (SoftCluCARP) is a variant of the classical problem. only additional constraint that set required edges, is, streets to be serviced, partitioned into clusters, and feasible routes must respect soft-cluster constraint, all edges same cluster served by vehicle. In this article, we design an effective branch-price-and-cut algorithm for exact solut...

The Cumulative Capacitated Vehicle Routing Problem (CCVRP) is a variation of the classical Capacitated Vehicle Routing Problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compa...

We introduce the Mixed Capacitated General Routing Problem with Time Windows (MCGRPTW). This problem is defined over a mixed graph, for which some nodes, arcs and edges have strictly positive demand and must be serviced through a fleet of homogeneous capacitated vehicles. The aim is to find a set of least-cost vehicle routes that satisfy this requirement, while respecting pre-specified time win...

0

In this article a capacitated transportation problem is considered which is formulated as a multi objective capacitated transportation problem with mixed constraints. To determine the optimum compromise solution of multi objective capacitated transportation problem (MOCTP) with mixed constraints a Fuzzy multi objective programming approach has been applied in which we use three different forms ...

Given the emergence of two-echelon distribution systems in several practical contexts, this paper tackles, at strategic level, a network design problem under uncertainty. This is defined as stochastic multi-period capacitated location-routing (2E-SM-CLRP). It considers partitioned into two echelons: each echelon involves specific location-assignment-transportation schema that must cope with fut...

in the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. on the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. effective transport activities are also one of the most important c...