DeepAI AI Chat
Log In Sign Up

A revisited branch-and-cut algorithm for large-scale orienteering problems

by   Gorka Kobeaga, et al.

The orienteering problem is a route optimization problem which consists in finding a simple cycle that maximizes the total collected profit subject to a maximum distance limitation. In the last few decades, the occurrence of this problem in real-life applications has boosted the development of many heuristic algorithms to solve it. However, during the same period, not much research has been devoted to the field of exact algorithms for the orienteering problem. The aim of this work is to develop an exact method which is able to obtain optimality certification in a wider set of instances than with previous methods, or to improve the lower and upper bounds in its disability. We propose a revisited version of the branch-and-cut algorithm for the orienteering problem which includes new contributions in the separation algorithms of inequalities stemming from the cycle problem, in the separation loop, in the variables pricing, and in the calculation of the lower and upper bounds of the problem. Our proposal is compared to three state-of-the-art algorithms on 258 benchmark instances with up to 7397 nodes. The computational experiments show the relevance of the designed components where 18 new optima, 76 new best-known solutions and 85 new upper-bound values were obtained.


page 1

page 2

page 3

page 4


Relaxation heuristics for the set multicover problem with generalized upper bound constraints

We consider an extension of the set covering problem (SCP) introducing (...

Faster exact solution of sparse MaxCut and QUBO problems

The maximum-cut problem is one of the fundamental problems in combinator...

A note on computational approaches for the antibandwidth problem

In this note, we consider the antibandwidth problem, also known as dual ...

Branch-and-cut algorithms for the covering salesman problem

The Covering Salesman Problem (CSP) is a generalization of the Traveling...

Learned upper bounds for the Time-Dependent Travelling Salesman Problem

Given a graph whose arc traversal times vary over time, the Time-Depende...

Estimation of future discretionary benefits in traditional life insurance

In the context of traditional life insurance, the future discretionary b...