Solving the Team Orienteering Problem with Cutting Planes

The Team Orienteering Problem (TOP) is an attractive variant of the Vehicle Routing Problem (VRP). The aim is to select customers and at the same time organize the visits for a vehicle fleet so as to maximize the collected profits and subject to a travel time restriction on each vehicle. In this pap...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2016-04
Main Authors: El-Hajj, Racha, Dang, Duc-Cuong, Aziz Moukrim
Format: Article
Language:English
Subjects:
Algorithms
Customers
Cutting
Identification methods
Information retrieval
Orienteering
Planes
Polynomials
Route planning
Routing
Travel time
Vehicle routing
Vehicles
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Team Orienteering Problem (TOP) is an attractive variant of the Vehicle Routing Problem (VRP). The aim is to select customers and at the same time organize the visits for a vehicle fleet so as to maximize the collected profits and subject to a travel time restriction on each vehicle. In this paper, we investigate the effective use of a linear formulation with polynomial number of variables to solve TOP. Cutting planes are the core components of our solving algorithm. It is first used to solve smaller and intermediate models of the original problem by considering fewer vehicles. Useful information are then retrieved to solve larger models, and eventually reaching the original problem. Relatively new and dedicated methods for TOP, such as identification of irrelevant arcs and mandatory customers, clique and independent-set cuts based on the incompatibilities, and profit/customer restriction on subsets of vehicles, are introduced. We evaluated our algorithm on the standard benchmark of TOP. The results show that the algorithm is competitive and is able to prove the optimality for 12 instances previously unsolved.
ISSN:2331-8422
DOI:10.48550/arxiv.1604.02934