Circular Economy Modeling: A Multiobjective Closed-Loop Sustainable Supply Chain Problem Solved by Kernel Search

The multi-objective sustainable closed-loop supply chain network studied involves characteristics that produce high complexity due to the interaction of downstream and upstream strategic, tactical, and operational decisions, as well as sustainability elements. For this reason, a matheuristic algorithm, the Kernel search, is presented to solve large instances of the problem. After the algorithm parameter tuning, several instances are solved. A comparison with an augmented epsilon-constraint method is conducted in terms of speed and quality. The results show that the Kernel search matheuristic outperforms in the selected metrics, achieving an average improvement of 72% in computational time and from 0.47% to 28.18% in quality metrics. The solutions obtained deliver Pareto fronts in terms of economic, environmental, and social objectives.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-02-25
DOI
https://doi.org/10.3390/math14050773
Primary Topic
Sustainable Supply Chain Management
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Circular Economy Modeling: A Multiobjective Closed-Loop Sustainable Supply Chain Problem Solved by Kernel Search

Julie Drzymalski, Samuel Nucamendi‐Guillén, Joel-Novi Rodríguez-Escoto, Elias Olivares-Benitez
Mathematics
Sustainable Supply Chain Management
article

Circular Economy Modeling: A Multiobjective Closed-Loop Sustainable Supply Chain Problem Solved by Kernel Search

Julie Drzymalski, Samuel Nucamendi‐Guillén, Joel-Novi Rodríguez-Escoto, Elias Olivares-Benitez
article en

Abstract

The multi-objective sustainable closed-loop supply chain network studied involves characteristics that produce high complexity due to the interaction of downstream and upstream strategic, tactical, and operational decisions, as well as sustainability elements. For this reason, a matheuristic algorithm, the Kernel search, is presented to solve large instances of the problem. After the algorithm parameter tuning, several instances are solved. A comparison with an augmented epsilon-constraint method is conducted in terms of speed and quality. The results show that the Kernel search matheuristic outperforms in the selected metrics, achieving an average improvement of 72% in computational time and from 0.47% to 28.18% in quality metrics. The solutions obtained deliver Pareto fronts in terms of economic, environmental, and social objectives.

MathematicsVol. 14(5)
Temple University (US), Universidad Panamericana (MX)
Universidad Panamericana
Responsible consumption and production
Openalex Percentile: Top 45%
Sustainable Supply Chain Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.