A branch-and-cut-and-price approach for the capacitated m-ring-star problem

Authors:
Edna A. Hoshino;Cid C. De Souza
Affiliations:
Faculty of Computing, University of Mato Grosso do Sul, Campo Grande MS, Brazil;Institute of Computing, University of Campinas, Campinas SP, Brazil
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 5
Cited 0

A new branch-and-cut algorithm for the capacitated vehicle routing problem

Mathematical Programming: Series A and B
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
Column Generation Algorithms for the Capacitated m-Ring-Star Problem

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
The Capacitated m-Ring-Star Problem

Operations Research

Quantified Score

Hi-index	0.04

Visualization

Abstract

The capacitated m-ring-star problem 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 Steiner point present in a route. We develop a new exact algorithm for this problem using a branch-and-cut-and-price approach and compare its performance with that of a branch-and-cut algorithm proposed earlier in the literature. Computational results show that the new algorithm outperforms the branch-and-cut one in many instance classes.