Goal-Induced Pareto Fronts for a Bi-Criterion Truck–Multiple-Drone Routing Problem

This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.

Detalles Bibliográficos
Autores: González Rodríguez, Pedro Luis, Sánchez Wells, David, León Blanco, José Miguel, Calle Suárez, Marcos, Andrade Pineda, José Luis
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2026
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:dnet:idus________::edeb1065e714f09d387a1a58880eecfb
Acceso en línea:https://hdl.handle.net/11441/186176
https://doi.org/10.3390/math14101635
Access Level:acceso abierto
Palabra clave:Goal programming
Multiobjective optimization
Pareto efficiency
Truck–multiple-drone routing
id ES_8739ccfd619672612ff778cec8affd71
oai_identifier_str oai:dnet:idus________::edeb1065e714f09d387a1a58880eecfb
network_acronym_str ES
network_name_str España
repository_id_str
spelling Goal-Induced Pareto Fronts for a Bi-Criterion Truck–Multiple-Drone Routing ProblemGonzález Rodríguez, Pedro LuisSánchez Wells, DavidLeón Blanco, José MiguelCalle Suárez, MarcosAndrade Pineda, José LuisGoal programmingMultiobjective optimizationPareto efficiencyTruck–multiple-drone routingThis article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.Truck–multiple-drone routing problems involve conflicting operational criteria and are therefore naturally suited to multiobjective analysis. In practical settings, however, decision makers may also specify aspiration levels for the considered criteria, which call for a target-oriented perspective. This paper studies a bi-criterion truck–multiple-drone routing problem through a goal-induced deviation framework in which the original objectives are transformed to normalized positive deviations with respect to prescribed targets. First, a general mathematical framework is introduced, and several structural properties are established, including dominance preservation, invariance under positive weighting, equivalence with the original Pareto structure when all the targets are violated, and the loss of discrimination when the targets are attainable. To address this latter effect, an enhanced goal-programming scalarization is proposed and shown to preserve consistency with the Pareto efficiency. The framework is then specialized to a truck–multiple-drone routing problem with truck time and makespan as criteria and evaluated on representative benchmark instances together with a broader attainable-target benchmark battery, using a common agent-based metaheuristic search framework adapted from literature. This search framework is employed both to estimate a reference Pareto frontier and to solve the GP and EGP scalarizations under the same computational scheme. The computational results illustrate two target regimes: When the targets are unattainable, both formulations are mainly driven by the minimization of positive deviations; when they are attainable, classical goal programming may return satisfactory but dominated solutions, whereas the enhanced formulation preserves discrimination and selects Pareto-efficient alternatives.Multidisciplinary Digital Publishing Institute (MDPI)Organización Industrial y Gestión de Empresas ITEP216: Tecnologías de la Información e Ingeniería de Organización2026info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/186176https://doi.org/10.3390/math14101635reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésMathematics, 14 (10), 1635. https://www.mdpi.com/2227-7390/14/10/1635info:eu-repo/semantics/openAccessoai:dnet:idus________::edeb1065e714f09d387a1a58880eecfb2026-06-17T12:51:07Z
dc.title.none.fl_str_mv Goal-Induced Pareto Fronts for a Bi-Criterion Truck–Multiple-Drone Routing Problem
title Goal-Induced Pareto Fronts for a Bi-Criterion Truck–Multiple-Drone Routing Problem
spellingShingle Goal-Induced Pareto Fronts for a Bi-Criterion Truck–Multiple-Drone Routing Problem
González Rodríguez, Pedro Luis
Goal programming
Multiobjective optimization
Pareto efficiency
Truck–multiple-drone routing
title_short Goal-Induced Pareto Fronts for a Bi-Criterion Truck–Multiple-Drone Routing Problem
title_full Goal-Induced Pareto Fronts for a Bi-Criterion Truck–Multiple-Drone Routing Problem
title_fullStr Goal-Induced Pareto Fronts for a Bi-Criterion Truck–Multiple-Drone Routing Problem
title_full_unstemmed Goal-Induced Pareto Fronts for a Bi-Criterion Truck–Multiple-Drone Routing Problem
title_sort Goal-Induced Pareto Fronts for a Bi-Criterion Truck–Multiple-Drone Routing Problem
dc.creator.none.fl_str_mv González Rodríguez, Pedro Luis
Sánchez Wells, David
León Blanco, José Miguel
Calle Suárez, Marcos
Andrade Pineda, José Luis
author González Rodríguez, Pedro Luis
author_facet González Rodríguez, Pedro Luis
Sánchez Wells, David
León Blanco, José Miguel
Calle Suárez, Marcos
Andrade Pineda, José Luis
author_role author
author2 Sánchez Wells, David
León Blanco, José Miguel
Calle Suárez, Marcos
Andrade Pineda, José Luis
author2_role author
author
author
author
dc.contributor.none.fl_str_mv Organización Industrial y Gestión de Empresas I
TEP216: Tecnologías de la Información e Ingeniería de Organización
dc.subject.none.fl_str_mv Goal programming
Multiobjective optimization
Pareto efficiency
Truck–multiple-drone routing
topic Goal programming
Multiobjective optimization
Pareto efficiency
Truck–multiple-drone routing
description This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.
publishDate 2026
dc.date.none.fl_str_mv 2026
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/186176
https://doi.org/10.3390/math14101635
url https://hdl.handle.net/11441/186176
https://doi.org/10.3390/math14101635
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Mathematics, 14 (10), 1635.
https://www.mdpi.com/2227-7390/14/10/1635
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Multidisciplinary Digital Publishing Institute (MDPI)
publisher.none.fl_str_mv Multidisciplinary Digital Publishing Institute (MDPI)
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869412431260811264
score 15,812429

Similares en LA Referencia