My Wish Lists Login / Join

Orienteering Problems

Models and Algorithms for Vehicle Routing Problems with Profits

By: Pieter Vansteenwegen, Aldy Gunawan

Write A Review

eText | 30 August 2019

At a Glance

Format
ePUB

eText

$84.99

or 4 interest-free payments of $21.25 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

This tutorial introduces readers to several variants of routing problems with profits. In these routing problems each node has a certain profit, and not all nodes need to be visited. Since the orienteering problem (OP) is by far the most frequently studied problem in this category of routing problems, the book mainly focuses on the OP. In turn, other problems are presented as variants of the OP, focusing on the similarities and differences. The goal of the OP is to determine a subset of nodes to visit and in which order, so that the total collected profit is maximized and a given time budget is not exceeded.

The book provides a comprehensive review of variants of the OP, such as the team OP, the team OP with time windows, the profitable tour problem, and the prize-collecting travelling salesperson problem. In addition, it presents mathematical models and techniques for solving these OP variants and discusses their complexity. Several simple examples and benchmark instances, together with their best-known results, are also included. Finally, the book reviews the latest applications of these problems in the fields of logistics, tourism and others.