Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem
نویسندگان
چکیده
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 solution SoftCluCARP. Its new components are metaheuristic branch-and-cut-based solvers column-generation subproblem, which profitable rural clustered postman tour Although problems with these characteristics have been studied before, there one fundamental difference here: clusters not necessarily vertex-disjoint, prohibits many preprocessing modeling approaches from literature. We present undirected windy formulation pricing subproblem develop computationally compare two corresponding branch-and-cut algorithms. Cutting also performed at master-program level using subset-row inequalities subsets size up five. For first time, nonrobust cuts incorporated MIP-based routing different approaches. several computational studies, calibrate individual algorithmic components. final experiments prove equipped problem-tailored effective: largest SoftCluCARP instances solved optimality more than 150 or 50 clusters.
منابع مشابه
Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
This paper presents the first full-fledged branch-and-price (bap) algorithm for the capacitated arc-routing problem (CARP). Prior exact solution techniques either rely on cutting planes or the transformation of the CARP into a node-routing problem. The drawbacks are either models with inherent symmetry, dense underlying networks, or a formulation where edge flows in a potential solution do not ...
متن کاملA Branch-and-Cut-and-Price Algorithm for the Capacitated Location-Routing Problem
In this paper we present an exact algorithm for the Capacitated LocationRouting Problem (CLRP) based on column and cut generation. The CLRP is formulated as a set-partitioning problem which also inherits all of the known valid inequalities for the flow formulations of the CLRP. We introduce five new families of inequalities that are shown to dominate some of the cuts from the two-index formulat...
متن کاملRobust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Abstract. The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an algorithm that combines both approaches: it works over the intersection of two polytopes, one associated with a traditional Lagrangean relaxation over q-routes, the other defined by bound, degree and ca...
متن کاملA branch-price-and-cut algorithm for the mixed capacitated general routing problem with time windows
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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2021
ISSN: ['0041-1655', '1526-5447']
DOI: https://doi.org/10.1287/trsc.2020.1036