The capacitated team orienteering and profitable tour problems

In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic proced...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of the Operational Research Society 2009-06, Vol.60 (6), p.831-842
Main Authors: Archetti, C, Feillet, D, Hertz, A, Speranza, M G
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
branch and price
Business and Management
column generation
Computer Science
Customers
Exact sciences and technology
Heuristics
Management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimal solutions
Orienteering
profitable tour problem
Profits
Studies
Taboos
Tabu search
team orienteering problem
Theoretical Paper
Theoretical Papers
Transportation
Travel
Traveling salesman problem
variable neighbourhood search
Vehicle capacity
Vehicle fleets
Vehicles
Vertices
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic procedures for the CTOP and the CPTP. The computational results show that the heuristic procedures often find the optimal solution and in general cause very limited errors.
ISSN:0160-5682
1476-9360
0160-5682
DOI:10.1057/palgrave.jors.2602603