scholarly journals A branch-and-cut algorithm for the Orienteering Arc Routing Problem

2016 ◽  
Vol 66 ◽  
pp. 95-104 ◽  
Author(s):  
Claudia Archetti ◽  
Ángel Corberán ◽  
Isaac Plana ◽  
José M. Sanchis ◽  
M. Grazia Speranza
Keyword(s):  
Branch And Cut ◽  
Arc Routing ◽  
Routing Problem

scholarly journals Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem

2021 ◽  
Author(s):  
Timo Hintsch ◽  
Stefan Irnich ◽  
Lone Kiilerich
Keyword(s):  
Branch And Cut ◽  
Arc Routing ◽  
Master Program ◽  
Routing Problem ◽  
Capacitated Arc Routing Problem ◽  
Modeling Approaches ◽  
Postman Problems ◽  
Soft Cluster ◽  
The Individual ◽  
Capacitated Arc Routing

The soft-clustered capacitated arc-routing problem (SoftCluCARP) is a variant of the classical capacitated arc-routing problem. The only additional constraint is that the set of required edges, that is, the streets to be serviced, is partitioned into clusters, and feasible routes must respect the soft-cluster constraint, that is, all required edges of the same cluster must be served by the same vehicle. In this article, we design an effective branch-price-and-cut algorithm for the exact solution of the SoftCluCARP. Its new components are a metaheuristic and branch-and-cut-based solvers for the solution of the column-generation subproblem, which is a profitable rural clustered postman tour problem. Although postman problems with these characteristics have been studied before, there is one fundamental difference here: clusters are not necessarily vertex-disjoint, which prohibits many preprocessing and modeling approaches for clustered postman problems from the literature. We present an undirected and a windy formulation for the pricing subproblem and develop and computationally compare two corresponding branch-and-cut algorithms. Cutting is also performed at the master-program level using subset-row inequalities for subsets of size up to five. For the first time, these nonrobust cuts are incorporated into MIP-based routing subproblem solvers using two different modeling approaches. In several computational studies, we calibrate the individual algorithmic components. The final computational experiments prove that the branch-price-and-cut algorithm equipped with these problem-tailored components is effective: The largest SoftCluCARP instances solved to optimality have more than 150 required edges or more than 50 clusters.

Branch-and-cut algorithms for the split delivery vehicle routing problem

2014 ◽  
Vol 238 (3) ◽  
pp. 685-698 ◽  
Author(s):  
Claudia Archetti ◽  
Nicola Bianchessi ◽  
M. Grazia Speranza
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Cut ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Split Delivery
Sign in / Sign up

Export Citation Format

Share Document