Scatter search with path relinking for linear bilevel problems

Calvete, Herminia I. (Universidad de Zaragoza) ; Galé, Carmen (Universidad de Zaragoza) ; Iranzo, José A. (Universidad de Zaragoza) ; Laguna, Manuel
Scatter search with path relinking for linear bilevel problems
Resumen: The literature includes very few instances of scatter search applications to bilevel optimization. These implementations have been proposed for problems in the field of logistics involving integer variables and are based on a structure where scatter search sets the values of the decisions at the upper level followed by the solution of the lower level problem. In this work, we develop a scatter search for solving linear bilevel problems. Our proposal employs a tailored path relinking procedure that generates solutions that are boundary feasible extreme points located in the trajectory between infeasible and feasible bilevel solutions. We perform scientific experimentation to determine the most effective configuration of our scatter search with path relinking. We also perform competitive experiments to determine where the proposed solution method stands when compared to the state of the art for tackling linear bilevel problems.
Idioma: Inglés
DOI: 10.1016/j.ejor.2025.04.043
Año: 2025
Publicado en: European Journal of Operational Research 326, 3 (2025), 439-450
ISSN: 0377-2217

Tipo y forma: Article (Published version)
Área (Departamento): Área Estadís. Investig. Opera. (Dpto. Métodos Estadísticos)

Creative Commons You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.


Exportado de SIDERAL (2025-10-17-14:16:56)


Visitas y descargas

Este artículo se encuentra en las siguientes colecciones:
Articles > Artículos por área > Estadística e Investigación Operativa



 Record created 2025-07-10, last modified 2025-10-17


Versión publicada:
 PDF
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)