Empreu aquest identificador per citar o enllaçar aquest ítem:
http://hdl.handle.net/10609/126067
Títol: | The non-smooth and bi-objective team orienteering problem with soft constraints |
Autoria: | Estrada-Moreno, Alejandro Ferrer, Albert Juan, Angel A. Panadero Martínez, Javier Bagirov, Adil |
Altres: | Universitat Oberta de Catalunya (UOC) Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3) Universitat Rovira i Virgili (URV) Universitat Politècnica de Catalunya (UPC) Euncet Business School Federation University |
Citació: | Estrada-Moreno, A., Ferrer, A., Juan, A. A., Panadero, J., Bagirov, A. (2020). The non-smooth and bi-objective team orienteering problem with soft constraints. Mathematics, 9(8). ISSN: 2227-7390. pg. 1-16. doi: 10.3390/math8091461 |
Resum: | 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. |
Paraules clau: | problema d'orientació de l'equip restriccions suaus optimització no suau optimització multiobjectiu algoritmes esbiaixats-aleatoris |
DOI: | 10.3390/math8091461 |
Tipus de document: | info:eu-repo/semantics/article |
Versió del document: | info:eu-repo/semantics/publishedVersion |
Data de publicació: | 1-set-2020 |
Llicència de publicació: | http://creativecommons.org/licenses/by/3.0/es/ |
Apareix a les col·leccions: | Articles cientÍfics Articles |
Arxius per aquest ítem:
Arxiu | Descripció | Mida | Format | |
---|---|---|---|---|
mathematics-08-01461.pdf | 377,73 kB | Adobe PDF | Veure/Obrir |
Comparteix:
Aquest ítem està subjecte a una llicència de Creative Commons Llicència Creative Commons