Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A new branch-and-cut algorithm for the capacitated vehicle routing problem
Mathematical Programming: Series A and B
Traveling Salesman Problems with Profits
Transportation Science
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Mathematical Programming: Series A and B
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
INFORMS Journal on Computing
The Capacitated m-Ring-Star Problem
Operations Research
A branch-and-cut-and-price approach for the capacitated m-ring-star problem
Discrete Applied Mathematics
A memetic algorithm for the capacitated m-ring-star problem
Applied Intelligence
| Hi-index | 0.00 |
In this paper we propose an integer programming formulation for the capacitated m-ring-star problem () based on a set coveringmodel and develop an exact branch-and-price() algorithm to solve it exactly. The is a variant of the classical one-depot capacitated vehicle routing problem in which a customer is either on a route or is connected to another customer or to some connection pointpresent in a route. The set of potential connection points and the number mof vehicles are given a priori. Routing and connection costs are also known and the goal is to minimize the sum of routing and connection costs. To our knowledge, the only exact approach for the is a branch-and-cut() proposed in [2]. Extensive experimentation reported here shows that our algorithm is competitive with the algorithm. This performance was achieved after a profound investigation of the alternatives for column generation relaxation and a careful implementation of the pricing algorithm.