A simheuristic approach for the stochastic team orienteering problem
A simheuristic approach for the stochastic team orienteering problem
The team orienteering problem is a variant of the well-known vehicle routing problem in which a set of vehicle tours are constructed in such in a way that:
(i) the total collected reward received from visiting a subset of customers is maximized; and (ii) the length of each vehicle tour is restricted by a pre-specified
limit. While most existing works refer to the deterministic version of the problem and focus on maximizing total reward, some degree of uncertainty (e.g., in customers’ service times or in travel times) should be expected in real-life applications. Accordingly, this paper proposes a simheuristic algorithm for solving the stochastic team orienteering problem, where goals other than maximizing the expected reward need to be considered. A series of numerical experiments contribute to illustrate the potential of our approach, which integrates Monte Carlo simulation inside a metaheuristic framework.
3208-3217
Panadero, Javier
2dca23fd-f7e1-491a-a9c0-a72f901c76e1
de Armas, Jesica
4f636d1a-c3c3-480e-8127-4f659308b706
Currie, Christine
dcfd0972-1b42-4fac-8a67-0258cfdeb55a
Juan, Angel A.
727ca41c-da96-40ea-8ea9-b27ab03aee49
4 December 2017
Panadero, Javier
2dca23fd-f7e1-491a-a9c0-a72f901c76e1
de Armas, Jesica
4f636d1a-c3c3-480e-8127-4f659308b706
Currie, Christine
dcfd0972-1b42-4fac-8a67-0258cfdeb55a
Juan, Angel A.
727ca41c-da96-40ea-8ea9-b27ab03aee49
Panadero, Javier, de Armas, Jesica, Currie, Christine and Juan, Angel A.
(2017)
A simheuristic approach for the stochastic team orienteering problem.
Chan, W.K.V., D'Ambrogio, A., Zacharewicz, G., Mustafee, N., Wainer, G. and Page, E.
(eds.)
In Proceedings of the 2017 Winter Simulation Conference.
IEEE.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
The team orienteering problem is a variant of the well-known vehicle routing problem in which a set of vehicle tours are constructed in such in a way that:
(i) the total collected reward received from visiting a subset of customers is maximized; and (ii) the length of each vehicle tour is restricted by a pre-specified
limit. While most existing works refer to the deterministic version of the problem and focus on maximizing total reward, some degree of uncertainty (e.g., in customers’ service times or in travel times) should be expected in real-life applications. Accordingly, this paper proposes a simheuristic algorithm for solving the stochastic team orienteering problem, where goals other than maximizing the expected reward need to be considered. A series of numerical experiments contribute to illustrate the potential of our approach, which integrates Monte Carlo simulation inside a metaheuristic framework.
Text
wsc17-team-orienteering
- Accepted Manuscript
Restricted to Registered users only
Request a copy
More information
Published date: 4 December 2017
Identifiers
Local EPrints ID: 416460
URI: http://eprints.soton.ac.uk/id/eprint/416460
PURE UUID: 9791411d-cbcf-4325-95f2-8ff8be41029d
Catalogue record
Date deposited: 19 Dec 2017 17:30
Last modified: 16 Mar 2024 03:30
Export record
Contributors
Author:
Javier Panadero
Author:
Jesica de Armas
Author:
Angel A. Juan
Editor:
W.K.V. Chan
Editor:
A. D'Ambrogio
Editor:
G. Zacharewicz
Editor:
N. Mustafee
Editor:
G. Wainer
Editor:
E. Page
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
