Articles producció científica> Enginyeria Informàtica i Matemàtiques

The non-smooth and bi-objective team orienteering problem with soft constraints

  • Identification data

    Identifier: imarina:8787037
    Authors:
    Estrada-Moreno AFerrer AJuan AAPanadero JBagirov A
    Abstract:
    © 2020 by the authors. 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.
  • Others:

    Author, as appears in the article.: Estrada-Moreno A; Ferrer A; Juan AA; Panadero J; Bagirov A
    Department: Enginyeria Informàtica i Matemàtiques
    URV's Author/s: Estrada Moreno, Alejandro
    Keywords: Team orienteering problem Soft constraints Routing problem Particle swarm optimization Non-smooth optimization Multi-objective optimization Depot Biased-randomized algorithms Algorithm
    Abstract: © 2020 by the authors. 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.
    Thematic Areas: Química Mathematics (miscellaneous) Mathematics (all) Mathematics General mathematics Engineering (miscellaneous) Computer science (miscellaneous) Astronomia / física
    licence for use: https://creativecommons.org/licenses/by/3.0/es/
    Author's mail: alejandro.estrada@urv.cat
    Author identifier: 0000-0001-9767-2177
    Record's date: 2023-04-30
    Papper version: info:eu-repo/semantics/publishedVersion
    Link to the original source: https://www.mdpi.com/2227-7390/8/9/1461
    Papper original source: Mathematics. 8 (9):
    APA: Estrada-Moreno A; Ferrer A; Juan AA; Panadero J; Bagirov A (2020). The non-smooth and bi-objective team orienteering problem with soft constraints. Mathematics, 8(9), -. DOI: 10.3390/math8091461
    Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
    Article's DOI: 10.3390/math8091461
    Entity: Universitat Rovira i Virgili
    Journal publication year: 2020
    Publication Type: Journal Publications
  • Keywords:

    Computer Science (Miscellaneous),Engineering (Miscellaneous),Mathematics,Mathematics (Miscellaneous)
    Team orienteering problem
    Soft constraints
    Routing problem
    Particle swarm optimization
    Non-smooth optimization
    Multi-objective optimization
    Depot
    Biased-randomized algorithms
    Algorithm
    Química
    Mathematics (miscellaneous)
    Mathematics (all)
    Mathematics
    General mathematics
    Engineering (miscellaneous)
    Computer science (miscellaneous)
    Astronomia / física
  • Documents:

  • Cerca a google

    Search to google scholar