CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
The non-smooth and bi-objective team orienteering problem with soft constraints
Authors
Adil Bagirov
Alejandro Estrada-Moreno
+3 more
Albert Ferrer
Angel Juan
Javier Panadero
Publication date
1 January 2020
Publisher
'MDPI AG'
Doi
Cite
Abstract
In the classical team orienteering problem (TOP), a fixed fleet of vehicles is employed, each of them with a limited driving range. The manager has to decide about the subset of customers to visit, as well as the visiting order (routes). Each customer offers a different reward, which is gathered the first time that it is visited. The goal is then to maximize the total reward collected without exceeding the driving range constraint. This paper analyzes a more realistic version of the TOP in which the driving range limitation is considered as a soft constraint: every time that this range is exceeded, a penalty cost is triggered. This cost is modeled as a piece-wise function, which depends on factors such as the distance of the vehicle to the destination depot. As a result, the traditional reward-maximization objective becomes a non-smooth function. In addition, a second objective, regarding the design of balanced routing plans, is considered as well. A mathematical model for this non-smooth and bi-objective TOP is provided, and a biased-randomized algorithm is proposed as a solving approach. © 2020 by the authors.This work has been partially supported by the Spanish Ministry of Economy and Competitiveness & FEDER (SEV-2015-0563), the Spanish Ministry of Science (PID2019-111100RB-C21, RED2018-102642-T), and the Erasmus+ Program (2019-I-ES01-KA103-062602)
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Federation ResearchOnline
See this paper in CORE
Go to the repository landing page
Download from data provider
vital:14821
Last time updated on 02/12/2022
Multidisciplinary Digital Publishing Institute
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:mdpi.com:/2227-7390/8/9/14...
Last time updated on 21/10/2022