Optimal solutions for routing problems with profits

Authors:
C. Archetti;N. Bianchessi;M. G. Speranza
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 7
Cited 0

A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm

Operations Research
Traveling Salesman Problems with Profits

Transportation Science
New dynamic programming algorithms for the resource constrained elementary shortest path problem

Networks
A column generation approach for the split delivery vehicle routing problem

Networks
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

Discrete Optimization

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to obtain primal bound values. In spite of its simplicity, the heuristic computes high quality solutions. Several unsolved benchmark instances have been solved to optimality.